Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem

Authors:
Sheng Liu;Jian Zhang
Affiliations:
Chinese Academy of Sciences, China;Chinese Academy of Sciences, China
Venue:
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Year:
2006

Citing 5
Cited 1

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Matching RDF Graphs

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
RDF entailment as a graph homomorphism

ISWC'05 Proceedings of the 4th international conference on The Semantic Web

Disambiguating identity web references using Web 2.0 data and semantics

Web Semantics: Science, Services and Agents on the World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.