title = {Abductive Logic Programming for {Datalog+-} Ontologies},
  author = {Marco Gavanelli and Evelina Lamma and  Fabrizio Riguzzi and Elena Bellodi and Riccardo Zese and Giuseppe Cota},
  booktitle = {Proceedings of the 30th Italian Conference on Computational Logic ({CILC2015}),
Genova, Italy, 1-3 July 2015},
  editor = {Davide Ancona and
Marco Maratea and
Viviana Mascardi},
  year = {2015},
  series = {CEUR Workshop Proceedings},
  publisher = {Sun {SITE} Central Europe},
  issn = {1613-0073},
  address = {Aachen, Germany},
  copyright = {by the authors},
  abstract = {
Ontologies  are a fundamental component of the Semantic Web since they provide a formal and machine manipulable model of a domain.
Description Logics (DLs) are often the languages of choice for modeling ontologies. Great effort has been spent in identifying decidable or even tractable fragments of DLs.  Conversely, for knowledge representation and reasoning,  integration with rules and rule-based reasoning is crucial in the so-called Semantic Web stack vision.
Datalog+- is an extension of Datalog which can be used for representing lightweight ontologies, and is able to express
the DL-Lite family  of ontology languages, with tractable query answering under certain language restrictions.
In this work, we show that Abductive Logic Programming (ALP) is also a suitable framework for representing Datalog+- ontologies, supporting query answering through an abductive proof procedure, and smoothly achieving the integration of ontologies and rule-based reasoning.
In particular, we consider an Abductive Logic Programming framework  named SCIFF, and  derived from the IFF abductive framework, able to deal with  existentially (and universally) quantified variables in rule heads, and Constraint Logic Programming  constraints.
Forward and backward reasoning is naturally supported in the ALP framework.
The SCIFF language smoothly supports the integration of rules, expressed in a Logic Programming language, with Datalog+- ontologies,  mapped  into SCIFF (forward) integrity constraints.
The main advantage is that this integration is achieved within a single language, grounded on abduction in computational logic.
  keywords = { Abductive Logic Programming, Description Logics,  Semantic Web},
  number = {1459},
  pages = {128-143},
  url = {}
  author = {Chesani, Federico and Cota, Giuseppe and Lamma, Evelina and Mello, Paola and Riguzzi, Fabrizio},
  title = {A Decision Support System for Food Recycling based on Constraint Logic Programming and Ontological Reasoning},
  year = {2018},
  series = {CEUR Workshop Proceedings},
  publisher = {Sun {SITE} Central Europe},
  address = {Aachen, Germany},
  volume = {2214},
  editor = {Paolo Felli and Marco Montali},
  booktitle = {Proceedings of the 33rd Italian Conference on Computational Logic },
  url = {},
  pages = {117-131},
  eventdate = {September 20-22, 2018},
  venue = {Bolzano, Italy},
  issn = {1613-0073},
  copyright = {by the authors},
  scopus = {2-s2.0-85054323247}
  author = {Cota, Giuseppe and Riguzzi, Fabrizio and Lamma, Evelina and Zese, Riccardo},
  title = {{KRaider}: a Crawler for Linked Data},
  year = {2019},
  series = {CEUR Workshop Proceedings},
  publisher = {Sun {SITE} Central Europe},
  address = {Aachen, Germany},
  volume = {2396},
  editor = {Alberto Casagrande and Eugenio Omodeo},
  booktitle = {Proceedings of the 34th Italian Conference on Computational Logic},
  url = {},
  pages = {202-216},
  eventdate = {June 19-21, 2019},
  venue = {Trieste, Italy},
  issn = {1613-0073},
  copyright = {by the authors},
  scopus = {2-s2.0-85071120572}

This file was generated by bibtex2html 1.98.