Skip to main content
SpringerLink
Log in

Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic

  • Conference paper
Logical Foundations of Computer Science (LFCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5407))

Included in the following conference series:

Abstract

We study the multiagent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents. We introduce Hintikka structures for this logic and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using this result, we design an incremental tableau based decision procedure for testing satisfiability in CMAEL(CD).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Dziubinski, M., Verbrugge, R., Dunin-Keplicz, B.: Complexity issues in multiagent logics. Fundamenta Infomaticae 75, 239–262 (2007)

    MathSciNet  MATH  Google Scholar 

  2. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  3. Fagin, R., Halpern, J.Y., Vardi, M.Y.: What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM 39(2), 328–376 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goranko, V., Shkatov, D.: Tableau-based decision procedures for logics of strategic ability in multi-agent systems. ACM Transactions on Computational Logic (to appear), http://tocl.acm.org/accepted.html

  5. Goranko, V., Shkatov, D.: Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge. In: Proc. of the 6th IEEE Iternational Conference on Software Engineering and Formal Methods. IEEE Press, Los Alamitos (2008), http://arxiv.org/abs/0808.4133

    Google Scholar 

  6. Halpern, J.Y.: Using reasoning about knowledge to analyze distributed systems. Annual Review of Computer Science 2, 37–68 (1987)

    Article  MathSciNet  Google Scholar 

  7. Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of ACM 37(3), 549–587 (1990)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. van der Hoek, W., Meyer, J.-J.C.: Making some issues of implicit knowledge explicit. International Journal of Foundations of Computer Science 3(2), 193–224 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. van der Hoek, W., Meyer, J.-J.C.: Epistemic Logic for AI and Computer Science. In: CUP (1995)

    Google Scholar 

  11. van der Hoek, W., Meyer, J.-J.C.: A complete epistemic logic for multiple agents–combining distributed and common knowledge. In: Bacharach, M.O.L., et al. (eds.) Epistemic Logic and the Theory of Games and Decisions, pp. 35–68. Kluwer Academic Publishers, Dordrecht (1997)

    Chapter  Google Scholar 

  12. Wolper, P.: The tableau method for temporal logic: an overview. Logique et Analyse 28(110-111), 119–136 (1985)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of the Witwatersrand, South Africa

    Valentin Goranko

  2. School of Computer Science, University of the Witwatersrand, South Africa

    Dmitry Shkatov

Authors
  1. Valentin Goranko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dmitry Shkatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, CUNY Graduate Center, 365 Fifth Avenue, NY 10016, New York, USA

    Sergei Artemov

  2. Department of Mathematics, Cornell University, 545 Malott Hall, NY 14853, Ithaca, USA

    Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goranko, V., Shkatov, D. (2008). Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2009. Lecture Notes in Computer Science, vol 5407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92687-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92687-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92686-3

  • Online ISBN: 978-3-540-92687-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation