Abstract
The logic of Bunched Implications (BI) freely combines additive and multiplicative connectives, including implications; however, despite its well-studied proof theory, proof-search in BI has always been a difficult problem. The focusing principle is a restriction of the proof-search space that can capture various goal-directed proof-search procedures. In this paper we show that focused proof-search is complete for BI by first reformulating the traditional bunched sequent calculus using the simpler data-structure of nested sequents, following with a polarised and focused variant that we show is sound and complete via a cut-elimination argument. This establishes an operational semantics for focused proof-search in the logic of Bunched Implications.
This work has been partially supported by the UK’s EPSRC through research grant EP/S013008/1.
Chapter PDF
Similar content being viewed by others
References
Andreoli, J.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2, 297–347 (1992)
Armelin, P.: Bunched Logic Programming. Ph.D. thesis, Queen Mary College, University of London (2002)
Brotherston, J.: A unified display proof theory for bunched logic. Electronic Notes in Theoretical Computer Science 265, 197 – 211 (2010), proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2010)
Brotherston, J., Calcagno, C.: Classical BI: Its semantics and proof theory. Logical Methods in Computer Science 6 (05 2010). https://doi.org/10.2168/LMCS-6(3:3)2010
Chaudhuri, K., Marin, S., Straßburger, L.: Focused and synthetic nested sequents. In: Foundations of Software Science and Computation. pp. 390–407 (04 2016)
Chaudhuri, K., Marin, S., Straßburger, L.: Modular focused proof systems for intuitionistic modal logics. In: FSCD 2016 - 1st International Conference on Formal Structures for Computation and Deduction (2016)
Chaudhuri, K., Pfenning, F., Price, G.: A logical characterization of forward and backward chaining in the inverse method. In: Furbach, U., Shankar, N. (eds.) Automated Reasoning. pp. 97–111. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)
Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: Cut-elimination and completions. Annals of Pure and Applied Logic 163(3), 266–290 (Mar 2012). https://doi.org/10.1016/j.apal.2011.09.003, http://dx.doi.org/10.1016/j.apal.2011.09.003
Ciabattoni, A., Ramanayake, R.: Bunched hypersequent calculi for distributive substructural logics. In: Eiter, T., Sands, D. (eds.) LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing, vol. 46, pp. 417–434. EasyChair (2017). https://doi.org/10.29007/ngp3, https://easychair.org/publications/paper/sr2D
Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. In: Maurer, H.A. (ed.) Automata, Languages and Programming. pp. 188–202. Springer Berlin Heidelberg, Berlin, Heidelberg (1979)
Docherty, S.: Bunched Logics: A Uniform Approach. Ph.D. thesis, University College London (2019)
Donnelly, K., Gibson, T., Krishnaswami, N., Magill, S., Park, S.: The inverse method for the logic of bunched implications. In: Baader, F., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. pp. 466–480. Springer Berlin Heidelberg, Berlin, Heidelberg (2005)
Dyckhoff, R., Lengrand, S.: LJQ: A strongly focused calculus for intuitionistic logic. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) Logical Approaches to Computational Barriers. pp. 173–185. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)
Farooque, M., Graham-Lengrand, S., Mahboubi, A.: A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus. In: Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice. p. 3–14. LFMTP ’13, Association for Computing Machinery, New York, NY, USA (2013). https://doi.org/10.1145/2503887.2503892
Gabbay, D.: Fibring Logics. Oxford Logic Guides, Clarendon Press (1998), https://books.google.co.uk/books?id=mpA1uUV-uYsC
Galmiche, D., Méry, D.: Semantic labelled tableaux for propositional BI. J. Log. Comput. 13, 707–753 (2003)
Galmiche, D., Méry, D., Pym, D.: The semantics of BI and resource tableaux. Mathematical Structures in Computer Science 15(6), 1033–1088 (2005)
Galmiche, D., Marti, M., Méry, D.: Relating labelled and label-free bunched calculi in BI logic. In: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. pp. 130–146. Springer (2019)
Galmiche, D., Méry, D.: Proof-search and countermodel generation in propositional BI Logic - extended abstract -. In: N. Kobayashi, B.P. (ed.) 4th International Symposium on Theoretical Aspects of Computer Software - TACS 2001. Lecture Notes in Computer Science, vol. 2215, pp. 263–282. Springer, Sendai, Japan (2001)
Galmiche, D., Méry, D.: Connection-based proof search in propositional BI logic. In: Voronkov, A. (ed.) 18th International Conference on Automated Deduction - CADE-18. Lecture Notes in Computer Science, vol. 2392, pp. 111–128. Springer Verlag, Copenhagen/Denmark (2002)
Gentzen, G.: The Collected Papers of Gerhard Gentzen. Amsterdam: North-Holland Pub. Co. (1969)
Girard, J.Y.: Linear logic. Theoretical Computer Science 50(1), 1 – 101 (1987)
Ishtiaq, S., O’Hearn, P.W.: BI as an assertion language for mutable data structures. SIGPLAN Not. 46(4), 84–96 (May 2011). https://doi.org/10.1145/1988042.1988050, https://doi.org/10.1145/1988042.1988050
Laurent, O.: A proof of the focalization property of linear logic (04 2004), https://perso.ens-lyon.fr/olivier.laurent/llfoc.pdf
Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Journal of Theoretical Computer Science. 410(46), 4747–4768 (Nov 2009)
Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56(1), 239 – 311 (1992)
Marin, S., Miller, D., Volpe, M.: A focused framework for emulating modal proof systems. In: 11th conference on” Advances in Modal Logic”. pp. 469–488. College Publications (2016)
McLaughlin, S., Pfenning, F.: Imogen: Focusing the polarized focused inverse method for intuitionistic propositional logic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) 15th International Conference on Logic, Programming, Artificial Intelligence and Reasoning (LPAR). vol. 5330, pp. 174–181 (Nov 2008)
Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51(1), 125 – 157 (1991)
Miller, D., Pimentel, E.: A formal framework for specifying sequent calculus proof systems. Theoretical Compututer Science 474, 98–116 (Feb 2013)
O’Hearn, P., Pym, D.: The logic of bunched implications. The Bulletin of Symbolic Logic 5(2), 215–244 (1999)
Pym, D.: Resource semantics: Logic as a modelling technology. ACM SIGLOG News 6(2), 5–41 (Apr 2019). https://doi.org/10.1145/3326938.3326940, https://doi.org/10.1145/3326938.3326940
Pym, D.J.: The Semantics and Proof Theory of the Logic of Bunched Implications, Applied Logic Series, vol. 26. Springer Netherlands, Dordrecht (2002)
Pym, D.J., O’Hearn, P.W., Yang, H.: Possible Worlds and Resources: the Semantics of BI. Theoretical Computer Science 315(1), 257 – 305 (2004). https://doi.org/10.1016/j.tcs.2003.11.020, http://www.sciencedirect.com/science/article/pii/S0304397503006248
Ramanayake, R.: Extended Kripke lemma and decidability for hypersequent substructural logics. In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. p. 795–806. LICS ’20, Association for Computing Machinery, New York, NY, USA (2020). https://doi.org/10.1145/3373718.3394802
Read, S.: Relevant Logic: A Philosophical Examination of Inference. B. Blackwell (1988)
Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings 17th Annual IEEE Symposium on Logic in Computer Science. pp. 55–74 (2002)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2021 The Author(s)
About this paper
Cite this paper
Gheorghiu, A., Marin, S. (2021). Focused Proof-search in the Logic of Bunched Implications. In: Kiefer, S., Tasson, C. (eds) Foundations of Software Science and Computation Structures. FOSSACS 2021. Lecture Notes in Computer Science(), vol 12650. Springer, Cham. https://doi.org/10.1007/978-3-030-71995-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-71995-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-71994-4
Online ISBN: 978-3-030-71995-1
eBook Packages: Computer ScienceComputer Science (R0)
