Skip to main content
SpringerLink
Log in

Intuitionistic Layered Graph Logic

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2016)

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

Included in the following conference series:

Abstract

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic that gives an account of layering. As in bunched systems, the logic includes the usual intuitionistic connectives, together with a non-commutative, non-associative conjunction (used to capture layering) and its associated implications. We give soundness and completeness theorems for labelled tableaux and Hilbert-type systems with respect to a Kripke semantics on graphs. To demonstrate the utility of the logic, we show how to represent a range of systems and security examples, illuminating the relationship between services/policies and the infrastructures/architectures to which they are applied.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

References

  1. Balbiani, P., Ditmarsch, H., Herzig, A., de Lima, T.: Tableaux for public announcement logic. J. Logic Comput. 20(1), 55–76 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bezhanishvili, N., de Jongh, D.: Intuitionistic logic. Technical report PP-2006-25, Institute for Logic, Language and Computation Universiteit van Amsterdam (2006)

    Google Scholar 

  3. Bródka, P., Skibicki, K., Kazienko, P., Musiał, K.: A degree centrality in multi-layered social network. In: International Conference on Computational Aspects of Social Networks (2011)

    Google Scholar 

  4. Collinson, M., Monahan, B., Pym, D.: A Discipline of Mathematical Systems Modelling. College Publications, London (2012)

    MATH  Google Scholar 

  5. Collinson, M., Pym, D.: Algebra and logic for resource-based systems modelling. Math. Struct. Comput. Sci. 19(5), 959–1027 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Collinson, M., McDonald, K., Pym, D.: A substructural logic for layered graphs. J. Logic Comput. 24(4), 953–988 (2014). doi:10.1093/logcom/exv019. http://logcom.oxfordjournals.org/content/early/2015/06/04/logcom.exv019.full.pdf+html

    Article  MathSciNet  MATH  Google Scholar 

  7. Collinson, M., McDonald, K., Pym, D.: Layered graph logic as an assertion language for access control policy models. J. Logic Comput. (2015). doi:10.1093/logcom/exv020

    Google Scholar 

  8. Courtault, J.-R., Galmiche, D.: A modal separation logic for resource dynamics. J. Logic Comput. (2015). doi:10.1093/logcom/exv031

    Google Scholar 

  9. Docherty, S., Pym, D.: Intuitionistic layered graph logic. Research note RN 16/03, Department of Computer Science, UCL. http://www.cs.ucl.ac.uk/fileadmin/UCL-CS/research/Research_Notes/RN_16_03.pdf

  10. Fiat, A., Foster, D., Karloff, H., Rabani, Y., Ravid, Y., Vishwanathan, S.: Competitive algorithms for layered graph traversal. SIAM J. Comput. 28(2), 447–462 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fitting, M.: Tableau methods of proof for modal logics. Notre Dame J. Formal Logic 13(2), 237–247 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  12. Galmiche, D., Méry, D., Pym, D.: The semantics of BI and resource tableaux. Math. Struct. Comput. Sci. 15(06), 1033–1088 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kurant, M., Thiran, P.: Layered complex networks. Phys. Rev. Lett. 96, 138701 (2006)

    Article  Google Scholar 

  14. Lambek, J.: On the calculus of syntactic types. In: Proceedings of the 12th Symposia on Applied Mathematics, Studies of Language and Its Mathematical Aspects, Providence, pp. 166–178 (1961)

    Google Scholar 

  15. Lambek, J.: From categorical grammar to bilinear logic. In: Schroeder-Heister, P., Došen, K. (eds.) Substructural Logics, pp. 207–237. Oxford University Press, Oxford (1993)

    Google Scholar 

  16. Larchey-Wendling, D.: The formal proof of the strong completeness of partial monoidal boolean BI. J. Logic Comput. (2014). doi:10.1093/logcom/exu031

    Google Scholar 

  17. O’Hearn, P., Pym, D.: The logic of bunched implications. Bull. Symbolic Logic 5(2), 215–244 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. Papadimitriou, C., Yannakakis, M.: Shortest paths without a map. Theoret. Comput. Sci. 84(1), 127–150 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Paz, A.: A theory of decomposition into prime factors of layered interconnection networks. Discrete Appl. Math. 159(7), 628–646 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Pym, D., O’Hearn, P., Yang, H.: Possible worlds and resources: the semantics of BI. Theoret. Comput. Sci. 315(1), 257–305 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Schneier, B.: The weakest link (2005). (https://www.schneier.com/blog/archives/2005/02/the_weakest_lin.html). Schneier on Security (https://www.schneier.com)

  22. Stirling, C.: Modal logics for communication systems. Theoret. Comput. Sci. 49, 311–347 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  23. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic epistemic logic. Synthese Library (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University College London, London, UK

    Simon Docherty & David Pym

Authors
  1. Simon Docherty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Pym
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Docherty .

Editor information

Editors and Affiliations

  1. Aix-Marseille University, Marseille, France

    Nicola Olivetti

  2. SRI International, Menlo Park, California, USA

    Ashish Tiwari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Docherty, S., Pym, D. (2016). Intuitionistic Layered Graph Logic. In: Olivetti, N., Tiwari, A. (eds) Automated Reasoning. IJCAR 2016. Lecture Notes in Computer Science(), vol 9706. Springer, Cham. https://doi.org/10.1007/978-3-319-40229-1_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40229-1_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40228-4

  • Online ISBN: 978-3-319-40229-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation