Resource Graphs and Countermodels in Resource Logics - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Theoretical Computer Science Année : 2005

Resource Graphs and Countermodels in Resource Logics

Didier Galmiche
Daniel Mery

Résumé

In this paper we emphasize the role of a semantic structure called resource 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 for capturing the particular interactions between different kinds of connectives (additives and multiplicatives in BI, commutatives and non-commutatives in NL) that occur during proof-search and is also well-suited for providing countermodels in case of non-provability. We illustrate the key points with a tableau method with labels and constraints for BI and then present tools, namely BILL and CheckBI, which are respectively dedicated to countermodel generation and verification in this logic.
Fichier non déposé

Dates et versions

hal-00013783 , version 1 (12-11-2005)

Identifiants

  • HAL Id : hal-00013783 , version 1

Citer

Didier Galmiche, Daniel Mery. Resource Graphs and Countermodels in Resource Logics. Electronic Notes in Theoretical Computer Science, 2005, 125, pp.117-135. ⟨hal-00013783⟩
82 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More