Automata theory for reasoning about actions

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 153-158

  Ternovskaia, Eugenia ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSURE ASSUMPTIONS; DECISION PROCEDURE; INFINITE TREES; REASONING ABOUT ACTIONS; SECOND ORDERS; SITUATION CALCULUS;

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY;

AUTOMATA THEORY;

EID: 84880681123     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. M. Gelfond and V. Lifschitz. Representing action and change by logic programs. J. of Logic Programming, 17:301-322, 1993.
2. P. Liberatore. The complexity of the language A. Linkoping Electronic Articles in Computer and Information Science, 2, 1997.
3. R. Miller and M. Shanahan. Narratives in the situation calculus. J. of Logic and Computation (Special Issue on Actions and Processes), 4(5):513 530, 1994.
4. F. Pirri and R. Reiter. Some contributions to the metatheory of the situation calculus. ,/. of ACM, to appear, 1999.
5. R. Reiter. The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In Vladimir Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 359 380. Academic Press, San Diego, CA, 1991.
6. K. Sandewall. Features and Fluents: The Representation of Knowledge about Dynamic Systems. Oxford University Press, 1994.
7. E. Ternovskaia. Inductive definability and the situation calculus. In Transaction and Change in Logic Databases, volume 1472 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
8. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134-191. 1990.