Semantic Labelled Tableaux for propositional BI (without bottom) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logic and Computation Year : 2003

Semantic Labelled Tableaux for propositional BI (without bottom)

Didier Galmiche
Daniel Méry

Abstract

In this paper, we study semantic labelled tableaux for the propositional Bunched Implications logic (BI) that freely combines intuitionistic logic (IL) and multiplicative intuitionistic linear logic (MILL). BI is a resource-aware logic that captures interferences between resources and it is well suited, because of its resource-based sharing interpretation, for reasoning about mutable data structures. We propose a labelled tableau calculus for BI without bottom, that is the unit of the additive disjunction, based on particular labels and constraints. We prove the soundness and completeness of this calculus wrt the Kripke resource semantics with an emphasis on countermodel construction. In addition, we prove the finite model property and as a consequence the decidability. Moreover, we analyze some algorithmic aspects of the tableau construction by providing a free variable variant of the calculus. We also develop the restrictions to IL and MILL that provide new tableau methods for both logics with generation of countermodels.
No file

Dates and versions

inria-00099556 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099556 , version 1

Cite

Didier Galmiche, Daniel Méry. Semantic Labelled Tableaux for propositional BI (without bottom). Journal of Logic and Computation, 2003, 13 (5), pp.707-753. ⟨inria-00099556⟩
76 View
0 Download

Share

Gmail Facebook X LinkedIn More