Skip to main content

Accumulative Knowledge under Bounded Resources

  • Conference paper
Computational Logic in Multi-Agent Systems (CLIMA 2013)

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

Included in the following conference series:

Abstract

A possible purpose of performing an action is to collect information. Such informative actions are usually resource-consuming. The resources needed for performing them can be for example time or memory, but also money, specialized equipment etc. In this work, we propose a formal framework to study how the ability of an agent to improve its knowledge changes as a result of changing the available resources. We introduce a model for resource-consuming informative actions, and show how the process of accumulating knowledge can be modelled. Based on this model, we propose a modal logic for reasoning about the epistemic abilities of agents. We present some validities of the logic, and show that the model checking problem sits in the first level of polynomial hierarchy. We also discuss the connection between our framework and classical information theory. More specifically, we show that the notion of uncertainty given by Hartley measure can be seen as a special case of an agent’s ability to improve its knowledge using informative actions.

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

Access this chapter

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. Ågotnes, T., van Ditmarsch, H.: Coalitions and announcements. In: Proceedings of AAMAS, pp. 673–680 (2008)

    Google Scholar 

  2. Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50(2), 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alechina, N., Logan, B.: Logical omniscience and the cost of deliberation. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 100–109. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Alechina, N., Logan, B.: Ascribing beliefs to resource bounded agents. In: Proceedings of AAMAS, pp. 881–888. ACM (2002)

    Google Scholar 

  5. Alechina, N., Logan, B.: A complete and decidable logic for resource-bounded agents. In: Proceedings of AAMAS 2004, pp. 606–613. IEEE Computer Society (2004)

    Google Scholar 

  6. Alechina, N., Logan, B., Nga, N., Rakib, A.: Verifying properties of coalitional ability under resource bounds. In: Proceedings of the Logics for Agents and Mobility, LAM (2009)

    Google Scholar 

  7. Alechina, N., Logan, B., Nguyen, H., Rakib, A.: Resource-bounded alternating-time temporal logic. In: Proceedings of AAMAS, pp. 481–488 (2010)

    Google Scholar 

  8. Alechina, N., Logan, B., Nguyen, H., Rakib, A.: Logic for coalitions with bounded resources. Journal of Logic and Computation 21(6), 907–937 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bolander, T., Birkegaard Andersen, M.: Epistemic planning for single- and multi-agent systems. Journal of Applied Non-Classical Logics 21(1), 9–34 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bulling, N., Farwer, B.: Expressing properties of resource-bounded systems: The logics RTL * and RTL. In: Dix, J., Fisher, M., Novák, P. (eds.) CLIMA X. LNCS, vol. 6214, pp. 22–45. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Bulling, N., Farwer, B.: On the (un-)decidability of model checking resource-bounded agents. In: Proceedings of ECAI. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 567–572. IOS Press (2010)

    Google Scholar 

  12. Della Monica, D., Napoli, M., Parente, M.: On a logic for coalitional games with priced-resource agents. Electron. Notes Theor. Comput. Sci. 278, 215–228 (2011)

    Article  Google Scholar 

  13. Draper, D., Hanks, S., Weld, D.: A probabilistic model of action for least-commitment planning with information gathering. In: Proceedings of the Tenth International Conference on Uncertainty in Artificial Intelligence, pp. 178–186. Morgan Kaufmann Publishers Inc. (1994)

    Google Scholar 

  14. Eberle, R.A.: A logic of believing, knowing, and inferring. Synthese 26, 356–382 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  15. Fagin, R., Halpern, J.Y.: Belief, awareness, and limited reasoning. Artificial Intelligence 34(1), 39–76 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  17. Friedman, N., Halpern, J.: A knowledge-based framework for belief change, Part II: Revision and update. In: Proceedings of KR 1994, pp. 190–200 (1994)

    Google Scholar 

  18. Grabisch, M., Marichal, J.-L., Mesiar, R., Pap, E.: Aggregation Functions. Cambridge University Press (2009)

    Google Scholar 

  19. Halpern, J., Moses, Y., Vardi, M.: Algorithmic knowledge. In: Proceedings of TARK 1994, pp. 255–266 (1994)

    Google Scholar 

  20. Hartley, R.: Transmission of information. The Bell System Technical Journal 7(3), 535–563 (1928)

    Article  Google Scholar 

  21. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103 (1972)

    Google Scholar 

  22. Konolige, K.: A Deduction Model of Belief. Morgan Kaufmann Publishers Inc., San Francisco (1986)

    MATH  Google Scholar 

  23. Kripke, S.: Semantic analysis of modal logic. Zeitschrift fur Mathematische Logik und Grund lagen der Mathematik 9, 67–96 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  24. Moore, R., Hendrix, G.: Computational models of beliefs and the semantics of belief sentences (1979)

    Google Scholar 

  25. Rantala, V.: A modal logic for coalitional power in games. Acta Philosophica Fennica 35, 18–24 (1982)

    MathSciNet  Google Scholar 

  26. Sardiña, S., Giacomo, G.D., Lespérance, Y., Levesque, H.: On the limits of planning over belief states under strict uncertainty. In: Proceedings of KR, pp. 463–471 (2006)

    Google Scholar 

  27. Simon, H.: Theories of bounded rationality. In: McGuire, C., Radner, R. (eds.) Decision and Organization, pp. 161–176. North-Holland, Amsterdam (1972)

    Google Scholar 

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

    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

Jamroga, W., Tabatabaei, M. (2013). Accumulative Knowledge under Bounded Resources. 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_13

Download citation

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

  • 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)

Publish with us

Policies and ethics