Automated deduction in additive and multiplicative linear logic

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

Volumn 620 LNCS, Issue , 1992, Pages 151-162

  Galmiche, Didier ^a   Perrier, Guy ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ALGEBRA; LOGIC PROGRAMMING; THEOREM PROVING;

AUTOMATED DEDUCTION; AUTOMATIC PROOFS; LOGICAL FRAMEWORKS; MULTIPLICATIVE LINEAR LOGIC; OR APPLICATIONS; OR-PARALLELISM; PROGRAMMING LOGIC; PROGRAMMING WITH PROOFS;

COMPUTER CIRCUITS;

EID: 0347540699     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0023870     Document Type: Conference Paper

References (13)

1. S. Abramsky. Computational interpretations of linear logic. technical report, Department of Computing, Imperial College, London SW7 2Bz, England, 1991.
2. J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with built in inheritance. In 7th international conference of logic programming, pages 495–510, Jerusalem, June 1990. MIT Press.
3. G. Bellin. Proof nets for multiplicative and additive linear logic. Technical Report ECS-LFCS 91-161, Department of Computer Science, Edinburgh University, May 1991.
4. S. Cerrito. A linear semantics for allowed logic programs. In 5th IEEE Symposium on Logic in Computer Science, pages 219–227, Philadelphia, June 1990.
5. V. Danos and L. Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 28:181–203, 1989.
6. D. Galmiche. The power of constructive framework for program synthesis. In COLOG 88 — International Conference on Computer Logic, Tallinn, Estonia, USSR, December 1988.
7. D. Galmiche. Constructive system for automatic program synthesis. Theoretical Computer Science, 71(2):227–239, 1990.
8. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1): 1–102,1987.
9. J.-Y. Girard. Towards a geometry of interaction. In J.-W. Gray and A. Scedrov, editors, AMS Conference on categories in computer science and logic, pages 69–108, Boulder-Colorado, June 1987.
10. J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. In 6th IEEE symposium Logic in Computer Science, pages 32–42, Amsterdam, July 1991.
11. J. Vauzeilles, M. Masseron, C. Tollu. Generating plans in linear logic. In Foundations of Software Technology and Theoretical Computer Science, LNCS 472, pages 63–65, Bangalore, India, December 1990.
12. A. Scedrov, P. Lincoln, J. Mitchell and N. Shankar. Decision problems for propositional linear logic. In 31st annual IEEE Symp. on Foundations of Computer Science, St-Louis, Missouri, October 1990.
13. U. Solitro. A typed calculus based on a fragment of linear logic. Theoretical Computer Science, 68:333–342,1989.