Answering Queries with Negation over Existential Rules

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column
Stefan Ellmauthaler, Markus Krötzsch, Stephan Mennicke
Answering Queries with Negation over Existential Rules
Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 5626-5633, June 2022
  • KurzfassungAbstract
    Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. The situation changes drastically for queries with negation, where there is no agreed-upon semantics or standard implementation. Stratification, as used for Datalog, is not enough for existential rules, since the latter still admit multiple universal models that can differ on negative queries. We therefore propose universal core models as a basis for a meaningful (non-monotonic) semantics for queries with negation. Since cores are hard to compute, we identify syntactic descriptions of queries that can equivalently be answered over other types of models. This leads to fragments of queries with negation that can safely be evaluated by current chase implementations. We establish new techniques to estimate how the core model differs from other universal models, and we incorporate our findings into a new reasoning approach for existential rules with negation.
  • Weitere Informationen unter:Other info: Link
  • Projekt:Project: CPECScaDS.AI
  • Forschungsgruppe:Research Group: Wissensbasierte Systeme
  author    = {Stefan Ellmauthaler and Markus Kr{\"{o}}tzsch and Stephan
  title     = {Answering Queries with Negation over Existential Rules},
  booktitle = {Proceedings of the {AAAI} Conference on Artificial Intelligence,
  year      = {2022},
  month     = {June},
  pages     = {5626-5633},
  doi       = {}