Resource Graphs and Countermodels in Resource Logics | Zendy

Didier Galmiche | Zendy; Daniel Méry | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Resource Graphs and Countermodels in Resource Logics

Author(s) -

Didier Galmiche,

Daniel Méry

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.06.069

Subject(s) - computer science , resource (disambiguation) , commutative property , theoretical computer science , graph , key (lock) , description logic , mathematics , discrete mathematics , computer network , computer security

In this abstract 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research