Reasoning on Datalog^± Ontologies with Abductive Logic Programming

Issue title: Special Issue on the 30th Italian Conference on Computational Logic: CILC 2015

Guest editors: Marco Maratea, Viviana Mascardi, Davide Ancona and Alberto Pettorossi

Article type: Research Article

Authors: Gavanelli, Marco^{a; *; †} | Lamma, Evelina^b | Riguzzi, Fabrizio^c | Bellodi, Elena^d | Zese, Riccardo^e | Cota, Giuseppe^f

Affiliations: [a] Dipartimento di Ingegneria, University of Ferrara, Italy. [email protected] | [b] Dipartimento di Ingegneria, University of Ferrara, Italy. [email protected] | [c] Dipartimento di Matematica e Informatica, University of Ferrara, Italy. [email protected] | [d] Dipartimento di Ingegneria, University of Ferrara, Italy. [email protected] | [e] Dipartimento di Ingegneria, University of Ferrara, Italy. [email protected] | [f] Dipartimento di Ingegneria, University of Ferrara, Italy. [email protected]

Correspondence: [†] Address for correspondence: Dipartimento di Ingegneria, University of Ferrara

Note: [*] This work was partially supported by GNCS project DECORE.

Note: [1] https://www.w3.org/TR/owl2-profiles

Note: [2] https://www.w3.org/standards/techs/rif

Note: [3] https://www.w3.org/Submission/SWRL/

Abstract: Ontologies form the basis of the Semantic Web. Description Logics (DLs) are often the languages of choice for modeling ontologies. Integration of DLs with rules and rule-based reasoning is crucial in the so-called Semantic Web stack vision - a complete stack of recommendations and languages each based on and/or exploiting the underlying layers - which adds new features to the standards used in theWeb. The growing importance of the integration between DLs and rules is proved by the definition of the profile OWL 2 RL1 and the definition of languages such as RIF2 and SWRL3. Datalog± is an extension of Datalog which can be used for representing lightweight ontologies and expressing some languages of the DL-Lite family, with tractable query answering under certain language restrictions. In particular, it is able to express the DL-Lite version defined in OWL. In this work, we show that Abductive Logic Programming (ALP) can be used to represent Datalog± ontologies, supporting query answering through an abductive proof procedure, and smoothly achieving the integration of ontologies and rule-based reasoning. Often, reasoning with DLs means finding explanations for the truth of queries, that are useful when debugging ontologies and to understand answers given by the reasoning process. We show that reasoning under existential rules can be expressed by ALP languages and we present a solving system, which is experimentally proved to be competitive with DL reasoning systems. In particular, we consider an ALP framework named 𝒮CIFF derived from the IFF abductive framework. Forward and backward reasoning is naturally supported in this ALP framework. The 𝒮CIFF language smoothly supports the integration of rules, expressed in a Logic Programming language, with Datalog± ontologies, mapped into 𝒮CIFF (forward) integrity constraints. The main advantage is that this integration is achieved within a single language, grounded on abduction in computational logic, and able to model existential rules.

DOI: 10.3233/FI-2018-1658

Journal: Fundamenta Informaticae, vol. 159, no. 1-2, pp. 65-93, 2018