On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies

Abstract

In this paper we investigate situation calculus action theories extended with ontologies, expressed as description logics TBoxes that act as state constraints. We show that this combination, while natural and desirable, is particularly problematic: it leads to undecidability of the simplest form of reasoning, namely satisfiability, even for the simplest kinds of description logics and the simplest kind of situation calculus action theories.

Cite

Text

Calvanese et al. "On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies." International Joint Conference on Artificial Intelligence, 2015.

Markdown

[Calvanese et al. "On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/calvanese2015ijcai-undecidability/)

BibTeX

@inproceedings{calvanese2015ijcai-undecidability,
  title     = {{On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies}},
  author    = {Calvanese, Diego and De Giacomo, Giuseppe and Soutchanski, Mikhail},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {2840-2846},
  url       = {https://mlanthology.org/ijcai/2015/calvanese2015ijcai-undecidability/}
}