Propositional dynamic logic for reasoning about first-class agent interaction protocols

Computational Intelligence

Volumn 27, Issue 3, 2011, Pages 422-457

  Miller, Tim ^a   McBurney, Peter ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

agent interaction protocols; first class protocols; multiagent systems; propositional dynamic logic

Indexed keywords

AGENT INTERACTION PROTOCOLS; DECISION-MAKING MECHANISMS; INTER-ACTION PROTOCOLS; PROOF SYSTEM; PROPOSITIONAL DYNAMIC LOGIC; PROTOCOL SPECIFICATIONS; RUNTIMES;

INTELLIGENT AGENTS; MULTI AGENT SYSTEMS;

FORMAL LOGIC;

EID: 80052979163     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2011.00387.x     Document Type: Article

References (41)

1. Arsac, J., and, Y. Kodratoff,. 1982. Some techniques for recursion removal from recursive functions. ACM Transactions on Programming Languages and Systems, 4 (2): 295-322.
2. Auslander, M., and, H. Strong,. 1978. Systematic recursion removal. Communications of the ACM, 21 (2): 127-134.
3. Baader, F., D. Calvanese, D. L. McGuinness, D. Nardi, and, P. F. Patel-Schneider,. 2003. The Description Logic Handbook: Theory, Implementation, Applications. Cambridge University Press: Cambridge, UK.
4. Bird, R. S,. 1977. Notes on recursion elimination. Communications of the ACM, 20 (6): 434-439.
5. Brak, R. L., J. D. Fleuriot, and, J. McGinnis,. 2004. Theorem proving for protocol languages. In Proceedings of the European Union Multiagent Systems Workshop, Barcelona, Spain.
6. Clement, B., and, E. Durfee,. 1999. Theory for coordinating concurrent hierarchical planning agents using summary information. In Proceedings of the 16th National Conference on Artificial Intelligence. AAAI Press: Menlo Park, CA, pp. 495-502.
7. De Bakker, J. W., 1980. Mathematical Theory of Program Correctness. Prentice-Hall: Upper Saddle River, NJ.
8. De Boer, F. S., M. Gabbrielli, E. Marchiori, and, C. Palamidessi,. 1997. Proving concurrent constraint programs correct. ACM Transactions on Programming Languages and Systems, 19 (5): 685-725. (Pubitemid 127459816)
9. De Silva, L. P., M. Winikoff, and, W. Liu,. 2003. Extending agents by transmitting protocols in open systems. In Proceedings of the Challenges in Open Agent Systems Workshop, Melbourne, Australia.
10. Desai, N., A. U. Mallya, A. K. Chopra, and, M. P. Singh,. 2005. OWL-P: A methodology for business process modeling and enactment. In Workshop on Agent Oriented Information Systems, Ultrecht, the Netherlands. Edited by, M. Kolp, P. Bresciani, B. Henderson-Sellers, and, M. Winikoff, Vol. 3529 of LNCS, pp. 79-94.
11. Desai, N., and, M. P. Singh,. 2007. A modular action description language for protocol composition. In Proceedings of the 22nd Conference on Artificial Intelligence (AAAI). AAAI Press: Menlo Park, CA, pp. 962-967. (Pubitemid 350149695)
12. Georgeff, M. P., and, A. L. Lansky,. 1987. Reactive reasoning and planning. In Proceedings of the 6th National Conference on Artificial Intelligence, Seattle, WA, pp. 677-682.
13. Harel, D., D. Kozen, and, J. Tiuryn,. 2000. Dynamic Logic. MIT Press: Cambridge, MA.
14. Harel, D., A. Pnueli, and, J. Stavi,. 1983. Propositional dynamic logic of nonregular programs. Journal of Computer and System Sciences, 26 (2): 222-243.
15. Hoare, C. A. R,. 1971. Procedures and parameters: An axiomatic approach. In Symposium on Semantics of Algorithmic Languages. Edited by, E. Engeler,. Springer-Verlag: Berlin, pp. 102-116.
16. Hoare, C. A. R., 1985. Communicating Sequential Processes. Prentice-Hall International: Englewood Cliffs, NJ.
17. Kowalski, R., and, M. Sergot,. 1986. A logic-based calculus of events. New Generation Computing, 4 (1): 67-95.
18. Kozen, D,. 1990. On Kleene algebras and closed semirings. In Proceedings of Mathematical Foundations of Computer Science. Edited by, B. Rovan, Vol. 452 of LNCS. Springer: Berlin, pp. 26-47.
19. Leivant, D,. 2008. Propositional dynamic logic for recursive procedures. In Proceedings of the Second International Conference on Verified Software: Theories, Tools, Experiments. Edited by, N. Shankar, and, J. Woodcock,. Vol. 5295 of Lecture Notes in Computer Science. Springer: Berlin, pp. 6-14.
20. Levesque, H., F. Pirri, and, R. Reiter,. 1998. Foundations for the situation calculus. Electronic Transactions on Artificial Intelligence, 2 (3-4): 159-178.
21. Levesque, H., R. Reiter, Y. Lesperance, F. Lin, and, R. Scherl,. 1997. GOLOG: A logic programming language for dynamic domains. The Journal of Logic Programming, 31 (1-3): 59-83.
22. Liu, Y. A., and, S. D. Stoller,. 2000. From recursion to iteration: what are the optimizations ? In Proceedings of the ACM SIGPLAN 2000 Workshop on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press: New York, pp. 73-82.
23. Löding, C., and, O. Serre,. 2006. Propositional dynamic logic with recursive programs. In Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures, Vol. 3921 of LNCS. Springer-Verlag: Berlin, pp. 292-306. (Pubitemid 44019347)
24. Luck, M., P. McBurney, O. Shehory, and, S. Willmott,. 2005. Agent Technology: Computing as Interaction. A Roadmap for Agent Based Computing. AgentLink III, the European Co-ordination Action for Agent-Based Computing: Southampton, UK.
25. Miller, T., and, P. McBurney,. 2007. Using constraints and process algebra for specification of first-class agent interaction protocols. In Engineering Societies in the Agents World VII. Edited by, G. O'Hare, A. Ricci, M. O'Grady, and, O. Dikenelli, Vol. 4457 of LNAI. Springer: Berlin/Heidelberg, pp. 245-264.
26. Miller, T., and, P. McBurney,. 2008a. Annotation and matching first-class agent interaction protocols. In Proceedings of the Seventh International Conference on Autonomous Agents and Multi-Agent Systems, Estoril, Portugal. Edited by, L. Padgham, D. Parkes, J. P. Mueller, and, S. Parsons,. Springer: Berlin/Heidelberg, pp. 805-812.
27. Miller, T., and, P. McBurney,. 2008b. On illegal composition of first-class agent interaction protocols. In Proceedings of the Thirty-First Australasian Computer Science Conference. Edited by, G. Dobbie, and, B. Mans, Vol. 74 of CRPIT. ACSC: Wollongong, Australia, pp. 127-136.
28. Miller, T., and, J. McGinnis,. 2007. Amongst first-class protocols. In Engineering Societies in the Agents World VIII. Edited by, A. Artikis, G. O'Hare, K. Stathis, and, G. Vouros, Vol. 4995 of LNAI. Springer: Berlin, pp. 208-223.
29. Milner, R., 1980. A Calculus of Communicating Systems. Springer-Verlag: Secaucus, NJ.
30. Milner, R., 1999. Communicating and Mobile Systems: The Pi-Calculus. Cambridge University Press: Cambridge, UK.
31. Paurobally, S., J. Cunningham, and, N. R. Jennings,. 2005. A formal framework for agent interaction semantics. In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems, Utrecht, the Netherlands. Edited by, F. Dignum, V. Dignum, S. Koenig, S. Kraus, M. P. Singh, and, M. Wooldridge,. ACM Press: New York, pp. 91-98.
32. Reiter, R., 2001. Knowledge in action: Logical foundations for specifying and implementing dynamical systems. MIT Press: Cambridge, MA.
33. Robertson, D,. 2004. Multi-agent coordination as distributed logic programming. In Proceedings of the International Conference on Logic Programming. Edited by, B. Demoen, and, V. Lifschitz, Vol. 3132 of LNCS. Springer: Berlin, pp. 416-430.
34. Scott, D., and, J. de Bakker,. 1969. A theory of programs: Notes of an IBM Vienna seminar. Unpublished.
35. Singh, M. P,. 2000. A social semantics for agent communication languages. In Issues in Agent Communication. Edited by, F. Dignum, and, M. Greaves, Vol. 1916 of LNCS. Springer-Verlag: Heidelberg, Germany, pp. 31-45.
36. Smith, G., and, J. Derrick,. 2002. Abstract specification in Object-Z and CSP. In Formal Methods and Software Engineering. Edited by, C. George, and, H. Miao, Vol. 2495 of LNCS. Springer: Berlin/Heidelberg, pp. 108-119.
37. Stoy, J., 1977. Denotational semantics: The Scott-Strachey approach to programming language theory. MIT Press: Cambridge, MA.
38. Strachey, C,. 2000. Fundamental concepts in programming languages. Higher-Order and Symbolic Computation, 13 (1): 11-49.
39. Van Eijk, R. M., F. S. de Boer, W. Van Der Hoek, and, J. -J. C. Meyer,. 2003. A verification framework for agent communication. Autonomous Agents and Multi-Agent Systems, 6 (2): 185-219. (Pubitemid 38079777)
40. Van Riemsdijk, M. B., F. S. de Boer, and, J.-J. de Meyer,. 2006. Dynamic logic for plan revision in agent programming. Journal of Logic and Computation, 16 (3): 375-402. (Pubitemid 43823172)
41. Yolum, P., and, M. P. Singh,. 2004. Reasoning about commitments in the event calculus: An approach for specifying and executing protocols. Annals of Mathematics and AI, 42 (1-3): 227-253. (Pubitemid 39046783)