Skip to main content

Reasoning about the Beliefs of Agents in Multi-agent Domains in the Presence of State Constraints: The Action Language mAL

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 8143)

Abstract

Reasoning about actions forms the basis of many tasks such as prediction, planning, and diagnosis in a dynamic domain. Within the reasoning about actions community, a broad class of languages called action languages has been developed together with a methodology for their use in representing dynamic domains. With a few notable exceptions, the focus of these efforts has largely centered around single-agent systems. Agents rarely operate in a vacuum however, and almost in parallel, substantial work has been done within the dynamic epistemic logic community towards understanding how the actions of an agent may affect the knowledge and/or beliefs of his fellows. What is less understood by both communities is how to represent and reason about both the direct and indirect effects of both ontic and epistemic actions within a multi-agent setting. This paper presents a new action language, m \(\mathcal{AL}\), which brings together techniques developed in both communities for reasoning about dynamic multi-agent domains involving both ontic and epistemic actions, as well as the indirect effects that such actions may have on the domain.

Keywords

  • State Constraint
  • Successor State
  • Accessibility Relation
  • Transition Diagram
  • Kripke Structure

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-40624-9_18
  • Chapter length: 17 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-40624-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   74.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balduccini, M., Gelfond, M.: The AAA Architecture: An Overview. In: AAAI Spring Symposium 2008 on Architectures for Intelligent Theory-Based Agents (2008)

    Google Scholar 

  2. Baltag, A., Moss, L.S.: Logics for Epistemic Programs. Synthese 139(2), 165–224 (2004)

    MathSciNet  CrossRef  MATH  Google Scholar 

  3. Baral, C.: Reasoning About Actions: Non-deterministic Effects, Constraints, and Qualification. In: Proceedings of the 14th International Joint Conferences on Artificial Intelligence, IJCAI 1995, pp. 2017–2023. Morgan Kaufmann (1995)

    Google Scholar 

  4. Baral, C., Gelfond, G., Son, T.C., Pontelli, E.: An Action Language for Reasoning about Beliefs in Multi-Agent Domains. In: Proceedings of the 14th International Workshop on Non-Monotonic Reasoning (2012)

    Google Scholar 

  5. Baral, C., Gelfond, M.: Reasoning about effects of concurrent actions. Journal of Logic Programming 31, 85–117 (1997)

    MathSciNet  CrossRef  MATH  Google Scholar 

  6. van Benthem, J., van Eijck, J., Kooi, B.: Logics of communication and change. Information and Computation 204(11), 1620–1662 (2006)

    MathSciNet  CrossRef  MATH  Google Scholar 

  7. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer (2008)

    Google Scholar 

  8. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press (1995)

    Google Scholar 

  9. Gelfond, M.: Answer Sets. In: Handbook of Knowledge Representation, ch. 7. Elsevier (2007)

    Google Scholar 

  10. Gelfond, M., Lifschitz, V.: Representing Action and Change by Logic Programs. Journal of Logic Programming 17, 301–322 (1993)

    MathSciNet  CrossRef  MATH  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: Action Languages. Electronic Transactions on AI 3 (1998)

    Google Scholar 

  12. Lifschitz, V. (ed.): Formalizing Common Sense – Papers by John McCarthy. Ablex Publishing Corporation (1990)

    Google Scholar 

  13. Lin, F.: Embracing Causality in Specifying the Indirect Effects of Actions. In: Proceedings of the 14th International Joint Conferences on Artificial Intelligence, IJCAI 1995. Morgan Kaufmann (1995)

    Google Scholar 

  14. Lin, F., Shoham, Y.: Provably correct theories of action. Journal of the ACM 42(2), 293–320 (1995)

    MathSciNet  CrossRef  MATH  Google Scholar 

  15. McCain, N., Turner, H.: A Causal Theory of Ramifications and Qualifications. In: Proceedings of the 14th International Joint Conferences on Artificial Intelligence, IJCAI 1995. Morgan Kaufmann (1995)

    Google Scholar 

  16. McCarthy, J.: Programs with common sense. In: Semantic Information Processing, pp. 403–418. MIT Press (1959)

    Google Scholar 

  17. McCarthy, J.: Mathematical Logic in Artificial Intelligence. Daedalus 117(1), 297–311 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baral, C., Gelfond, G., Pontelli, E., Son, T.C. (2013). Reasoning about the Beliefs of Agents in Multi-agent Domains in the Presence of State Constraints: The Action Language mAL. In: Leite, J., Son, T.C., Torroni, P., van der Torre, L., Woltran, S. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2013. Lecture Notes in Computer Science(), vol 8143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40624-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40624-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40623-2

  • Online ISBN: 978-3-642-40624-9

  • eBook Packages: Computer ScienceComputer Science (R0)