Situation calculus-based programs for representing and reasoning about game structures

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2010, Pages 445-455

  De Giacomo, Giuseppe ^a   Lespérance, Yves ^b   Pearce, Adrian R ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YORK UNIVERSITY   (Canada)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION; MULTI AGENT SYSTEMS;

CONGOLOG; FIXPOINTS; GAME-THEORETIC; INFINITE STATE; LOGICAL FRAMEWORKS; MULTI-AGENT PLANNING; PATH QUANTIFIERS; SITUATION CALCULUS;

CALCULATIONS;

EID: 84860569288     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Alur, R.; Henzinger, T. A.; and Kupferman, O. 2002. Alternatingtime temporal logic. J. ACM 49(5):672-713.
2. Berardi, D.; Calvanese, D.; Giacomo, G. D.; Lenzerini, M.; and Mecella, M. 2005. Automatic service composition based on behavioral descriptions. Int. J. Cooperative Inf. Syst. 14(4):333-376.
3. Bradfield, J., and Stirling, C. 2007. Modal mu-calculi. In Handbook of Modal Logic, volume 3. Elsevier. 721-756.
4. Clarke, E.M.; Grumberg, O.; and Peled, D. A. 1999. Model checking. Cambridge, MA, USA: The MIT Press.
5. Claeßn, J., and Lakemeyer, G. 2008. A logic for non-terminating Golog programs. In Proc. of KR'08, 589-599.
6. Cousot, P. 1990. Methods and logics for proving programs. In Handbook of Theor. Comp. Science, Volume B. Elsevier. 841-994.
7. Dam, M. 1994. CTL* and ECTL*as fragments of the modal mucalculus. Theor. Comput. Sci. 126(1):77-96.
8. de Alfaro, L.; Henzinger, T. A.; and Majumdar, R. 2001. From verification to control: Dynamic programs for omega-regular objectives. In Proc. of LICS'01, 279-290.
9. De Giacomo, G., and Sardina, S. 2007. Automatic synthesis of new behaviors from a library of available behaviors. In Proc. of IJCAI'07, 1866-1871.
10. De Giacomo, G.; Lespérance, Y.; and Levesque, H. J. 2000. Con- Golog, a concurrent programming language based on the situation calculus. AIJ 121(1-2):109-169.
11. Emerson, E. A. 1996. Model checking and the mu-calculus. In Descriptive Complexity and Finite Models, 185-214.
12. Finzi, A., and Lukasiewicz, T. 2004. Game-theoretic agent programming in golog. In Proc. of ECAI'04, 23-27.
13. Finzi, A., and Lukasiewicz, T. 2006. Adaptive multi-agent programming in gtgolog. In Proc. of ECAI'06, 753-754.
14. Fritz, C.; Baier, J. A.; and McIlraith, S. A. 2008. ConGolog, Sin Trans: Compiling ConGolog into basic action theories for planning and beyond. In Proc. of KR'08, 600-610.
15. Genesereth, M. R.; Love, N.; and Pell, B. 2005. General game playing: Overview of the AAAI competition. AI Magazine 26(2):62-72.
16. Ghaderi, H.; Levesque, H. J.; and Lespérance, Y. 2007. A logical theory of coordination and joint ability. In Proc. of AAAI'07, 421- 426.
17. Lespérance, Y.; De Giacomo, G.; and Ozgovde, A. N. 2008. A model of contingent planning for agent programming languages. In Proc. of AAMAS'08, 477-484.
18. Lomuscio, A.; Qu, H.; and Raimondi, F. 2009. MCMAS: A model checker for the verification of multi-agent systems. In Proc. of CAV'09, 682-688.
19. Park, D. 1976. Finiteness is mu-ineffable. Theor. Comput. Sci. 3(2):173-181.
20. Pirri, F., and Reiter, R. 1999. Some contributions to the metatheory of the situation calculus. J. ACM 46(3):261-325.
21. Piterman, N.; Pnueli, A.; and Sa'ar, Y. 2006. Synthesis of reactive( 1) designs. In Proc. of VMCAI'06, 364-380.
22. Reiter, R. 1982. Towards a logical reconstruction of relational database theory. In On Conceptual Modeling, 191-233.
23. Reiter, R. 2001. Knowledge in Action. Logical Foundations for Specifying and Implementing Dynamical Systems. The MIT Press.
24. Ruan, J.; van der Hoek, W.; and Wooldridge, M. 2009. Verification of games in the game description language. J. Logic and Comput.
25. Sardina, S., and De Giacomo, G. 2009. Composition of congolog programs. In Proc. of IJCAI'09, 904-910.
26. Sardina, S.; De Giacomo, G.; Lespérance, Y.; and Levesque, H. J. 2004. On the semantics of deliberation in IndiGolog - From theory to implementation. Ann. Math. Artif. Intell. 41(2-4):259-299.
27. Schulte, O., and Delgrande, J. P. 2004. Representing von neumannmorgenstern games in the situation calculus. Ann. Math. Artif. Intell. 42(1-3):73-101.
28. Tarski, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Mathematics 5(2):285309.
29. van der Hoek, W., and Wooldridge, M. 2003. Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica 75(1):125-157.
30. Walther, D.; van der Hoek, W.; and Wooldridge, M. 2007. Alternating-time temporal logic with explicit strategies. In Proc. of TARK'07, 269-278.