Paper Info
Title
On Horn Conjunctive Queries
Abstract
Most query rewriting systems focus on answering Conjunctive Queries that have only positive atoms because the use of negation can easily make the entailment problem undecidable. However, restricting the way we use negation on Conjunctive Queries can make the entailment problem decidable and can also ensure the existence of algorithms based on Query Rewriting that find their answers. In this paper, we propose a definition of Horn Conjunctive Queries to denote queries that have one negated atom. We also present an algorithm based on query rewriting that finds the answers of a Union of Horn Conjunctive Queries with respect to a set of Existential Rules. Additionally, we conduct some experiments to compare the performance with other state of the art systems that are able to answer conjunctive queries with negation using tableaux algorithms. The experimental data confirms that our system performs better than the other systems we considered when dealing with big ontologies.
Year
DOI
Venue
2018
10.1007/978-3-319-99906-7_8
RULES AND REASONING (RULEML+RR 2018)
Field
DocType
Volume
Ontology (information science),Query Rewriting,Data mining,Conjunctive query,Logical consequence,Negation,Computer science,Decidability,Theoretical computer science,Undecidable problem
Conference
11092
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
10
2
Name
Order
Citations
PageRank
Enrique Matos Alfonso110.70
Giorgos Stamou2120076.88