Automata Theory for Reasoning About Actions
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 153-158.
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.
Eugenia Ternovskaia. 1999. Automata Theory for Reasoning About Actions. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, 153–158. https://ijcai.org/proceedings/1999/23
Ternovskaia, E. (1999). Automata Theory for Reasoning About Actions. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 (pp. 153–158). IJCAI. https://ijcai.org/proceedings/1999/23
@inproceedings{ijcai1999p23,
title = {Automata Theory for Reasoning About Actions},
author = {Ternovskaia, Eugenia},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {153--158},
year = {1999},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1999/23},
}
TY - CPAPER TI - Automata Theory for Reasoning About Actions AU - Ternovskaia, Eugenia T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 153 EP - 158 UR - https://ijcai.org/proceedings/1999/23 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
