Patrick D. Lincoln, John C. Mitchell, Andre Scedrov  Home/Search
Context Related
| upenn.edu/pub/papers/...approxTCS.ps.gz stanford.edu/pub/j...lmsoptlintcs.ps upenn.edu/pub/papers/...approxTCS.ps.gz 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/~scedro...recent_papers (more) From: stanford.edu/people...pubsselect (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the np-complete multiplicative fragment (mll) extended with additive constants and the pspace-complete multiplicative, additive fragment (mall) of propositional linear logic. In each case, it is shown that it is as hard to compute an approximation of the best possible score as it is to... (Update)
Context of citations to this paper: More
.... results from the domains of modal logic and system specification and analysis are given, respectively, by Lincoln et al. [13] and by Marathe et al. 15] Documenta Mathematica Delta Extra Volume ICM 1998 Delta 1 1000 6 Feigenbaum 4.2 Reductions from RPCD(0,...
.... the locks and keys technique [20] which has yielded faithful representations of various computational paradigms in linear logic [19, 20, 21]; third, they are a crucial device for bridging the gap with the multiset rewriting speci cation of a protocol [5] Were these...
Cited by: More
Interpreting Strands in Linear Logic - Cervesato, Durgin, Kanovich.. (2000) (Correct)
Games, Complexity Classes, and Approximation Algorithms - Feigenbaum (1998) (Correct)
Similar documents (at the sentence level):
26.8%: Linear Logic Proof Games and Optimization (Extended Abstract) - Lincoln, al. (Correct)
17.6%: The Complexity of Local Proof Search in Linear Logic - Lincoln, Mitchell, Scedrov (1996) (Correct)
15.0%: 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.2: On Transformations of Random Vectors - Fessler (1998) (Correct)
Similar documents based on text: More All
0.6: The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont Laboratoire (1996) (Correct)
0.2: Provability in TBLL: A Decision Procedure - Chirimar, Lipton (1993) (Correct)
0.2: Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (Correct)
Related documents from co-citation: More All
3: Strand Spaces: Why is a Security Protocol Correct (context) - Fabrega, Herzog et al. - 1998
3: Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
3: Linearizing intuitionistic implication - Lincoln, Scedrov et al. - 1993
BibTeX entry: (Update)
P. Lincoln, J. Mitchell, and A. Scedrov, "Optimization Complexity of Linear Logic Proof Games," to appear in Theoretical Computer Science. http://citeseer.ist.psu.edu/60744.html More
@article{ lincoln99optimization,
author = "Patrick D. Lincoln and John C. Mitchell and Andre Scedrov",
title = "Optimization complexity of linear logic proof games",
journal = "Theoretical Computer Science",
volume = "227",
number = "1--2",
pages = "299--331",
year = "1999",
url = "citeseer.ist.psu.edu/60744.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
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
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
39 On completeness and soundness in interactive proof systems - Furer, Goldreich et al. - 1989
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
21 First order linear logic without modalities is NEXPTIME-hard - Lincoln, Scedrov - 1994
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
16 Computational Aspects of Linear Logic - Lincoln
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 Cambridge University Press (context) - Stirzaker - 1994
4 Available by anonymous ftp from ftp (context) - Lincoln, Mitchell et al. - 1996
2 The complexity of local proof search in linear logic - Lincoln, Mitchell et al. - 1996
Documents on the same site (http://www.cis.upenn.edu/~scedrov/recent_papers.html): More
The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont (1996) (Correct)
Phase Semantics for Light Linear Logic - Kanovich, Okada, Scedrov (1997) (Correct)
A Probabilistic Poly-Time Framework for Protocol Analysis - Lincoln, Mitchell.. (1998) (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