Abstract
We present a labelled sequent calculus for Boolean BI (BBI), a classical variant of the logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination. We show that all the structural rules in the calculus, i.e., those rules that manipulate labels and ternary relations, can be localised around applications of certain logical rules, thereby localising the handling of these rules in proof search. Based on this, we demonstrate a free variable calculus that deals with the structural rules lazily in a constraint system. We propose a heuristic method to quickly solve certain constraints, and show some experimental results to confirm that our approach is feasible for proof search. Additionally, we conjecture that different semantics for BBI and some axioms in concrete models can be captured by adding extra structural rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brotherston, J.: A unified display proof theory for bunched logic. ENTCS 265, 197–211 (2010)
Brotherston, J., Calcagno, C.: Classical BI: Its semantics and proof theory. LMCS 6(3) (2010)
Brotherston, J., Kanovich, M.: Undecidability of propositional separation logic and its neighbours. In: LICS, pp. 130–139 (2010)
Brotherston, J., Kanovich, M.: Undecidability of propositional separation logic and its neighbours. Submitted to the Journal of ACM (2013)
Galmiche, D., Larchey-Wendling, D.: Expressivity properties of boolean BI through relational models. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 357–368. Springer, Heidelberg (2006)
Hoder, K., Voronkov, A.: Comparing unification algorithms in first-order theorem proving. In: Mertsching, B., Hund, M., Aziz, Z. (eds.) KI 2009. LNCS, vol. 5803, pp. 435–443. Springer, Heidelberg (2009)
Hóu, Z., Tiu, A., Goré, R.: A labelled sequent calculus for BBI: Proof theory and proof search. arXiv:1302.4783 (2013)
Larchey-Wendling, D.: The formal strong completeness of partial monoidal boolean BI. Submitted to Journal of Logic and Computation (2012)
Larchey-Wendling, D., Galmiche, D.: Exploring the relation between intuitionistic BI and boolean BI: An unexpected embedding. MSCS 19(3), 435–500 (2009)
Larchey-Wendling, D., Galmiche, D.: The undecidability of boolean BI through phase semantics. In: LICS, pp. 140–149 (2010)
Larchey-Wendling, D., Galmiche, D.: Non-deterministic phase semantics and the undecidability of boolean BI. ACM TOCL 14(1) (2013)
Negri, S.: Proof analysis in modal logic. JPL 34(5-6), 507–544 (2005)
Negri, S., von Plato, J.: Structural Proof Theory. CUP (2001)
O’Hearn, P.W., Pym, D.J.: The logic of bunched implications. BSL 5(2), 215–244 (1999)
Park, J., Seo, J., Park, S.: A theorem prover for boolean BI. In: POPL 2013, pp. 219–232. ACM, New York (2013)
Pym, D.J.: The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series. Kluwer Academic Publishers (2002)
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS 2002, pp. 55–74. IEEE Computer Society (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hóu, Z., Tiu, A., Goré, R. (2013). A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search. In: Galmiche, D., Larchey-Wendling, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2013. Lecture Notes in Computer Science(), vol 8123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40537-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-40537-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40536-5
Online ISBN: 978-3-642-40537-2
eBook Packages: Computer ScienceComputer Science (R0)