Skip to main content

Part of the book series: Lecture Notes in Computer Science ((TCCI,volume 6660))

  • 370 Accesses

Abstract

Aim of this paper is to work out a framework for computation inference rules valid in agents’ temporal logics. Coordinated, rational actions of agents use logical reasoning, derivations (in order to predict results). As a tool, describing human reasoning procedure, we suggest valid inference rules (valid semantically - in Kripke-like frames generating logic). Our paper studies inference rules valid in temporal agents’ logics admitting various representations of time, in particular, we consider logics with linear and branching intransitive time. We suggest algorithms which allow to compute valid inference rules in agents’ liner time logics \(\mathcal{LTL_{K}}\) and \(\mathcal{LTL_{K}}(Z)\), agents’ logic with branching intransitive time \(\mathcal{L_{TA}}_{i}\), and the logic with branching transitive time \(\mathcal{L_{TA}}_{t}\).

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. van Benthem, J.: The Logic of Time.- A Model-Theoretic Investigation into the Varieties Temporal Ontology and Temporal Discourse. Kluwer, Dordrecht (1991)

    MATH  Google Scholar 

  2. van Benthem, J.: Modality, bisimulation and interpolation in infinitary logic. Ann. Pure Appl. Logic 96 (1999)

    Google Scholar 

  3. Gabbay, D.M., Schlechta, K.: A theory of hierarchical consequence and conditionals. Journal of Logic, Language and Information 19(1), 3–32 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gabbay, D.M., Rodrigues, O., Pigozzi, G.: Connections between belief revision, belief merging and social choice. J. Log. Comput. 19(3), 445–446 (2009)

    Article  MathSciNet  Google Scholar 

  5. Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Stud. Logic Found. Math. Elsevier Sci. Publ, Noth-Holland (2003)

    Google Scholar 

  6. Hodkinson, I., Montanari, A., Sciavicco, G.: Non-finite axiomatizability and undecidability of interval temporal logics with C, D, and T. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 308–322. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Hodkinson, I.M.: Complexity of monodic guarded fragments over linear and real time. Ann. Pure Appl. Logic 138(1-3), 94–125 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hodkinson, I., Woter, F., Zakharyaschev, M.: Undecidable fragments of first-order branching time logic. In: LICS 2002, pp. 393–402 (2002)

    Google Scholar 

  9. Hodkinson, I.: Temporal logic and automata. In: Tempral Logic: Math. Found. and Comp. Asp., vol. 2, ch. 2, pp. 30–72. Clarendon Press, Oxford (2000)

    Google Scholar 

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

    MATH  Google Scholar 

  11. Halpern, J., Shore, R.: Reasoning about common knowledge with infinitely many agents. Information and Computation 191(1), 1–40 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Schmidt, R., Tishkovsky, D.: Multi-agent dynamic logics with informational test. Annals of Mathematics and Artificial Intelligence 42(1-3), 5–36 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hintikka, J., Vandamme, F.: Logic of Discovery and Logic of Discourse. Springer, Heidelberg (1986)

    Google Scholar 

  14. Pnueli, A.: The temporal logic of programs. In: Proc. of the 18th Annual Symp. on Foundations of Computer Science, pp. 46–57. IEEE, Los Alamitos (1977)

    Google Scholar 

  15. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)

    Book  MATH  Google Scholar 

  16. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)

    Book  MATH  Google Scholar 

  17. Clarke, E., Grumberg, O., Hamaguchi, K.P.: Another look at ltl model checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  18. Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 249–260. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Vardi, M.: An automata-theoretic approach to linear temporal logic. In: Proceedings of the Banff Workshop on Knowledge Acquisition, Banff 1994 (1994)

    Google Scholar 

  20. van Benthem, J.: The Logic of Time. Kluwer, Dordrecht (1991)

    Book  MATH  Google Scholar 

  21. van Benthem, J., Bergstra, J.: Logic of transition systems. Journal of Logic, Language and Information 3(4), 247–283 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  22. Goldblatt, R.: Logics of Time and Computation. CSLI Lecture Notes, vol. 7 (1992)

    Google Scholar 

  23. Gabbay, D., Hodkinson, I.: An axiomatisation of the temporal logic with until and since over the real numbers. Journal of Logic and Computation 1(2), 229–260 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  24. Hodkinson, I.: Temporal Logic. In: Gabbay, D.M., Reynolds, M.A., Finger, M. (eds.) Temporal Logic and Automata, vol. 2, ch. II, pp. 30–72. Clarendon Press, Oxford (2000)

    Google Scholar 

  25. Rybakov, V.: Logical consecutions in discrete linear temporal logic. Journal of Symbolic Logic 70(4), 1137–1149 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  26. Rybakov, V.: Logical consecutions in intransitive temporal linear logic of finite intervals. Journal of Logic Computation 15(5), 633–657 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  27. Rybakov, V.: Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 486–497. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  28. Bordini, R.H., Fisher, M., Visser, W., Wooldridge, M.: Model checking rational agents. IEEE Intelligent Systems 19, 46–52 (2004)

    Article  Google Scholar 

  29. Dix, J., Fisher, M., Levesque, H., Sterling, L.: Editorial. Annals of Mathematics and Artificial Intelligence 41(2-4), 131–133 (2004)

    Article  Google Scholar 

  30. van der Hoek, W., Wooldridge, M.: Towards a logic of rational agency. Logic Journal of the IGPL 11(2), 133–157 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  31. Fisher, M.: Temporal development methods for agent-based systems. Journal of Autonomous Agents and Multi-Agent Systems 10(1), 41–66 (2005)

    Article  Google Scholar 

  32. Hendler, J.: Agents and the semantic web. IEEE Intelligent Systems 16(2), 30–37 (2001)

    Article  Google Scholar 

  33. Kacprzak, M.: Undecidability of a multi-agent logic. Fundamenta Informaticae 45(2-3), 213–220 (2003)

    MathSciNet  MATH  Google Scholar 

  34. Wooldridge, M.J., Weiß, G., Ciancarini, P. (eds.): AOSE 2001. LNCS, vol. 2222. Springer, Heidelberg (2002)

    Google Scholar 

  35. Fagin, R., Geanakoplos, J., Halpern, J., Vardi, M.J.: The hierarchical approach to modeling knowledge and common knowledge. International Journal of Game Theory 28(3), 331–365 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  36. Babenyshev, S., Rybakov, V.: A framework to compute inference rules valid in agents’ temporal logics. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010. LNCS (LNAI), vol. 6276, pp. 230–239. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  37. Rybakov, V.: Logic of discovery in uncertain situations– deciding algorithms. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 950–958. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  38. Babenyshev, S., Rybakov, V.: Decidability of hybrid logic with local common knowledge based on linear temporal logic LTL. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 32–41. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  39. Babenyshev, S., Rybakov, V.: Describing evolutions of multi-agent systems. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009. LNCS (LNAI), vol. 5711, pp. 38–45. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  40. Rybakov, V.: Linear temporal logic K extended by multi-agent logic K n with interacting agents. J. of Logic Computation 19, 989–1017 (2009)

    Article  MATH  Google Scholar 

  41. Rybakov, V.: Rules of inference with parameters for intuitionistic logic. Journal of Symbolic Logic 57(3), 912–923 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  42. Rybakov, V.: Admissible Logical Inference Rules. Studies in Logic and the Foundations of Mathematics, vol. 136. Elsevier Sci. Publ., North-Holland (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rybakov, V. (2011). Inference Rules in Multi-agents’ Temporal Logics. In: Nguyen, N.T. (eds) Transactions on Computational Collective Intelligence IV. Lecture Notes in Computer Science(), vol 6660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21884-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21884-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21883-5

  • Online ISBN: 978-3-642-21884-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics