Connection-Based Proof Search in Propositional BI Logic-Reference-Cited by-同舟云学术

Connection-Based Proof Search in Propositional BI Logic

Published:2002 Issue: Volume: Page:111-128
ISSN:0302-9743
Container-title:Automated Deduction—CADE-18
language:
Short-container-title:

Author:

Galmiche Didier,Méry Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45620-1_8

Reference16 articles.

1. Lect Notes Comput Sci;P.A. Armelin,2001

2. V. Balat and D. Galmiche. Labelled Deduction, volume 17 of Applied Logic Series, chapter Labelled Proof Systems for Intuitionistic Provability. Kluwer Academic Publishers, 2000.

3. W. Bibel. On matrices with connections. Journal of ACM, 28(4):633–645, 1981.

4. K. Broda, M. Finger, and A. Russo. LDS-natural deduction for substructural logics (extended abstract). Logic Journal of the IGPL, 4(3):486–489, 1996.

5. D. Galmiche. Connection Methods in Linear Logic and Proof nets Construction. Theoretical Computer Science, 232(1–2):231–272, 2000.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic;Proceedings of the ACM on Programming Languages;2023-06-06

2. Focused Proof-search in the Logic of Bunched Implications;Lecture Notes in Computer Science;2021

3. Resource Graphs and Countermodels in Resource Logics;Electronic Notes in Theoretical Computer Science;2005-07

4. Characterizing Provability in BI’s Pointer Logic Through Resource Graphs;Logic for Programming, Artificial Intelligence, and Reasoning;2005

5. Extending Separation Logic with Fixpoints and Postponed Substitution;Algebraic Methodology and Software Technology;2004