Proof-search and countermodel generation in propositional BI logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2215, Issue , 2001, Pages 263-282

  Galmiche, Didier ^a   Méry, Daniel ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER SOFTWARE; LOGIC PROGRAMMING; SEMANTICS;

CONSTRUCTION PROCEDURES; COUNTER-MODELS; FINITE MODEL PROPERTY; INTUITIONISTIC LINEAR LOGIC; INTUITIONISTIC LOGIC; LABELLED TABLEAUX; NON-REDUNDANT; PROOF SEARCH;

COMPUTER CIRCUITS;

EID: 84978974862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_13     Document Type: Conference Paper

References (15)

1. P. A. Armelin and D. Pym. Bunched logic programming (extended abstract). In First International Joint Conference on Automated Reasoning, IJCAR 2001, LNCS 2083, pages 289-304, Siena, Italy, 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. M. D'Agostino and D. M. Gabbay. A Generalization of Analytic Deduction via Labelled Deductive Systems. Part I: Basic substructural logics. Journal of Automated Reasoning, 13: 243-281, 1994.
4. D. Galmiche. Connection Methods in Linear Logic and Proof nets Construction. Theoretical Computer Science, 232(1-2): 231-272, 2000.
5. D. Galmiche and D. Larchey-Wendling. Structural sharing and efficient proofsearch in propositional intuitionistic logic. In Asian Computing Science Conference, ASIAN'99, LNCS 1742, pages 101-112, Phuket, Thailand, December 1999.
6. D. Galmiche and J. M. Notin. Proof-search and proof nets in mixed linear logic. Electronic Notes in Theoretical Computer Science, 37, 2000.
7. J. Y. Girard. Linear logic: its syntax and semantics. In J. Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 1-42. Cambridge University Press, 1995.
8. S. Ishtiaq and P. O'Hearn. Bi as an assertion language for mutable data structures. In 28th ACM Symposium on Principles of Programming Languages, POPL 2001, pages 14-26, London, UK, 2001.
9. H. Mantel and J. Otten. linTAP: A tableau prover for linear logic. In Int. Conference TABLEAUX'99, LNCS 1617, pages 216-231, Saratoga Springs, NY, USA, 1999.
10. R. K. Meyer, M. A. McRobbie, and N. Belnap. Linear analytic tableaux. In Theorem proving with analytic tableaux and related methods, TABLEAUX'95, LNCS 918, pages 278-293, St Goar am Rhein, Germany, 1995.
11. P. O'Hearn. Resource interpretations, bunched implications and the αλ-calculus. In Typed Lambda Calculi and Applications, TLCA'99, LNCS 581, pages 258-279, L'Aquila, Italy, 1999.
12. P. W. O'Hearn and D. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2): 215-244, 1999.
13. D. Pym. On bunched predicate logic. In 14h Symposium on Logic in Computer Science, pages 183-192, Trento, Italy, July 1999. IEEE Computer Society Press.
14. K. Terui. Labelled tableau calculi generating simple models for substructural logics. Technical report, ILLC publications, University of Amsterdam, 1999.
15. A. Urquhart. Semantics for relevant logic. Journal of Symbolic Logic, 37: 159-169, 1972.