loading...
Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem
Hong Kong, China December 18-December 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WI.2006.1502006 IEEE/WIC/ACM International Confe ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sheng Liu, Chinese Academy of Sciences, China
Jian Zhang, Chinese Academy of Sciences, China
The Resource Description Framework (RDF) has been ac- cepted as a standard for semantic representation of re- sources. Efficient methods and tools are needed to solve problems emerging from RDF based systems, for exam- ple, 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.
Citation:
Sheng Liu, Jian Zhang, "Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem," wi, pp.510-513, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.