Capturing Homomorphism-Closed Decidable Queries with Existential Rules

From International Center for Computational Logic

Toggle side column
Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo
Capturing Homomorphism-Closed Decidable Queries with Existential Rules
Proc. 18th International Conference on Principles of Knowledge Representation and Reasoning (KR'21), to appear
  • KurzfassungAbstract
    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.

    In this paper, 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.
  • Projekt:Project: CPECDeciGUTScaDS.AI
  • Forschungsgruppe:Research Group: Computational LogicWissensbasierte Systeme
@inproceedings{BCKRT2021,
  author    = {Camille Bourgaux and David Carral and Markus Kr{\"{o}}tzsch and
               Sebastian Rudolph and Micha{\"{e}}l Thomazo},
  title     = {Capturing Homomorphism-Closed Decidable Queries with Existential
               Rules},
  booktitle = {Proc. 18th International Conference on Principles of Knowledge
               Representation and Reasoning (KR'21)},
  year      = {2021}
}