Skip to main content

Quantified Coalition Logic for BDI-Agents: Completeness and Complexity

  • Conference paper
PRICAI 2014: Trends in Artificial Intelligence (PRICAI 2014)

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

Included in the following conference series:

  • 6456 Accesses

Abstract

This paper introduces a multi-dimensional modal logic of Quantified Coalition Logic of Beliefs, Desires and Intentions (QCLBDI) to reason about how agents’ mental attitudes evolve by cooperation in game-like multi-agent systems. We present a complete axiomatic system of QCLBDI with the formal proof and show that the satisfiability for QCLBDI is PSPACE-complete, computationally no harder than that of CL.

This work is supported by National Basic Research 973 Program of China grant 2010CB328103; National Natural Science Foundation of China grant No.61272415, No.61003056, and No.61472369; and ARC Future Fellowship No.FT0991785 in Australia.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Rao, A.S., Georgeff, M.P.: BDI agents: From theory to practice. In: Proceedings of the First International Conference on Multiagent Systems, San Francisco, California, USA, June 12-14, pp. 312–319 (1995)

    Google Scholar 

  2. Ågotnes, T., van der Hoek, W., Wooldridge, M.: Quantified coalition logic. Synthese 165(2), 269–294 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Pauly, M.: A modal logic for coalitional power in games. Journal of Logic and Computation 12(1), 149–166 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  5. Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54(2), 319–379 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ågotnes, T., Alechina, N.: A logic for reasoning about knowledge of unawareness. Journal of Logic, Language and Information 23(2), 197–217 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bulling, N., Jamroga, W.: Comparing variants of strategic ability: how uncertainty and memory influence general properties of games. Autonomous Agents and Multi-Agent Systems 28(3), 474–518 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, Q., Li, Q., Su, K., Luo, X. (2014). Quantified Coalition Logic for BDI-Agents: Completeness and Complexity. In: Pham, DN., Park, SB. (eds) PRICAI 2014: Trends in Artificial Intelligence. PRICAI 2014. Lecture Notes in Computer Science(), vol 8862. Springer, Cham. https://doi.org/10.1007/978-3-319-13560-1_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13560-1_72

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13559-5

  • Online ISBN: 978-3-319-13560-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics