Paper Info
Title
Rewriting Queries With Negated Atoms
Abstract
Query rewriting is a popular approach for ontology based data access and in general for first order rewritable knowledge bases. The algorithms defined in the field are based on conjunctive queries with no use of negation over the atoms that are part of them. Also, the constraints present in the knowledge base are ignored in the process of rewriting a query and they are only used to check the consistency of the data. In this paper, we study the problem of answering queries that allow negated atoms. Our approach uses a rewriting algorithm as a black box and the constraints in the system to find a set of conjunctive queries without negated atoms that is equivalent to the original query containing negated atoms. A system (Completo) was implemented with the proposed method and compared to another system (Rebsir) that is able to rewrite negated concepts. In the experimental evaluation Completo performed better than Rebsir for most of the datasets in the benchmark and it portrayed a more scalable performance i.e. describing a faster relative performance with respect to Rebsir's performance with the increase of the size of assertions in the dataset.
Year
DOI
Venue
2017
10.1007/978-3-319-61252-2_11
RULES AND REASONING
Field
DocType
Volume
Black box (phreaking),Data mining,Ontology,Conjunctive query,Negation,Computer science,Theoretical computer science,Rewriting,Knowledge base,Data access,Scalability
Conference
10364
ISSN
Citations 
PageRank 
0302-9743
1
0.37
References 
Authors
11
2
Name
Order
Citations
PageRank
Enrique Matos Alfonso110.70
Giorgos Stamou2120076.88