Download:
|
by Patrick D. Lincoln, John C. Mitchell, Andre Scedrov
In Proceedings Linear Logic '96, Tokyo Meeting, page http://www.elsevier.nl:80/mcs/tcs/pc/Menu.html. Electronic Notes in Theoretical Computer Science
http://pigeon.elsevier.nl/mcs/journals/tcs/pc/volume3/lincoln.ps
Add To MetaCart
Abstract:
Proof search in linear logic is known to be difficult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicativeadditive 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 one, or always lead to something close to a proof. One approach to these problems is to study strategies for proof games. A class of linear logic proof games is developed, each with a numeric score that depends on the number of certain preferred axioms used in a complete or partial proof tree. Using recent techniques for proving lower bounds on optimization problems, the complexity of these games is analyzed for the fragment mll extended with additive constants and for the fragment mall. It is shown that no efficient heuristics exist unless there is an unexpected collapse in the complexity hierarchy. 1
Citations
|
1587
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
692
|
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract
– Goldwasser, Micali, et al.
- 1985
|
|
515
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
503
|
Optimization, approximation, and complexity classes
– Papadimitriou, Yannakakis
- 1991
|
|
288
|
Probabilistic checking of proofs: a new characterization of np
– Arora, Safra
- 1998
|
|
238
|
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
– Babai, Moran
- 1988
|
|
232
|
Algebraic methods for interactive proof systems
– Lund, Fortnow, et al.
- 1992
|
|
165
|
Games and full completeness for multiplicative linear logic
– Abramsky, Jagadeesan
- 1994
|
|
126
|
logic, its syntax and semantics
– Linear
- 1995
|
|
98
|
A games semantics for linear logic
– Blass
- 1992
|
|
79
|
Decision problems for propositional linear logic
– Lincoln, Mitchell, et al.
- 1990
|
|
72
|
Full abstraction for PCF (extended abstract
– Abramsky, Jagadeesan, et al.
- 1994
|
|
65
|
A brief guide to linear logic
– Scedrov
- 1993
|
|
38
|
Constant-Only Multiplicative Linear Logic is NP-Complete
– Lincoln, Winkler
- 1994
|
|
37
|
Game semantics and abstract machines
– Danos, Herbelin, et al.
- 1996
|
|
37
|
NP-complete problems have a version that's hard to approximate
– Zuckerman
- 1993
|
|
33
|
Random debaters and the hardness of approximating stochastic functions
– Condon, Feigenbaum, et al.
- 1997
|
|
32
|
Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE-Hard Functions
– Condon, Feigenbaum, et al.
- 1993
|
|
31
|
Games semantics for full propositional linear logic
– Lamarche
- 1995
|
|
17
|
dialogue games and PCF
– Pi-calculus
- 1995
|
|
17
|
The complexity of Horn fragments of linear logic
– Kanovich
- 1994
|
|
16
|
Stochastic interaction and linear logic
– Lincoln, Mitchell, et al.
- 1995
|
|
15
|
Linear logic and computation: A survey
– Scedrov
- 1993
|
|
14
|
Generalized CNF satisfiability problems and non-efficient approximability
– Marathe, Stearns
- 1994
|
|
7
|
lattices, communication, and money games
– Free
- 1995
|
|
6
|
Linear logic proof games and optimization
– Lincoln, Mitchell, et al.
- 1996
|
|
1
|
Linear logic proof games and optimization. Extended abstract
– Lincoln, Mitchell, et al.
- 1996
|
