• Corpus ID: 2029211

# How incomplete is your semantic web reasoner? systematic analysis of the completeness of query answering systems

@inproceedings{Stoilos2010HowII,
title={How incomplete is your semantic web reasoner? systematic analysis of the completeness of query answering systems},
author={Giorgos Stoilos and Bernardo Cuenca Grau and Ian Horrocks},
booktitle={AAAI 2010},
year={2010}
}
• Published in AAAI 11 July 2010
• Computer Science
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up completeness (i.e., they do not guarantee to return all query answers). It may be useful or even critical to the designers and users of such systems to understand how much and what kind of information is (potentially) being lost. We present a method for generating test data that can be used to provide at least partial…
5 Citations

## Tables and Topics from this paper

Repairing Ontologies for Incomplete Reasoners
• Computer Science
SEMWEB
• 2011
This work investigates the problem of 'repairing' an ontology τ such that a reasoner that is incomplete for τ becomes complete when used with τ ∪ R, and presents a practical algorithm for computing R.
Repairing Incomplete Reasoners
• Computer Science
Description Logics
• 2011
This paper identifies conditions on q, T and ans that are sufficient to ensure the existence of a repair and presents a practical repair generation algorithm, suggesting that repairs of small size can be computed for well-known ontologies and reasoners.
Completeness Management for RDF Data Sources
• Computer Science
ACM Trans. Web
• 2018
This article introduces a theoretical framework allowing augmentation of RDF data sources with statements, also expressed in RDF, about their completeness, and studies the impact of completeness statements on the complexity of query answering by considering different fragments of the SPARQL language.
Verifying Reasoner Correctness - A Justication Based Method
• Computer Science
ORE
• 2015
A new method for debugging classification across multiple reasoners is proposed which employs justifications generated from the set of entailments that reasoners disagree upon to determine the cause of the disagreement.
Parallel ABox Reasoning of ${\mathcal{EL}}$ Ontologies
• Computer Science
JIST
• 2011
A parallel TBox reasoning algorithm is extended to parallel ABox reasoning algorithms for ELH_{R+}$, which also supports the bottom concept so as to model disjointness and inconsistency and shows that a naive implementation can compute all ABox entailments of a Not-Galen− ontology with about 1 million individuals and 9 million axioms in about 3 minutes. ## References SHOWING 1-10 OF 15 REFERENCES Conjunctive Query Answering in the Description Logic EL Using a Relational Database System • Computer Science IJCAI • 2009 A novel approach to CQ answering that enables the use of standard relational database systems as the basis for query execution is proposed. Data Complexity of Query Answering in Expressive Description Logics via Tableaux • Computer Science Journal of Automated Reasoning • 2008 It is established that, for a whole range of sublogics of$\mathcal{SHOIQ}$that contain$\Mathcal{AL}\$, answering such queries has coNP-complete data complexity, and a tight coNP upper bound for positive existential queries without transitive roles is proved.
Conjunctive Query Answering for the Description Logic SHIQ
• Mathematics, Computer Science
IJCAI
• 2007
This paper considers conjunctive queries over knowledge bases formulated in the popular DL SHIQ and allows transitive roles in both the query and the knowledge base and shows that query answering is decidable and establishes the following complexity bounds: regarding combined complexity, a deterministic algorithm for query answering that needs time single exponential and double exponential in the size of the query.
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
• Computer Science
Journal of Automated Reasoning
• 2007
It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
Finding All Justifications of OWL DL Entailments
• Computer Science
ISWC/ASWC
• 2007
This paper presents several algorithms for computing all the justifications of an entailment in an OWL-DL Ontology and shows, by an empirical evaluation, that even a reasoner independent approach works well on real ontologies.
LUBM: A benchmark for OWL knowledge base systems
• Computer Science
J. Web Semant.
• 2005
We describe our method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications. We present the Lehigh University Benchmark (LUBM) as an example of how to
Towards a Complete OWL Ontology Benchmark
• Computer Science
ESWC
• 2006
The extended benchmark, named University Ontology Benchmark (UOBM), includes both OWL Lite and OWL DL ontologies covering a complete set of OWLlite and DL constructs, respectively, and adds necessary properties to construct effective instance links and improve instance generation methods to make the scalability testing more convincing.