Connection methods in linear logic and proof nets construction

Theoretical Computer Science

Volumn 232, Issue 1-2, 2000, Pages 231-272

  Galmiche, D ^a  

^a LORIA   (France)

Author keywords

Automated deduction; Connection methods; Linear logic; Proof nets

Indexed keywords

EID: 0345425445     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00176-0     Document Type: Article

References (48)

1. V.M. Abrusci, Noncommutative proof nets, in: J.Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995. pp. 271-296.
2. V. Alexiev, Applications of linear logic to computation: an overview, Logic J. IGPL 2(1) (1994) 77-107.
3. J.M. Andreoli, Logic programming with focusing proofs in linear logic, J. Logic Comput. 2(3) (1992) 297-347.
4. P. Andrews, Theorem proving via general mating, J. Assoc. Comput. Mach. 28(2) (1981) 193-214.
5. A. Asperti, G. Dore, Yet another correctness criterion for multiplicative linear logic with mix, Logic at St. Petersburg '94, Symp. on Logical Foundations of Computer Science, St. Petersburg, Russia, July 1994, Lecture Notes in Computer Science, vol. 813, Springer, Berlin, pp. 34-46.
6. R. Banach, Sequent reconstruction in LLM - a sweepline proof, Ann. Pure Appl. Logic 73 (1995) 277-295.
7. G. Bellin, Proof nets for multiplicative and additive linear logic, Technical Report ECS-LFCS 91-161, Department of Computer Science, Edinburgh University, May 1991.
8. G. Bellin, J. Ketonen, A decision procedure revisited: Notes on direct logic, linear logic and its implementation, Theoret. Comput. Sci. 95 (1992) 115-142.
9. W. Bibel, On matrices with connections, J. Assoc. Comput. Mach. 28(4) (1981) 633-645.
10. W. Bibel, A deductive solution for plan generation, New Generation Comput. 4 (1986) 115-132.
11. V. Danos, L. Regnier, The structures of multiplicatives, Arch. Math. Logic 28 (1986) 181-203.
12. G.V Davydov, S. Yu. Maslov, G.E. Mints, V.P. Orevkov, A.O. Slisenko, A computer algorithm for the determination of deducibility on the basis of the inverse method, in: J. Siekmann, G. Wrightson (Eds.), Automation of Reasoning (Classical papers on Computational Logic), vol. 2, Springer, Verlag, 1983, pp. 531-541.
13. R. Dyckhoff, Contraction-free sequent calculi for intuitionistic logic, J. Symbolic Logic 57 (1992) 795-807.
14. J.C. Filliâtre, A decision procedure for direct predicate calculus-study and implementation in the Coq system, Research report 96-25, LIP - Ecole Normale Supérieure de Lyon, 1995.
15. B. Fronhöfer, The Action-as-implication Paradigm, CS Press, München, 1996.
16. D. Galmiche, Proof search methods in linear logic, Workshop on Theorem Proving with Analytic Tableaux and related Methods, Marseille, April 1993.
17. D. Galmiche, Connection methods and proof nets construction in linear logic fragments (abstract), CADE-13 Workshop on Proof Search in Type-Theoretic Languages, New Brunswick, NJ, USA, July 1996.
18. D. Galmiche, J.Y. Marion, Improving management of additives for efficient proof search, Unpublished Draft, November 1995.
19. D. Galmiche, J.Y. Marion, Semantic proof search methods for ALL - a first approach, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, St. Goar am Rhein, Germany, May 1995.
20. D. Galmiche, B. Martin, Automated proof nets construction in multiplicative and additive linear logic, Technical report, CRIN-CNRS, 1997.
21. D. Galmiche, B. Martin, Proof search and proof nets construction in linear logic, 4th Workshop on Logic, Language, Information and Computation, Wollic'97, Fortaleza, Brasil, Logic J. IGPL 5-6 (1997) 883-885.
22. D. Galmiche, B. Martin, Proof nets construction and automated deduction in non-commutative linear logic - extended abstract, CADE Workshop on Proof Search in Type-Theoretic Languages, Lindau, Germany, July 1998, Electron. Notes Theoret. Comput. Sci. 17 (1998) 51-66.
23. D. Galmiche, G. Perrier, Automated deduction in additive and multiplicative linear logic, Logic at Tver '92, Logical Foundations of Computer Science Symposium, Tver, Russia, July 1992, Lecture Notes in Computer Science, vol. 620, Springer, Berlin, pp. 151-162.
24. D. Galmiche, G. Perrier, A procedure for automatic proof nets construction, LPAR'92, Int. Conf. on Logic Programming and Automated Reasoning, St. Petersburg, Russia, July 1992, Lecture Notes in Artificial Intelligence, vol. 624, pp. 42-53.
25. D. Galmiche, G. Perrier, Foundations of proof search strategies design in linear logic, Logic at St. Petersburg '94, Symposium on Logical Foundations of Computer Science, St. Petersburg, Russia, July 1994, Lecture Notes in Computer Science, vol. 813, Springer, Berlin, pp. 101-113.
26. D. Galmiche, G. Perrier, On proof normalization in linear logic, Theoret. Comput. Sci. 135(1) (1994) 67-110.
27. J.Y. Girard, Linear logic, Theoret. Comput. Sci. 50(1) (1987) 1-102.
28. J.Y. Girard, Geometry of interaction III: accommodating the additives, in: J.Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 329-389.
29. J.Y. Girard, Linear logic: its syntax and semantics, in: J.Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 1-42.
30. J.Y. Girard, Proof nets: the parallel syntax for proof theory, in: A. Ursini, P. Agliano (Eds.), Logic and Algebra, Marcel Dekker, New York, 1995.
31. G. Gonthier, M. Abadi, J.J. Levy, Linear logic without boxes. 7th IEEE Symp. on Logic in Computer Science, Santa-Cruz, CA, June 1992, pp. 223-234.
32. M. Kanovich, Linear logic as a logic of computations, Ann. Pure Appl. Logic 67 (1994) 183-212.
33. J. Ketonen, R. Weyhrauch, A decidable fragment of predicate calculus, Theoret. Comput. Sci. 32 (1984) 297-307.
34. N. Kobayashi, A. Yonezawa, Type-theoretic foundations for concurrent object-oriented programming, ACM SIGPLAN Conf. on Object-Oriented Programming Systems, Languages and Applications, OOPSLA'94, 1994, pp. 31-45.
35. C. Kreitz, H. Mantel, J. Otten, S. Schmitt, Connection-based proof construction in linear logic, 14th Int. Conf. on Automated Deduction, Lecture Notes in Artificial Intelligence, vol 1249, Townsville, North Queensland, Australia, 1997, pp. 207-221.
36. V. Lifschitz, What is the inverse method?, J. Automat. Reason. 5(1) (1989) 1-24.
37. P. Lincoln, J. Mitchell, A. Scedrov, N. Shankar, Decision problems for propositional linear logic, Ann. Pure Appl. Logic 56 (1992) 239-311.
38. P. Lincoln, N. Shankar, Proof search in first-order linear logic and other cut-free sequent calculi, 9th IEEE Symposium on Logic in Computer Science, Paris, France, July 1994, pp. 282-291.
39. J.Y. Marion, Additive linear logic with analytic cut, 3rd Workshop on Logic, Language, Information and Computation, WoLLIC'96, Salvadore, Brazil, May 1996, J IGPL 4(3) (1996) 511-513.
40. D. Miller, Forum: A multiple-conclusion specification logic, Theoret. Comput. Sci. 165(1) (1996) 201-232.
41. G. Mints, Resolution calculus for the first order linear logic, J. Logic, Language Inform. 2 (1993) 59-83.
42. J. Otten, C. Kreitz, A connection based proof method for intuitionistic logic, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, St Goar am Rhein, Germany, Lecture Notes in Artificial Intelligence, vol. 918, Springer, Berlin, 1995, pp. 122-137.
43. H. Schellinx, Some syntactical observations on linear logic, J. Logic Comput. 1(4) (1991) 537-559.
44. S. Schmitt, C. Kreitz, On transforming intuitionistic matrix proofs into standard sequent proofs, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Lecture Notes in Artificial Intelligence, St Goar am Rhein, Germany, vol. 918, Springer, Verlag. Berlin, 1995, pp. 106-121
45. S. Schmitt, C. Kreitz, Converting non-classical matrix proofs into sequent-style systems, 13th Int. Conf. on Automated Deduction, New Brunswick, NJ, USA, Lecture Notes in Artificial Intelligence, vol. 1104, Springer, Berlin, 1996, pp. 418-432.
46. T. Tammet, Proof strategies in linear logic, J. Automat. Reason. 12 (1994) 273-304.
47. A. Voronkov, Proof-search in intuitionistic logic based on constraint satisfaction, 5th Int. Workshop TABLEAUX'96, Lecture Notes in Artificial Intelligence, 1071, Terrasini, Palermo, Italy, May 1996, pp. 312-327.
48. L.A. Wallen, Automated Proof search in Non-Classical Logics, MIT Press, Cambridge, MA, 1990.