Web Intelligence, IEEE / WIC / ACM International Conference on (2006)
Hong Kong, China
Dec. 18, 2006 to Dec. 22, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WI.2006.150
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.
J. Zhang and S. Liu, "Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem," 2006 IEEE/WIC/ACM International Conference on Web Intelligence(WI), Hong Kong, 2006, pp. 510-513.