ConGolog, a concurrent programming language based on the situation calculus

Artificial Intelligence

Volumn 121, Issue 1, 2000, Pages 109-169

  De Giacomo, Giuseppe ^a   Lespérance, Yves ^b   Levesque, Hector J ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YORK UNIVERSITY   (Canada)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONCURRENCY CONTROL; DECISION THEORY; FORMAL LOGIC; HIGH LEVEL LANGUAGES; MATHEMATICAL MODELS; ROBOT PROGRAMMING; ROBOTICS;

CONCURRENT PROGRAMMING LANGUAGES; SITUATION CALCULUS; SOFTWARE PACKAGE CONGOLOG;

ARTIFICIAL INTELLIGENCE;

EID: 0342520920     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00031-X     Document Type: Article

References (40)

1. Andrews G.R., Schneider F.B. Concepts and notations for concurrent programming. ACM Comput. Surveys. Vol. 15:(1):1983;3-43.
2. Bratman M.E., Israel D.J., Pollack M.E. Plans and resource-bounded practical reasoning. Comput. Intelligence. Vol. 4:1988;349-355.
3. Bonner A.J., Kifer M. Concurrency and communication in transaction logic. Proc. Joint International Conference and Symposium on Logic Programming (JICSLP), Bonn, Germany. 1996;142-156.
4. De Bakker J., De Vink E. Control Flow Semantics. 1996;MIT Press, Cambridge, MA.
5. Chen X.J., De Giacomo G. Reasoning about nondeterministic and concurrent actions: A process algebra approach. Artificial Intelligence. Vol. 107:(1):1999;63-98.
6. De Giacomo G., Lespérance Y., Levesque H.J. Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus. Proc. IJCAI-97, Nagoya, Japan. 1997;1221-1226.
7. De Giacomo G., Levesque H.J. An incremental interpreter for high-level programs with sensing. Cognitive Robotics - Papers from the 1998 AAAI Fall Symposium, Orlando, FL, Technical Report FS-98-02. 1998;28-34 AAAI Press, Menlo Park, CA.
8. Dixon M. Embedded computation and the semantics of programs, Ph.D. Thesis. 1991;Department of Computer Science, Stanford University, Stanford, CA. Also appeared as Xerox PARC Technical Report SSL-91-1.
9. De Giacomo G., Ternovskaia E., Reiter R. Nonterminating processes in the situation calculus. Proc. AAAI-97 Workshop on Robots, Softbots, Immobots: Theories of Action, Planning and Control, Providence, RI. 1997.
10. van Eijk R.M., de Boer F.S., van der Hoek W., Meyer J.-J.Ch. Information-passing and belief revision in multi-agent systems. Müller J.P., Singh M.P., Rao A.S. Proc. ATAL-98, Paris. 1998;75-89.
11. Fisher M. A survey of Concurrent MetateM - The language and its applications. Gabbay D.M., Ohlbach H.J. Temporal Logic - Proc. First International Conference. Lecture Notes in Artificial Intelligence. Vol. 827:1994;480-505 Springer, Berlin.
12. Gelfond M., Lifschitz V. Representing action and change by logic programs. J. Logic Programming. Vol. 17:1993;301-327.
13. Green C.C. Theorem proving by resolution as a basis for question-answering systems. Machine Intelligence, Vol. 4. 1969;183-205 Edinburgh University Press, Edinburgh.
14. Gupta V., Jagadeesan R., Saraswat V.A. Computing with continuous change. Sci. Comput. Programming. Vol. 30:1998;3-50.
15. Hennessy M. The Semantics of Programming Languages. 1990;Wiley, New York.
16. Hindriks K.V., de Boer F.S., van der Hoek W., Meyer J.-J.Ch. A formal semantics for an abstract agent programming language. Singh M.P., Rao A., Wooldridge M.J. Proc. ATAL-97. Lecture Notes in Artificial Intelligence. Vol. 1365:1998;215-229 Springer, Berlin.
17. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice Hall, Englewood Cliffs, NJ.
18. Leivant D. Higher order logic. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2. 1994;229-321 Clarendon Press, Oxford.
19. Lespérance Y., Jenkin M., Tam K. Reactivity in a logic-based robot programming framework. Cognitive Robotics - Papers from the 1998 AAAI Fall Symposium, Orlando, FL, Technical Report FS-98-02. 1998;98-105 AAAI Press, Menlo Park, CA.
20. Levesque H.J., Reiter R., Lespérance Y., Lin F., Scherl R.B. GOLOG: A logic programming language for dynamic domains. J. Logic Programming. Vol. 31:1997;59-84.
21. Lin F., Reiter R. State constraints revisited. J. Logic Comput. Vol. 4:(5):1994;655-678.
22. Lin F., Reiter R. How to progress a database. Artificial Intelligence. Vol. 92:1997;131-167.
23. Lloyd J.W. Foundations of Logic Programming. 2nd edn. 1987;Springer, Berlin.
24. McCarthy J., Hayes P. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence, Vol. 4. 1969;Edinburgh University Press, Edinburgh.
25. Milner R. Communication and Concurrency. 1989;Prentice Hall, Englewood Cliffs, NJ.
26. Nielson H.R., Nielson F. Semantics with Applications: A Formal Introduction. 1992;Wiley, New York.
27. Plotkin G. A structural approach to operational semantics, Technical Report DAIMI-FN-19. 1981;Computer Science Department, Aarhus University, Denmark.
28. Pym D., Pryor L., Murphy D. Processes for plan-execution. Proc. 14th Workshop of the UK Planning and Scheduling Special Interest Group. 1995.
29. Rao A.S. AgentSpeak(L): BDI agents speak out in a logical computable language. van der Velde W., Perram J.W. Agents Breaking Away. Lecture Notes in Artificial Intelligence. Vol. 1038:1996;42-55 Springer, Berlin.
30. Rao A.S., Georgeff M.P. An abstract architecture for rational agents. Nebel B., Rich C., Swartout W. Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;439-449 Morgan Kaufmann, San Mateo, CA.
31. Reiter R. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. 1991;359-380 Academic Press, New York.
32. Reiter R. Proving properties of states in the situation calculus. Artificial Intelligence. Vol. 64:1993;337-351.
33. Reiter R. Natural actions, concurrency and continuous time in the situation calculus. Proc. 5th International Conference on Principles of Knowledge Representation and Reasoning (KR-96), Cambridge, MA. 1996;2-13 Morgan Kaufmann, San Mateo, CA.
34. R. Reiter, Knowledge in action: Logical foundation for describing and implementing dynamical systems, In preparation.
35. Saraswat V.A., Rinard M. Concurrent constraint programming. Proc. 17th ACM Symposium on Principles of Programming Languages. 1990;232-245.
36. Shapiro S., Lespérance Y., Levesque H.J. Specifying communicative multiagent systems. Wobcke W., Pagnucco M., Zhang C. Agents and Multi-Agent Systems - Formalisms, Methodologies, and Applications. Lecture Notes in Artificial Intelligence. Vol. 1441:1998;1-14 Springer, Berlin.
37. Shoenfield J.R. Mathematical Logic. 1967;Addison-Wesley, Reading, MA.
38. Shoham Y. Agent-oriented programming. Artificial Intelligence. Vol. 60:1993;51-92.
39. Stirling C. Modal and temporal logics for processes. Logics for Concurrency: Structure versus Automata. Lecture Notes in Computer Science. Vol. 1043:1996;149-237 Springer, Berlin.
40. Tarski A. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. Vol. 5:1955;285-309.