Satisfiability Checking and Query Answering for Large Ontologies

15 pages•Published: August 19, 2013

Christoph Weidenbach and Patrick Wischnewski

Abstract

In this paper we develop a sound, complete and terminating superposition calculus
plus 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.

Links:	https://easychair.org/publications/paper/P85
	https://doi.org/10.29007/n1sv

BibTeX entry

@inproceedings{PAAR-2012:Satisfiability_Checking_Query_Answering,
  author    = {Christoph Weidenbach and Patrick Wischnewski},
  title     = {Satisfiability Checking and Query Answering for Large Ontologies},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/P85},
  doi       = {10.29007/n1sv},
  pages     = {163-177},
  year      = {2013}}

Download PDF Open PDF in browser