{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:57:34Z","timestamp":1725857854674},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319402284"},{"type":"electronic","value":"9783319402291"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40229-1_32","type":"book-chapter","created":{"date-parts":[[2016,6,11]],"date-time":"2016-06-11T12:54:04Z","timestamp":1465649644000},"page":"469-486","source":"Crossref","is-referenced-by-count":4,"title":["Intuitionistic Layered Graph Logic"],"prefix":"10.1007","author":[{"given":"Simon","family":"Docherty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Pym","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,12]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1093\/logcom\/exn060","volume":"20","author":"P Balbiani","year":"2008","unstructured":"Balbiani, P., Ditmarsch, H., Herzig, A., de Lima, T.: Tableaux for public announcement logic. J. Logic Comput. 20(1), 55\u201376 (2008)","journal-title":"J. Logic Comput."},{"key":"32_CR2","unstructured":"Bezhanishvili, N., de Jongh, D.: Intuitionistic logic. Technical report PP-2006-25, Institute for Logic, Language and Computation Universiteit van Amsterdam (2006)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Br\u00f3dka, P., Skibicki, K., Kazienko, P., Musia\u0142, K.: A degree centrality in multi-layered social network. In: International Conference on Computational Aspects of Social Networks (2011)","DOI":"10.1109\/CASON.2011.6085951"},{"key":"32_CR4","volume-title":"A Discipline of Mathematical Systems Modelling","author":"M Collinson","year":"2012","unstructured":"Collinson, M., Monahan, B., Pym, D.: A Discipline of Mathematical Systems Modelling. College Publications, London (2012)"},{"issue":"5","key":"32_CR5","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1017\/S0960129509990077","volume":"19","author":"M Collinson","year":"2009","unstructured":"Collinson, M., Pym, D.: Algebra and logic for resource-based systems modelling. Math. Struct. Comput. Sci. 19(5), 959\u20131027 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1093\/logcom\/exv019","volume":"24","author":"M Collinson","year":"2014","unstructured":"Collinson, M., McDonald, K., Pym, D.: A substructural logic for layered graphs. J. Logic Comput. 24(4), 953\u2013988 (2014). doi: 10.1093\/logcom\/exv019 . http:\/\/logcom.oxfordjournals.org\/content\/early\/2015\/06\/04\/logcom.exv019.full.pdf+html","journal-title":"J. Logic Comput."},{"key":"32_CR7","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1093\/logcom\/exv020"},{"key":"32_CR8","doi-asserted-by":"publisher","unstructured":"Courtault, J.-R., Galmiche, D.: A modal separation logic for resource dynamics. J. Logic Comput. (2015). doi: 10.1093\/logcom\/exv031","DOI":"10.1093\/logcom\/exv031"},{"key":"32_CR9","unstructured":"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"},{"issue":"2","key":"32_CR10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/S0097539795279943","volume":"28","author":"A Fiat","year":"1998","unstructured":"Fiat, A., Foster, D., Karloff, H., Rabani, Y., Ravid, Y., Vishwanathan, S.: Competitive algorithms for layered graph traversal. SIAM J. Comput. 28(2), 447\u2013462 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"32_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1305\/ndjfl\/1093894722","volume":"13","author":"M Fitting","year":"1972","unstructured":"Fitting, M.: Tableau methods of proof for modal logics. Notre Dame J. Formal Logic 13(2), 237\u2013247 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"06","key":"32_CR12","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1017\/S0960129505004858","volume":"15","author":"D Galmiche","year":"2005","unstructured":"Galmiche, D., M\u00e9ry, D., Pym, D.: The semantics of BI and resource tableaux. Math. Struct. Comput. Sci. 15(06), 1033\u20131088 (2005)","journal-title":"Math. Struct. Comput. Sci."},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"138701","DOI":"10.1103\/PhysRevLett.96.138701","volume":"96","author":"M Kurant","year":"2006","unstructured":"Kurant, M., Thiran, P.: Layered complex networks. Phys. Rev. Lett. 96, 138701 (2006)","journal-title":"Phys. Rev. Lett."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013178 (1961)","DOI":"10.1090\/psapm\/012\/9972"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1093\/oso\/9780198537779.003.0008","volume-title":"Substructural Logics","author":"J Lambek","year":"1993","unstructured":"Lambek, J.: From categorical grammar to bilinear logic. In: Schroeder-Heister, P., Do\u0161en, K. (eds.) Substructural Logics, pp. 207\u2013237. Oxford University Press, Oxford (1993)"},{"key":"32_CR16","doi-asserted-by":"publisher","unstructured":"Larchey-Wendling, D.: The formal proof of the strong completeness of partial monoidal boolean BI. J. Logic Comput. (2014). doi: 10.1093\/logcom\/exu031","DOI":"10.1093\/logcom\/exu031"},{"issue":"2","key":"32_CR17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P., Pym, D.: The logic of bunched implications. Bull. Symbolic Logic 5(2), 215\u2013244 (1999)","journal-title":"Bull. Symbolic Logic"},{"issue":"1","key":"32_CR18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Shortest paths without a map. Theoret. Comput. Sci. 84(1), 127\u2013150 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"32_CR19","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.dam.2010.03.014","volume":"159","author":"A Paz","year":"2011","unstructured":"Paz, A.: A theory of decomposition into prime factors of layered interconnection networks. Discrete Appl. Math. 159(7), 628\u2013646 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"32_CR20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.tcs.2003.11.020","volume":"315","author":"D Pym","year":"2004","unstructured":"Pym, D., O\u2019Hearn, P., Yang, H.: Possible worlds and resources: the semantics of BI. Theoret. Comput. Sci. 315(1), 257\u2013305 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR21","unstructured":"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 )"},{"key":"32_CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C Stirling","year":"1987","unstructured":"Stirling, C.: Modal logics for communication systems. Theoret. Comput. Sci. 49, 311\u2013347 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic epistemic logic. Synthese Library (2008)","DOI":"10.1007\/978-1-4020-5839-4"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40229-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T15:16:44Z","timestamp":1718637404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40229-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319402284","9783319402291"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40229-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}