UCQ-Rewritings for disjunctive knowledge and queries with negated atoms

Issue title: Advancing Agriculture through Semantic Data Management

Article type: Research Article

Authors: Matos Alfonso, Enrique^{; *} | Chortaras, Alexandros | Stamou, Giorgos

Affiliations: Electrical and Computer Engineering, National Technical University of Athens, Greece. E-mails: gardero@image.ntua.gr, achort@cs.ntua.gr, gstam@cs.ntua.gr

Correspondence: [*] Corresponding author. E-mail: gardero@image.ntua.gr.

Abstract: In this paper, we study the problem of query rewriting for disjunctive existential rules. Query rewriting is a well-known approach for query answering on knowledge bases with incomplete data. We propose a rewriting technique that uses negative constraints and conjunctive queries to remove the disjunctive components of disjunctive existential rules. This process eventually generates new non-disjunctive rules, i.e., existential rules. The generated rules can then be used to produce new rewritings using existing rewriting approaches for existential rules. With the proposed technique we are able to provide complete UCQ-rewritings for union of conjunctive queries with universally quantified negation. We implemented the proposed algorithm in the Completo system and performed experiments that evaluate the viability of the proposed solution.

Keywords: Disjunctive rules, queries with negation, backward chaining and query rewriting

DOI: 10.3233/SW-200399

Journal: Semantic Web, vol. 12, no. 4, pp. 685-709, 2021