Resource Graphs and Countermodels in Resource Logics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Resource Graphs and Countermodels in Resource Logics

Didier Galmiche
Daniel Méry


In this abstract we emphasize the role of a semantic structure called dependency graph in order to study the provability in some resource-sensitive logics, like the Bunched Implications Logic (BI) or the Non-commutative Logic (NL). Such a semantic structure is appropriate to capture the particular interactions between different kinds of connectives (additives and multiplicatives in BI and commutatives and non-commutatives in NL) during proof-search and mainly to provide countermodels in case of non-provability. We illustrate the key points with a tableau method for BI logic and present tools, namely BILL and CheckBI, dedicated for respectively countermodel generation and verification in this logic.
Not file

Dates and versions

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


  • HAL Id : inria-00100048 , version 1


Didier Galmiche, Daniel Méry. Resource Graphs and Countermodels in Resource Logics. IJCAR 2004 Workshop W1 on Disproving - Non-Theorems, Non-validity, Non-Provability, 2004, Cork/Ireland. ⟨inria-00100048⟩
64 View
0 Download


Gmail Facebook Twitter LinkedIn More