Skip to main content
SpringerLink
Log in

A Modal Logic for Network Topologies

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2000)

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

Included in the following conference series:

  • 378 Accesses

Abstract

In this paper, we present a logical framework that combines modality with a first-order quantification mechanism. The logic differs from standard first-order modal logics in that quantification is not performed inside the states of a model, but the states in the model themselves constitute the domain of quantifi-cation. The locality principle of modal logic is preserved via the requirement that in each state, the domain of quantification is restricted to a subset of the entire set of states in the model. We show that the language is semantically characterised by a generalisation of classical bisimulation, called history-based bisimulation, consider its decidability and study the application of the logic to describe and reason about the topologies of multi-agent systems.

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. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. ILLC Research Report ML-1996-03, Institute for Logic, Language and Computation, 1996.

    Google Scholar 

  2. C. Areces, P. Blackburn, and M. Marx. A road-map on complexity for hybrid logics. In Proceedings of Annual Conference of the European Association for Computer Science Logic (CSL’99), volume 1683 of Lecture Notes in Computer Science. Springer-Verlag, 1999.

    Google Scholar 

  3. J.F.A.K van Benthem. Modal Logic and Classical Logic. Bibliopolis, Napels, 1983.

    Google Scholar 

  4. P. Blackburn and J. Seligman. Hybrid languages. Journal of Logic, Language and Informa-tion, 4:251–272, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.M. van Eijk, F.S. de Boer, W. van der Hoek, and J.-J. Ch. Meyer. Open multi-agent sys-tems: Agent communication and integration. In N.R. Jennings and Y. Lespèrance, editors, Intelligent Agents VI, Proceedings of 6th International Workshop on Agent Theories, Archi-tectures, and Languages (ATAL’99), volume 1757 of Lecture Notes in Artificial Intelligence,pages 218–232. Springer-Verlag,Heidelberg, 2000.

    Google Scholar 

  6. M. Fitting and R.L. Mendelsohn. First-Order Modal Logic. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.

    Google Scholar 

  7. U. Goltz, R. Kuiper, and W. Penczek. Propositional temporal logics and equivalences. In Proceedings of Concur’92, volume 630 of Lecture Notes in Computer Science, pages 222–236, Berlin, 1992. Springer-Verlag.

    Google Scholar 

  8. A.J. Grove and J.Y. Halpern. Naming and identity in epistemic logics. part I: The proposi-tional case. Journal of Logic and Computation, 3(4):345–378, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32:137–162, 1985.

    MATH  MathSciNet  Google Scholar 

  10. W. van der Hoek. On the semantics of graded modalities. Journal of Applied Non Classical Logics, 2(1):81–123, 1992.

    MATH  MathSciNet  Google Scholar 

  11. G.E. Hughes and M.J. Cresswell. An Introduction to Modal Logic. Methuen and Co. Ltd, London, 1968.

    MATH  Google Scholar 

  12. J.-J. Ch. Meyer and W. van der Hoek. Epistemic Logic for Computer Science and Artificial Intelligence, volume 41 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.

    Google Scholar 

  13. O. Shehory. A scalable agent location mechanism. InIntelligent Agents VI-Proceedings of 6th International Workshop on Agent Theories, Architectures, and Languages (ATAL’99),volume 1757 of Lecture Notes in Artificial Intelligence, pages 162–172. Springer-Verlag, Heidelberg, 2000.

    Google Scholar 

  14. M. Wooldridge and N. Jennings. Intelligent agents: theory and practice. The Knowledge Engineering Review, 10(2):115–152, 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Rogier M. van Eijk, Frank S. de Boer, Wiebe van der Hoek & John-Jules Ch. Meyer

Authors
  1. Rogier M. van Eijk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wiebe van der Hoek
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. John-Jules Ch. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, E.T.S.I. Informática, University of Málaga, 29071, Málaga, Spain

    Manuel Ojeda-Aciego  & Inma P. de Guzmán  & 

  2. Intelligent Systems Department, Computer Science Institute, University of Leipzig, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Center for Artificial Intelligence, Department of Computer Science, University of Lisbon, 2825-114, Caparica, Portugal

    Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Eijk, R.M., de Boer, F.S., van der Hoek, W., Meyer, JJ.C. (2000). A Modal Logic for Network Topologies. In: Ojeda-Aciego, M., de Guzmán, I.P., Brewka, G., Moniz Pereira, L. (eds) Logics in Artificial Intelligence. JELIA 2000. Lecture Notes in Computer Science(), vol 1919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40006-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-40006-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41131-4

  • Online ISBN: 978-3-540-40006-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation