The inverse method for the logic of bunched implications

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

Volumn 3452 LNAI, Issue , 2005, Pages 466-480

  Donnelly, Kevin ^a   Gibson, Tyler ^b   Krishnaswami, Neel ^c   Magill, Stephen ^c   Park, Sungwoo ^c  

^a BOSTON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); FORMAL LOGIC;

MULTIPLICATIVE LINEAR CONJUNCTION; SUBFORMULA PROPERTY; THE LOGIC OF BUNCHED IMPLICATIONS (BI);

THEOREM PROVING;

EID: 26844522110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_31     Document Type: Conference Paper

References (18)

1. Jean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):197-347, 1992.
2. Pablo Armelín. Logic programming with bunched logic. PhD thesis, University of London, 2002.
3. Pablo A. Armelín and David J. Pym. Bunched logic programming. In IJCAR '01: Proceedings of the First International Joint Conference on Automated Reasoning, pages 289-304. Springer-Verlag, 2001.
4. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, chapter 2, pages 19-100. North Holland, 2001.
5. Frederic Beal, Daniel Méry, and Didier Galmiche. Bill: A theorem prover for prepositional bi logic.
6. Kaustuv Chaudhuri and Frank Pfenning. Resource management for the inverse method in linear logic. Carnegie Mellon University, Unpublished Maniscript, January 2003.
7. Anatoli Degtyarev and Andrei Voronkov. The inverse method. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, pages 179-272. Elsevier Science and MIT Press, 2001.
8. Didier Galmiche, Daniel M, and David J. Pym. Resource tableaux. In CSL '02: Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic, pages 183-199. Springer-Verlag, 2002.
9. Didier Galmiche and Daniel Méry. Semantic labelled tableaux for prepositional bi (without bottom). Journal of Logic and Computation, 13(5), October 2003.
10. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
11. James Harland and David Pym. Resource-distribution via boolean constraints. ACM Trans. Comput. Logic, 4(1):56-90, 2003.
12. S. Maslov. The inverse method of establishing deducibility in classical predicate calculus. Soviet Mathematical Doklady, 5:1420-1424, 1964.
13. P.W. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, June 1999.
14. Frank Pfenning. The inverse method. Carnegie Mellon University, Lecture Notes, Ch. 5, February 2004.
15. D.J. Pym. The Semantics and Proof Theory of the Logic of the Logic of Bunched Implications, volume 26 of Applied Logic Series. Kluwer Academic Publishers, 2002. Errata and Remarks maintained at: http://www.cs.bath.ac.uk/ ~pym/BI- monograph-errata.pdf.
16. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 55-74. IEEE Computer Society, 2002.
17. T. Tammet. Proof strategies in linear logic. Journal of Automated Reasoning, 12(3):273-304, 1994.
18. Tanel Tammet. A resolution theorem prover for intuitionistic logic. In M. A. McRobbie and J. K. Slaney, editors, Proceedings 13th Intl. Conf. on Automated Deduction, CADE'96, New Brunswick, NJ, USA, 30 July - 3 Aug 1996, volume 1104, pages 2-16. Springer-Verlag, Berlin, 1996.