%0 Journal Article %1 Ellmauthaler2022-cj %A Ellmauthaler, Stefan %A Krötzsch, Markus %A Mennicke, Stephan %D 2022 %I Association for the Advancement of Artificial Intelligence (AAAI) %J Proc. Conf. AAAI Artif. Intell. %K %N 5 %P 5626--5633 %T Answering queries with negation over existential rules %V 36 %X Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. For queries with negation, however, there is no agreed-upon semantics or standard implementation. This problem is unknown for simpler rule languages, such as Datalog, where it is intuitive and practical to evaluate negative queries over the least model. This fails for existential rules, which instead of a single least model have multiple universal models that may not lead to the same results for 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 conditions (on rules and queries) under which our core-based semantics can equivalently be obtained for other universal models, such as those produced by practical chase algorithms. Finally, we use our findings to propose a semantics for a broad class of existential rules with negation.

@article{Ellmauthaler2022-cj, abstract = {Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. For queries with negation, however, there is no agreed-upon semantics or standard implementation. This problem is unknown for simpler rule languages, such as Datalog, where it is intuitive and practical to evaluate negative queries over the least model. This fails for existential rules, which instead of a single least model have multiple universal models that may not lead to the same results for 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 conditions (on rules and queries) under which our core-based semantics can equivalently be obtained for other universal models, such as those produced by practical chase algorithms. Finally, we use our findings to propose a semantics for a broad class of existential rules with negation.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Ellmauthaler, Stefan and Kr{\"o}tzsch, Markus and Mennicke, Stephan}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2d8336096465e90a5076bf02f6dc88b04/scadsfct}, interhash = {925c669500a6ee7392aee20b7a325e22}, intrahash = {d8336096465e90a5076bf02f6dc88b04}, journal = {Proc. Conf. AAAI Artif. Intell.}, keywords = {}, month = jun, number = 5, pages = {5626--5633}, publisher = {Association for the Advancement of Artificial Intelligence (AAAI)}, timestamp = {2024-09-10T15:15:57.000+0200}, title = {Answering queries with negation over existential rules}, volume = 36, year = 2022 }