Chain Resolution for the Semantic Web

  • Tanel Tammet
Conference paper

DOI: 10.1007/978-3-540-25984-8_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3097)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Tanel Tammet
    • 1
  1. 1.Tallinn Technical University 

Personalised recommendations