Skip to main content

Representation of Knowledge and Uncertainty in Temporal Logic LTL with Since on Frames Z of Integer Numbers

  • Conference paper

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

Abstract

We study a new hybrid logic \({\cal L}{\cal T}{\cal L}^{\cal Z,U}_{{\cal I}{\cal A}}\) using as components: LTL based on \({\cal{\cal Z}}\) with operations Since and Previous, multi-agent logic with interacting agents, and operation of logical uncertainty. The language of \({\cal L}{\cal T}{\cal L}^{\cal Z,U}_{{\cal I}{\cal A}}\) contains, together with the standard operations of LTL and multi-agent logic, new knowledge operations KnI (for ‘known through interaction’), GK L and GK G (for local and global general knowledge), and expressible logical operations: U - for uncertainty, and U l for local uncertainty. We consider questions of satisfiability and decidability for \({\cal L}{\cal T}{\cal L}^{\cal Z,U}_{{\cal I}{\cal A}}\). The key result is construction of an algorithm which recognizes theorems of \({\cal L}{\cal T}{\cal L}^{\cal Z,U}_{{\cal I}{\cal A}}\) (this implies that \({\cal L}{\cal T}{\cal L}^{\cal Z,U}_{{\cal I}{\cal A}}\) is decidable, and the satisfiability problem for \({\cal L}{\cal T}{\cal L}^{\cal Z,U}_{{\cal I}{\cal A}}\) is solvable.)

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hakansson, A., Hartung, R.L.: Autonomously creating a hierarchy of intelligent agents using clustering in a multi-agent system. In: Proc. of the 2008 Int. Conf. on Artificial Intelligence, IC-AI 2008, pp. 89–95 (2008)

    Google Scholar 

  2. Apelkrans, M., Håkansson, A.: Applying Multi-Agent System Technique to Production Planning in Order to Automate Decisions. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2009. LNCS, vol. 5559, pp. 193–202. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Barringer, H., Fisher, M., Gabbay, D., Gough, G.: Advances in Temporal Logic. Applied logic series, vol. 16. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  4. Bull, R.A.: An Algebraic Study of Tense Logics With Linear Time. The Journal of Symbolic Logic 33, 27–38 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bull, R.A.: Note on a Paper in Tense Logic. The Journal of Symbolic Logic 34, 215–218 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  6. Clarke, E., Grumberg, O., Hamaguchi, K.P.: Another look at LTL Model Checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 415–427. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  7. Daniele, M., Giunchiglia, F., Vardi, M.: 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 

  8. de Jongh, D., Veltman, F., Verbrugge, R.: Completeness by construction for tense logics of linear time. In: Troelstra, A.S., Visser, A., van Benthem, J.F.A.K., Veltman, F.J.M.M. (eds.) Liber Amicorum for Dick de Jongh. Institute of Logic, Language and Computation, Amsterdam (2004), http://www.illc.uva.nl/D65/

    Google Scholar 

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

    MATH  Google Scholar 

  10. Gabbay, D.M., Hodkinson, I.M.: An axiomatisation of the temporal logic with Until and Since over the real numbers. Journal of Logic and Computation 1, 229–260 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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 

  12. 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 

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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  16. 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 

  17. Rybakov, V.V.: A Criterion for Admissibility of Rules in the Modal System S4 and the Intuitionistic Logic. Algebra and Logic 23(5), 369–384 (1984) (Engl. Translation)

    Article  MATH  Google Scholar 

  18. Rybakov, V.V.: Rules of Inference with Parameters for Intuitionistic logic. Journal of Symbolic Logic 57(3), 912–923 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rybakov, V.V.: Hereditarily Structurally Complete Modal Logics. Journal of Symbolic Logic 60(1), 266–288 (1995)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  21. Rybakov, V.V.: Construction of an Explicit Basis for Rules Admissible in Modal System S4. Mathematical Logic Quarterly 47(4), 441–451 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  22. Rybakov, V.V.: Logical Consecutions in Discrete Linear Temporal Logic. Journal of Symbolic Logic 70(4), 1137–1149 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  23. Rybakov, V.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 

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

    Chapter  Google Scholar 

  25. Rybakov, V.: Linear Temporal Logic with Until and Next, Logical Consecutions. Annals of Pure and Applied Logic 155(1), 32–45 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  26. Babenyshev, S., Rybakov, V.V.: Logic of Discovery andKnowledge: Decision Algorithm. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol. 5178, pp. 711–718. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  27. Rybakov, V.V.: Linear Temporal Logic LTL k extended by Multi-Agent Logic K n with Interacting Agents. J. Log. Comput. 19(6), 989–1017 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  28. Babenyshev, S., Rybakov, V.V.: Temporal Logic for Modeling Discovery and Logical Uncertainty. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009. LNCS, vol. 5712, pp. 16–23. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  29. Babenyshev, S., Rybakov, V.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, vol. 5711, pp. 38–45. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  30. Babenyshev, S., Rybakov, V.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, vol. 6276, pp. 230–239. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  31. Babenyshev, S., Rybakov, V.V.: Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010. LNCS, vol. 6114, pp. 337–344. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  32. van Benthem, J., Bergstra, J.A.: Logic of Transition Systems. Journal of Logic, Language and Information 3(4), 247–283 (1994)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  34. Vardi, M.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–641. Springer, Heidelberg (1998)

    Chapter  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 paper

Cite this paper

Rybakov, V.V. (2011). Representation of Knowledge and Uncertainty in Temporal Logic LTL with Since on Frames Z of Integer Numbers. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23851-2_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23851-2_32

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics