Rules as actions: A situation calculus semantics for logic programs

Journal of Logic Programming

Volumn 31, Issue 1-3, 1997, Pages 299-330

  Lin, Fangzhen ^a   Reiter, Ray ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; LOGIC PROGRAMMING; PROBLEM SOLVING;

SITUATION CALCULUS SEMANTICS;

COMPUTATIONAL LINGUISTICS;

EID: 0031123136     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00122-7     Document Type: Article

References (31)

1. Clark, K. L., Negation as Failure, in: H. Gallaire and J. Minker (eds.) Logic and Databases, Plenum Press, New York, 1978, pp. 293-322.
2. Fitting, M., A Kripke-Kleene Semantics for Logic Programs, Journal of Logic Programming 2(4):295-312 (1985).
3. Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, in: Proceedings Fifth International Conference and Symposium on Logic Programming, 1988, pp. 1070-1080.
4. Green, C. C., Application of Theorem Proving to Problem Solving, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-69), 1969, pp. 219-239.
5. Haas, A. R., The Case for Domain-Specific Frame Axioms, in: F. M. Brown (ed.), The Frame Problem in Artificial Intelligence. Proceedings of the 1987 Workshop on Reasoning about Action, San Jose, CA, 1987, Morgan Kaufmann Publishers, Inc., pp. 343-348.
6. Kunen, K., Negation in Logic Programming, Journal of Logic Programming 4(4):289-308 (1987).
7. Levesque, H. J., Reiter, R., Lespérance, Y., Lin, F., and Scherl, R., GOLOG: A Logic Programming Language for Dynamic Domains, Journal of Logic Programming 31(1-3): 59-83.
8. Lifschitz, V., Pointwise Circumscription, in: Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86), Philadelphia, PA, 1986, pp. 406-410.
9. Lifschitz, V., Formal Theories of Action, in: Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87), 1987, pp. 966-972.
10. Lin, F., A Situation Calculus Semantics for the Prolog Cut Operator, http://www.cs. toronto.edu/~cogrobo/, Draft, 1995.
11. Lin, F. and Reiter, R., State Constraints Revisited, Journal of Logic and Computation, Special Issue on Actions and Processes 4(5):655-678 (1994).
12. Lin, F. and Reiter, R., Forget It!, in: R. Greiner and D. Subramanian (eds.), Working Notes of AAAI Fall Symposium on Relevance, American Association for Artificial Intelligence, Menlo Park, CA, Nov. 1994, pp. 154-159.
13. Lin, F. and Shoham, Y., Provably Correct Theories of Action, Journal of the ACM 42(2):293-320 (1995).
14. Lloyd, J. W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, 1987.
15. McCarthy, J., Situations, Actions and Causal Laws, in: M. Minsky (ed.), Semantic Information Processing, MIT Press, Cambridge, MA, 1968, pp. 410-417.
16. McCarthy, J., Applications of Circumscription to Formalizing Commonsense Knowledge, Artificial Intelligence 28:89-118 (1986).
17. McCarthy, J. and Hayes, P., Some Philosophical Problems from the Standpoint of Artificial Intelligence, in: B. Meltzer and D. Michie (eds.), Machine Intelligence 4, Edinburgh University Press, Edinburgh, Scotland, 1969, pp. 463-502.
18. Pednault, E. P., Synthesizing Plans that Contain Actions with Context-Dependent Effects, Computational Intelligence 4:356-372 (1988).
19. Pednault, E. P., ADL: Exploring the Middle Ground between STRIPS and the Situation Calculus, in: Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Morgan Kaufmann Publishers, Inc., 1989, pp. 324-332.
20. Przymusinski, T. C., On the Declarative Semantics of Deductive Databases and Logic Programs, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193-216.
21. Reiter, R., The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression, in: V. Lifschitz (ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Academic Press, San Diego, CA, 1991, pp. 359-380.
22. Reiter, R., Proving Properties of States in the Situation Calculus, Artificial Intelligence 64:337-351 (1993).
23. Sagiv, Y., Optimizing Datalog Programs, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, San Mateo, CA, 1988, pp. 659-698.
24. Schubert, L. K., Monotonic Solution to the Frame Problem in the Situation Calculus: An Efficient Method for Worlds with Fully Specified Actions, in: H. Kyberg, R. Loui, and G. Carlson (eds.), Knowledge Representation and Defeasible Reasoning, Kluwer Academic Press, Boston, MA, 1990, pp. 23-67.
25. Seki, H., Unfold/Fold Transformation of General Logic Programs for the Well-Founded Semantics, Journal of Logic Programming 15:5-23 (1993).
26. Shoham, Y., Chronological Ignorance: Experiments in Nonmonotonic Temporal Reasoning, Artificial Intelligence 36:279-331 (1988).
27. Tamaki, H. and Sato, T., Unfold/Fold Transformation of Logic Programs, in: Proceedings of the 2nd International Conference on Logic Programming, 1984, pp. 127-138.
28. Van Gelder, A., Negation as Failure Using Tight Derivations for General Logic Programs, Journal of Logic Programming 6(2):109-133 (1989).
29. Van Gelder, A., Ross, K. A., and Schlipf, J. S., Unfounded Sets and Well-Founded Semantics for General Logic Programs, in: Proceedings Seventh ACM Symposium on Principles of Database Systems, 1988, pp. 221-230.
30. Waldinger, R., Achieving Several Goals Simultaneously, in: E. Elcock and D. Michie (eds.), Machine Intelligence, Ellis Horwood, Edinburgh, Scotland, 1977, pp. 94-136.
31. Wallace, M. G., Tight, Consistent, and Computable Completions for Unrestricted Logic Programs, Journal of Logic Programming 15:243-273 (1993).