skip to main content
10.1145/860575.860592acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

Programming agent deliberation: an approach illustrated using the 3APL language

Published:14 July 2003Publication History

ABSTRACT

This paper presents the specification of a programming language for implementing the deliberation cycle of cognitive agents. The mental attitudes of cognitive agents are assumed to be represented in an object language. The implementation language for the deliberation cycle is considered as a meta-language the terms of which denote formulae from the object language. Without losing generality, we use the agent programming language 3APL as the object language. Using the meta-deliberation language, one can program the deliberation process of a cognitive agent. We discuss a set of programming constructs that can be used to program various aspects of the deliberation cycle including the planning constructs.

References

  1. J. Allen, J. Hendler, and A. Tare, editors. Readings in Planning. Morgan Kaufmann, Palo Alto CA, 1990.Google ScholarGoogle Scholar
  2. A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281--300, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Boella and R. Damiano. An architecture for normative reactive agents. In K. Kawabara and J. Lee, editors, Intelligent Agents and Multi-Agent Systems, LNAI 2413, pages 1--17. Springer Verlag, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Boutilier, T. Dean, and S. Hanks. Decision- theoretic planning: Structural assumptions and computational leverage. Journal of AI Research, 11:1--94, 1999.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Brazier, B. D. Keplicz, N. Jennings, and J. Treur. Desire: Modelling multi-agent systems in a compositional formal framework. International Journal of Cooperative Information Systems, 6:67--94, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  6. G. De Giacomo, Y. Lespérance, and H. Levesque. ConGolog, a concurrent programming language based on the situation calculus. Artificial Intelligence, 121(1--2):109--169, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Georgeff and A. Lansky. Reactive reasoning and planning. In In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87), pages 677--682, 1987.Google ScholarGoogle Scholar
  8. K. Hindriks, Y. Lespérance, and H. Levesque. An embedding of congolog in 3APL.Google ScholarGoogle Scholar
  9. K. V. Hindriks, F. S. D. Boer, W. V. der Hoek, and J.-J. C. Meyer. Agent programming in 3apl. Autonomous Agents and Multi-Agent Systems, 2(4):357--401, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. Kinny. The psi calculus: An algebraic agent language. In J.-J. C. Meyer and M. Tambe, editors, Intelligent Agents VIII, Agent Theories Architectures and Languages, LNAI 2333, pages 32--50. Springer-Verlag, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Rao and M. Georgeff. Modeling rational agents within a BDI architecture. In Proceedings of the KR91, 1991.Google ScholarGoogle Scholar
  12. M. Shanahan. Reinventing shakey. In J. Minker, editor, Workshop on Logic-Based Artificial Intelligence, College Park, Maryland, 1999. Computer Science Department, University of Maryland. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Programming agent deliberation: an approach illustrated using the 3APL language

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems
            July 2003
            1200 pages
            ISBN:1581136838
            DOI:10.1145/860575

            Copyright © 2003 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 14 July 2003

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,155of5,036submissions,23%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader