Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract)

Abstract

Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable and can only recognize properties that are preserved under homomorphisms. This paper is an extended abstract of our eponymous publication at KR 2021 where we show the converse: every decidable query that is closed under homomorphism can be expressed by an existential rule set for which the standard chase universally terminates. Membership in this fragment is not decidable, but we show via a diagonalisation argument that this is unavoidable.

Cite

Text

Bourgaux et al. "Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2022. doi:10.24963/IJCAI.2022/733

Markdown

[Bourgaux et al. "Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2022.](https://mlanthology.org/ijcai/2022/bourgaux2022ijcai-capturing/) doi:10.24963/IJCAI.2022/733

BibTeX

@inproceedings{bourgaux2022ijcai-capturing,
  title     = {{Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract)}},
  author    = {Bourgaux, Camille and Carral, David and Krötzsch, Markus and Rudolph, Sebastian and Thomazo, Michaël},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2022},
  pages     = {5269-5273},
  doi       = {10.24963/IJCAI.2022/733},
  url       = {https://mlanthology.org/ijcai/2022/bourgaux2022ijcai-capturing/}
}