DocumentCode
3229639
Title
Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem
Author
Liu, Sheng ; Zhang, Jian
Author_Institution
Lab. of Comput. Sci., Chinese Acad. of Sci., Beijing
fYear
2006
fDate
18-22 Dec. 2006
Firstpage
510
Lastpage
513
Abstract
The resource description framework (RDF) has been accepted as a standard for semantic representation of resources. Efficient methods and tools are needed to solve problems emerging from RDF based systems, for example, checking equality of two RDF graphs and retrieving subgraphs from another RDF graph. This paper proposes a method that encodes these problems into satisfiability (SAT) instances and solves them by employing efficient SAT solvers. A prototype tool is implemented and preliminary experimental results are given
Keywords
computability; electronic data interchange; graph theory; meta data; pattern matching; semantic Web; resource description framework graph; satisfiability problem; semantic representation; Computer science; Information resources; Laboratories; Logic testing; Prototypes; Resource description framework; Semantic Web; Software standards; System testing; World Wide Web;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Intelligence, 2006. WI 2006. IEEE/WIC/ACM International Conference on
Conference_Location
Hong Kong
Print_ISBN
0-7695-2747-7
Type
conf
DOI
10.1109/WI.2006.150
Filename
4061422
Link To Document