{"type":"ScholarlyArticle","title":"Automata Theory for Reasoning About Actions","authors":[{"name":"Eugenia Ternovskaia","slug":"eugenia-ternovskaia","given":"Eugenia","family":"Ternovskaia","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1999/23","pdf":"https://ijcai.org/proceedings/1999/0023.pdf","markdown":"https://ijcai.org/proceedings/1999/23.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/23","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":23,"pages":{"first":153,"last":158},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}