Chain Resolution for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general schema for applying resolution provers and propose a new search strategy ”chain resolution” tailored for large ontologies. Chain resolution is an extension of the standard resolution algorithm. The main idea of the extension is to treat binary clauses of the general form A(x) ∨ B(x) with a special chain resolution mechanism, which is different from standard resolution used otherwise. Chain resolution significantly reduces the size of the search space for problems containing a large number of simple implications, typically arising from taxonomies. Finally we present a compilation-based schema for practical application of resolution-based methods as inference engines for Semantic Web queries.
KeywordsDescription Logic Predicate Symbol Search State Propositional Variation Unit Clause
Unable to display preview. Download preview PDF.
- [OWL]Patel-Schneider, P.F., Hayes, P., Horrocks, I. (eds.): OWLWeb Ontology Language. Semantics and Abstract Syntax. W3C Working Draft, March 31. W3C (2003), http://www.w3.org/TR/owl-semantics/
- [RDF]Hayes, P. (ed.): RDF Semantics. W3C Working Draft, January 23. W3C (2003), http://www.w3.org/TR/rdf-mt/
- [SemanticWeb01]Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American (May 2001)Google Scholar
- [SemanticWebURL]Semantic web. W3C, http://www.w3.org/2001/sw/
- [Tammet02]Tammet, T.G.: Tallinn Technical University, http://www.ttu.ee/it/gandalf/