title = {A Description Logics Tableau Reasoner in {Prolog}},
  author = {Riccardo Zese and Elena Bellodi and Evelina Lamma and  Fabrizio Riguzzi},
  booktitle = {Proceedings of the 28th Italian Conference on Computational Logic ({CILC2013}),
Catania, Italy, 25-27 September 2013},
  editor = {Domenico Cantone and Marianna Nicolosi Asmundo},
  year = {2013},
  series = {CEUR Workshop Proceedings},
  publisher = {Sun {SITE} Central Europe},
  issn = {1613-0073},
  number = {1068},
  address = {Aachen, Germany},
  pages = {33-47},
  pdf = {},
  url = {},
  copyright = {by the authors}
  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 = {Marco Alberti and Evelina Lamma and Fabrizio Riguzzi and Riccardo Zese},
  title = {Iterated Fixpoint Well-founded Semantics for Hybrid Knowledge Bases},
  booktitle = {Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and
the 32nd Italian Conference on Computational Logic},
  eventdate = {26-28 September 2017},
  venue = {Naples, Italy},
  editor = {{Dario Della Monica} and Aniello Murano and Sasha Rubin and Luigi Sauro},
  year = {2017},
  series = {CEUR Workshop Proceedings},
  address = {Aachen, Germany},
  issn = {1613-0073},
  publisher = {Sun {SITE} Central Europe},
  pages = {248-261},
  pdf = {},
  volume = 1949,
  abstract = {
MKNF-based Hybrid Knowledge Bases (HKBs) integrate Logic Programming (LP) and
Description Logics (DLs) offering the combined expressiveness of the two formalisms.
In particular, HKB allow to make different closure assumptions for different predicates.
HKBs have been given a well-founded semantics in terms of an alternate fixpoint.
In this paper we provide an alternative definition of the semantics using an
iterated fixpoint. In this way the computation of the well-founded model proceeds
uniformly bottom-up, making the semantics easier to understand, to reason with and to automate.
We also present slightly different but equivalent versions of our definition.
We then discuss the relationships of HKBs with other formalisms.
The results show that overall HKBs seem to be those that more tightly integrate LP and DL,
even if there exist incomparable languages such as the recent FO(ID) formalism.},
  keywords = {Hybrid Knowledge Bases, MKNF, Well-foudned semantics, Description Logics}
  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.