ML Anthology

Automata Theory for Reasoning About Actions

Eugenia Ternovskaia
IJCAI 1999 pp. 153-159
/ijcai/1999/ternovskaia1999ijcai-automata/

Abstract

In this paper, we show decidability of a rather expressive fragment of the situation calculus. We allow second order quantification over finite and infinite sets of situations. We do not impose a domain closure assumption on actions; therefore, infinite and even uncountable domains are allowed. The decision procedure is based on automata accepting infinite trees.

PDF Semantic Scholar

Cite

Text

Ternovskaia. "Automata Theory for Reasoning About Actions." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Ternovskaia. "Automata Theory for Reasoning About Actions." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/ternovskaia1999ijcai-automata/)

BibTeX

@inproceedings{ternovskaia1999ijcai-automata,
  title     = {{Automata Theory for Reasoning About Actions}},
  author    = {Ternovskaia, Eugenia},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {153-159},
  url       = {https://mlanthology.org/ijcai/1999/ternovskaia1999ijcai-automata/}
}