Inductive definability and the situation calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1472, Issue , 1998, Pages 227-248

  Ternovskaia, Eugenia ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; INTELLIGENT DATABASES; LOGIC PROGRAMMING; SEMANTICS; TEMPORAL LOGIC;

CONCURRENT PROCESS; FIXED POINT PROPERTY; FRAME PROBLEMS; GOLOG PROGRAMS; INDUCTION PRINCIPLES; INDUCTIVE DEFINITIONS; SITUATION CALCULUS; STRUCTURAL OPERATIONAL SEMANTICS;

COMPUTER CIRCUITS;

EID: 0343153396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055501     Document Type: Conference Paper

References (24)

1. [Acz77] P. Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, pages 739-782. Elsevier, 1977.
2. [Apt90] K. R. Apt. Logic programming. In Handbook of theoretical Computer Science, volume 92, pages 493-574. Elsevier, 1990.
3. [BM77] J. Bell and M. Machover. A Course in Mathematical Logic. 1977.
4. [BW90] J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1990.
5. [CC92] P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Conference Record of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages, pages 83-94, New York, U. S. A., 1992. ACM Press.
6. [DGLL97] G. De Giacomo, H. J. Levesque, and Y. Lespérance. Reasoning about concurrent executions, prioritized interrupts, and exogenous actions in the situation calculus. In Proc. of IJCAI 97, pages 1221-1226, 1997.
7. [DGTR97] G. De Giacomo, E. Ternovskaia, and R. Reiter. Non-terminating processes in the situation calculus. In Proc. of AAAI 97 workshop on Robots, Softbots, and Immobots: theories of action, planning and control, pages 18-28, 1997.
8. [EC80] E. Emerson and E. Clarke. Characterizing correctness properties of parallel programs using fixpoints. volume 85 of Lecture Notes in Computer Science, pages 169-181. Springer Verlag, 1980.
9. [Eme90] I. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 996-1072. ESP, 1990.
10. [Heh93] E. C. R. Hehner. A practical theory of programming. Springer-Verlag, 1993.
11. [HP73] P. Hitchcock and D. Park. Induction rules and termination proofs. In First Intemat. Colloq. on Automata, Languages, and Programming, pages 225-251, North-Holland, Amsterdam, 1973.
12. [Koz83] D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27: 333-354, 1983.
13. [Lei94] D. Leivant. Higher order logic. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, pages 229-321. Elsevier, 1994.
14. [Lin95] F. Lin. Embracing causality in specifying the indirect effects of actions. In Proc. of IJCAI 95, pages 1985-1991, 1995.
15. +96] H. J. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. Scherl. Golog: a logic programming language for dynamic domains. J. of Logic Programming, Special Issue on actions and processes, 4: 655-678, 1996.
16. [McI97] S. A. Mcllraith. Representing actions and state constraints in model-based diagnosis. In Proc. of AAAI 97, pages 43-49, 1997.
17. [Mil89] R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
18. [Mos74] Y. N. Moschovakis. Elementary Induction on Abstract Structures. Amsterdam, North Holland, 1974.
19. [Par70] D. Park. Fixpoint induction and proofs of program properties. In Machine Intelligence, volume 5, pages 59-78. Edinburgh University Press, 1970.
20. [Plo81] G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, 1981.
21. [Pra81] V. Pratt. A decidable μ-calculus (preliminary rept.). In Proc. 22th IEEE Symp. on Foundations of Computer Science, pages 421-427, 1981.
22. [Rei91] 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.
23. [Rei93] R. Reiter. Proving properties of states in the situation calculus. J. of Artificial Intelligence, 64: 337-351, 1993.
24. [Thi96] M. Thielscher. Ramification and causality. Technical Report TR-96-003, International Computer Science Institute, Berkeley, CA 94704-1198, 1996.