D. Galmiche, G. Perrier  Home/Search
Context Related
| loria.fr/~galmiche/lfcs94.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: loria.fr/~galmiche/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for top-down, bottom-up and mixed proof search procedures with a systematic formalization of strategies construction using the notions of immediate or chaining composition or decomposition, deduced from permutability properties and inference movements in a proof. Thus, we have logical bases... (Update)
Context of citations to this paper: More
.... logic (concurrent) programming [3, 13, 18] Here, we can use a specialization of our results on proof search in fragments of LL [10, 9, 11] dedicated to F ILL. 4 On dynamics and proof search in FILL It is well known that Linear Logic provides us with natural encodings of based...
...to exploit some propositional permutabilities. These optimizations are similar to those proposed by Andreoli [1] Galmiche and Perrier [4], Hodas and Miller [7] and Tammet [16] The combination of LLV with optimizations based on propositional permutabilities is a delicate...
Cited by: More
Efficient Resource Management for Linear Logic Proof Search - Cervesato, Hodas, Pfenning (1997) (Correct)
A Focusing Inverse Method Theorem Prover for First-Order.. - Chaudhuri, Pfenning (2005) (Correct)
Proof Search in First-order Linear Logic and Other Cut-free.. - Lincoln, Shankar (1994) (Correct)
Similar documents (at the sentence level):
77.7%: Foundations of Proof Search Strategies Design in Linear Logic - Galmiche, Perrier (1994) (Correct)
Active bibliography (related documents): More All
0.4: Proof Strategies in Linear Logic - Tammet (1994) (Correct)
0.3: On Proof Normalization in Linear Logic - Galmiche, Perrier (1994) (Correct)
0.3: Deciding Provability of Linear Logic Formulas - Lincoln (1994) (Correct)
Similar documents based on text: More All
0.2: Corrigendum to Galmiche's and Perrier's "On Proof Normalization.. - Perrier (Correct)
0.2: Labelled Deduction - Basin, D'Agostino, Gabbay, Matthews, .. (2000) (Correct)
0.2: Concurrent Programming as Proof Net Construction - Perrier (1997) (Correct)
Related documents from co-citation: More All
15: Theoretical Computer Science (context) - Girard - 1987
13: Logic programming in a fragment of intuitionistic linear logic - Hodas, Miller - 1994
12: Logic programming with focusing proofs in linear logic - Andreoli - 1992
BibTeX entry: (Update)
Didier Galmiche and Guy Perrier. Foundations of proof search strategies design in linear logic. In Symposium on Logical Foundations of Computer Science, pages 101--113, St. Petersburg, Russia, 1994. Springer-Verlag LNCS 813. Also available as Technical Report CRIN 94-R-112 from the Centre di Recherche en Informatique de Nancy. http://citeseer.ist.psu.edu/galmiche94foundation.html More
@inproceedings{ galmiche94foundations,
author = "D. Galmiche and G. Perrier",
title = "Foundations of Proof Search Strategies Design in Linear Logic",
booktitle = "Logical Foundations of Computer Science ({LFCS}'94)",
number = "813",
address = "St.~Petersburg, Russia",
editor = "A. Nerode and Yu.V. Matiyasevich",
pages = "101--113",
year = "1994",
url = "citeseer.ist.psu.edu/galmiche94foundation.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1991
233 Computational interpretations of linear logic - Abramsky - 1993
142 Logic programming with focusing proofs in linear logic - Andreoli - 1992
96 Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
49 Acl - a concurrent linear logic programming paradigm - Kobayashi, Yonezawa - 1993
33 From petri nets to linear logic (context) - Meseguer, Marti-Oliet - 1989
32 Proof search in the intuitionistic sequent calculus - Shankar - 1992
19 Proof search strategies in linear logic (context) - Tammet - 1993
17 On resolution in fragments of classical linear logic (context) - Harland, Pym - 1992
13 Proof nets for multiplicative and additive linear logic (context) - Bellin - 1991
10 Automated deduction in additive and multiplicative linear lo.. (context) - Galmiche, Perrier - 1992
4 Provability in tbll: a decision procedure - Chirimar, Lipton - 1991
1 To be published in Theoretical Computer Science (context) - Galmiche, Perrier et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.loria.fr/~galmiche/papers.html): More
SKIL: A System for Programming with Proofs - Galmiche, Hermann (1993) (Correct)
On Proof Normalization in Linear Logic - Galmiche, Perrier (1994) (Correct)
Program Development in Constructive Type Theory - Galmiche (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC