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}

This file was generated by bibtex2html 1.98.