Download PDFOpen PDF in browserSatisfiability Checking and Query Answering for Large Ontologies15 pages•Published: August 19, 2013AbstractIn this paper we develop a sound, complete and terminating superposition calculusplus a query answering calculus for the BSH-Y2 fragment of the Bernays-Schoenfinkel Horn class of first-order logic. BSH-Y2 can be used to represent expressive ontologies. In addition to checking consistency, our calculus supports query answering for queries with arbitrary quantifier alternations. Experiments on BSH-Y2 (fragments) of several large ontologies show that our approach advances the state of the art. Keyphrases: first order reasoning, ontology reasoning, query answering, satisfiability checking, superposition In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 163-177.
|