Patrick Lincoln, Andre Scedrov  Home/Search
Context Related
| sri.com/users/lincol...mall1hard.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: sri.com/users/lincoln/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The decision problem is studied for the nonmodal or multiplicative-additive fragment of first order linear logic. This fragment is shown to be nexptime- hard. The hardness proof combines Shapiro's logic programming simulation of nondeterministic Turing machines with the standard proof of the pspace- hardness of quantified boolean formula validity, utilizing some of the surprisingly powerful and expressive machinery of linear logic. (Update)
Cited by: More
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (Correct)
Decision Problems for Second-Order Linear Logic - Lincoln, Scedrov, Shankar (1995) (Correct)
Similar documents (at the sentence level):
66.8%: First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
Active bibliography (related documents): More All
1.1: First Order Linear Logic without Modalities Is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
0.9: A Brief Guide to Linear Logic - Scedrov (1993) (Correct)
0.5: Linear Logic and Computation: A Survey - Scedrov (1993) (Correct)
Similar documents based on text: More All
0.3: Linearizing Intuitionistic Implication - Lincoln, Scedrov, Shankar (1993) (Correct)
0.3: Seminar on Linear Logic and Application - Suggested Topics - Pfenning, al. (Correct)
0.1: The Complexity of Resource-Bounded First-Order Classical Logic - Goubault (1994) (Correct)
Related documents from co-citation: More All
16: Theoretical Computer Science (context) - Girard - 1987
16: Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
14: Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler - 1992
BibTeX entry: (Update)
P. Lincoln and A. Scedrov. First order linear logic without modalities is NEXPTIME-hard. Theoretical Computer Science, 135:139--154, 1994. http://citeseer.ist.psu.edu/article/lincoln94first.html More
@article{ lincoln94firstorder,
author = "P. Lincoln and A. Scedrov",
title = "First-order linear logic without modalities is {NEXPTIME}-hard",
journal = "Theoretical Computer Science",
volume = "135",
number = "1",
pages = "139--153",
year = "1994",
url = "citeseer.ist.psu.edu/article/lincoln94first.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
982 Theoretical Computer Science (context) - Girard - 1987
344 concurrent constraint programming (context) - Saraswat, Lincoln et al. - 1993
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1991
223 Linear objects: Logical processes with built-in inheritance - Andreoli, Pareschi - 1991
142 Logic programming with focusing proofs in linear logic - Andreoli - 1992
96 Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
75 The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
72 Archive for Mathematical Logic (context) - Danos, Regnier et al. - 1989
69 Geometry of interaction I: Interpretation of system F (context) - Girard - 1989
69 calculus as a theory in linear logic: Preliminary results (context) - Miller - 1992
53 Center for the Study of Language and Information (context) - Troelstra, Linear et al. - 1992
50 New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1992
42 volume 752 of Lecture Notes in Mathematics (context) - Barr, Categories - 1979
42 Linear logic without boxes - Gonthier, Abadi et al. - 1992
39 Horn programming in linear logic is NP-complete (context) - Kanovich - 1992
34 Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler - 1992
32 Proof search in the intuitionistic sequent calculus - Shankar - 1992
32 Classifying the computational complexity of problems (context) - Stockmeyer - 1987
30 Logic programming with sequent systems: a linear logic appro.. (context) - Andreoli, Pareschi - 1990
24 Geometry of interaction II: Deadlock-free algorithms (context) - Girard - 1990
19 Linearizing intuitionistic implication - Lincoln, Scedrov et al. - 1991
18 Alternation and the computational complexity of logic progra.. (context) - Shapiro - 1984
16 Computational Aspects of Linear Logic - Lincoln - 1992
16 Event spaces and their linear logic - Pratt - 1991
11 ese de Doctorat, Universit (context) - Regnier, R'eseaux - 1992
8 Special Volume dedicated to the memory of John Myhill (context) - Blass, semantics et al. - 1992
6 ese de Doctorat, Universit (context) - Danos, Lin'eaire et al. - 1990
5 Degrees of indeterminacy of games (context) - Blass - 1972
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csl.sri.com/users/lincoln/papers/): More
The Formal Verification of an Algorithm for Interactive.. - Lincoln, Rushby (1993) (Correct)
Algorithmic Aspects of Type Inference With Subtypes - Lincoln, Mitchell (1992) (Correct)
Epidemic Profiles and Defense of Scale-Free Networks - Briesemeister, Lincoln, Porras (2003) (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