Connection-based proof search in propositional BI logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Connection-based proof search in propositional BI logic

Didier Galmiche
Daniel Méry


We present a connection-based characterization of propositional BI (logic of bunched implications), a logic combining linear and intuitionistic connectives. This logic, with its sharing interpretation, has been recently used to reason about mutable data structures and needs proof search methods. Our connection-based characterization for BI, is based on standard notions but involves, in a specific way, labels and constraints in order to capture the interactions between connectives during the proof-search. As BI is conservative wrt intuitionistic logic and multiplicative intuitionistic linear logic, we deduce, by some restrictions, new connection-based characterizations and methods for both logics.
Not file

Dates and versions

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


  • HAL Id : inria-00100790 , version 1


Didier Galmiche, Daniel Méry. Connection-based proof search in propositional BI logic. 18th International Conference on Automated Deduction - CADE-18, 2002, Copenhagen/Denmark, pp.111-128. ⟨inria-00100790⟩
64 View
0 Download


Gmail Facebook Twitter LinkedIn More