Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fermüller, C., Leitsch, A., Tammet, T., Zamov, N.: Resolution Methods for the Decision Problem. LNCS, vol. 679. Springer, Heidelberg (1993)
Robinson, A.J., Voronkov, A. (eds.): Handbook of Automated Reasoning. MIT Press, Cambridge (2001)
Baader, F., Calvanese, V., McGuinness, V., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)
Hustadt, U., Schmidt, R.A.: Issues of decidability for description logics in the framework of resolution. In: Caferra, R., Salzer, G. (eds.) FTP 1998. LNCS (LNAI), vol. 1761, pp. 192–206. Springer, Heidelberg (2000)
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/
Hayes, P. (ed.): RDF Semantics. W3C Working Draft, January 23. W3C (2003), http://www.w3.org/TR/rdf-mt/
Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American (May 2001)
Semantic web. W3C, http://www.w3.org/2001/sw/
Tammet, T.G.: Journal of Automated Reasoning 18(2), 199–204 (1997)
Tammet, T.: Towards Efficient Subsumption. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 427–441. Springer, Heidelberg (1998)
Tammet, T.G.: Tallinn Technical University, http://www.ttu.ee/it/gandalf/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tammet, T. (2004). Chain Resolution for the Semantic Web. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive