---
title: "Automata Theory for Reasoning About Actions"
authors:
  - "Eugenia Ternovskaia"
doi: ""
url: "https://ijcai.org/proceedings/1999/23"
pdf: "https://ijcai.org/proceedings/1999/0023.pdf"
venue: "Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence"
year: 1999
pages: "153-158"
track: "Automated Reasoning"
keywords:
---

# Automata Theory for Reasoning About Actions

Eugenia Ternovskaia

*Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence*, 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.