| Alternate document: Details The Complexity of Local Proof Search in Linear Logic (Extended Abstract) (96) Patrick D. Lincoln, et al. |
Patrick D. Lincoln, John C. Mitchell, Andre Scedrov  Home/Search
Context Related
| upenn.edu/pub/papers/scedro...cade.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: upenn.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Proof search in linear logic is known to be difficult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicative-additive fragment of propositional linear logic, mall, is known to be pspace-complete, and the pure multiplicative fragment, mll, is known to be np-complete. However, this still leaves open the possibility that there might be proof search heuristics (perhaps involving randomization) that often lead to a proof if there is... (Update)
Context of citations to this paper: More
.... [6, 1, 2, 15, 19, 17, 9] Connections between linear logic and probabilistic games considered in complexity theory are investigated in [24, 27, 25]. In particular, linear logic proof search may also be seen as a game. This game, the linear logic proof game, is played on linear...
...Our results have analogs for the np complete extended multiplicative fragment mll where opponent is absent. This is discussed in [24]. 2 Stochastic quantified boolean formulas and games We consider boolean matrices in conjunctive normal form. Prenex boolean formulas are...
Cited by: More
Linear Logic Proof Games and Optimization (Extended Abstract) - Lincoln, al. (Correct)
Optimization Complexity of Linear Logic Proof Games - Lincoln, Mitchell, Scedrov (Correct)
Similar documents (at the sentence level):
22.6%: Linear Logic Proof Games And Optimization - Lincoln, Mitchell, Scedrov (1996) (Correct)
Active bibliography (related documents): More All
0.2: Employing Random Elements for Probabilistic Reasoning - Angelopoulos (1997) (Correct)
0.2: Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000) (Correct)
0.1: Random Debaters and the Hardness of Approximating.. - Condon, Feigenbaum.. (1994) (Correct)
Similar documents based on text: More All
0.6: The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont Laboratoire (1996) (Correct)
0.3: Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (Correct)
0.2: Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995) (Correct)
Related documents from co-citation: More All
2: Stochastic interaction and Linear Logic (context) - Lincoln, Mitchell et al. - 1995
2: Linear logic : its syntax and semantics - Girard - 1995
2: Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
BibTeX entry: (Update)
P.D. Lincoln, J.C. Mitchell, and A. Scedrov. The complexity of local proof search in linear logic. Extended abstract. In Proceedings Linear Logic '96, Tokyo Meeting, page http://www.elsevier.nl:80/mcs/tcs/pc/Menu.html. Electronic Notes in Theoretical Computer Science, Volume 3, 1996. http://citeseer.ist.psu.edu/lincoln96complexity.html More
@article{ lincoln98complexity,
author = "P. D. Lincoln and J. C. Mitchell and A. Scedrov",
title = "The complexity of local proof search in linear logic",
journal = "Theoretical Computer Science",
volume = "197",
number = "1--2",
pages = "245--??",
year = "1998",
url = "citeseer.ist.psu.edu/lincoln96complexity.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
951 Computational Complexity (context) - Papadimitriou - 1994
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
144 Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
88 Linear logic: its syntax and semantics - Girard - 1995
87 Arthur-Merlin games: a randomized proof system (context) - Babai, Moran - 1988
63 A brief guide to linear logic - Scedrov - 1993
49 Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
37 dialogue games and PCF (context) - Hyland, Ong - 1995
35 Game semantics and abstract machines (context) - Danos, Herbelin et al. - 1996
34 Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler - 1994
33 Probabilistic checking of proofs; A new characterization of .. (context) - Arora, Safra - 1992
30 Games semantics for full propositional linear logic (context) - Lamarche - 1995
25 NP-complete problems have a version that's hard to approxima.. (context) - Zuckerman - 1993
19 The complexity of Horn fragments of linear logic (context) - Kanovich - 1994
19 Random debaters and the hardness of approximating stochastic.. - Condon, Feigenbaum et al. - 1994
15 Generalized CNF satisfiability problems and non-efficient ap.. (context) - Marathe, Stearns - 1994
14 Stochastic interaction and linear logic (context) - Lincoln, Mitchell et al. - 1995
9 and money games (context) - Joyal, communication - 1995
6 Linear logic proof games and optimization - Lincoln, Mitchell et al. - 1996
4 Available by anonymous ftp from ftp (context) - Lincoln, Mitchell et al. - 1996
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cis.upenn.edu.html): More
User-Controlled Physics-Based Animation for Articulated.. - Kokkevis, Metaxas, Badler (1996) (Correct)
Semistructured Data - Buneman (1997) (Correct)
A Hybrid Approach to Formal Verification Applied to an ATM.. - Clarke, Lee (1996) (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