Patrick Lincoln, Andre Scedrov  Home/Search
Context Related
| upenn.edu/pub/papers/scedr...mall1.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: stanford.edu/~iliano/linear...llb (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. 1 Introduction Linear logic, introduced by Girard, is a... (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):
77.8%: First Order Linear Logic without Modalities Is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
64.4%: First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
Active bibliography (related documents): More All
0.3: Linear Logic and Computation: A Survey - Scedrov (1993) (Correct)
0.2: A Brief Guide to Linear Logic - Scedrov (1993) (Correct)
0.2: Deciding Provability of Linear Logic Formulas - Lincoln (1994) (Correct)
Similar documents based on text: More All
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)
0.2: Seminar on Linear Logic and Application - Suggested Topics - Pfenning, al. (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 ACM
951 Computational Complexity (context) - Papadimitriou - 1994 ACM
344 concurrent constraint programming (context) - Saraswat, Lincoln et al. - 1993 ACM DBLP
223 Linear objects: Logical processes with built-in inheritance - Andreoli, Pareschi - 1991 ACM
96 Decision problems for propositional linear logic - Lincoln, Mitchell et al. - 1992
63 A brief guide to linear logic - Scedrov - 1993 DBLP
53 Center for the Study of Language and Information (context) - Troelstra, Linear et al. - 1992
39 Horn programming in linear logic is NP-complete (context) - Kanovich - 1992 DBLP
34 Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler - 1992 ACM DBLP
32 Classifying the computational complexity of problems (context) - Stockmeyer - 1987 DBLP
32 Proof search in the intuitionistic sequent calculus - Shankar - 1992 ACM DBLP
26 Proof search in first order linear logic and other cut free .. - Lincoln, Shankar - 1994
20 Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992 DBLP
19 Linearizing intuitionistic implication - Lincoln, Scedrov et al. - 1993 DBLP
18 Alternation and the computational complexity of logic progra.. (context) - Shapiro - 1984 ACM DBLP
16 Computational Aspects of Linear Logic - Lincoln - 1992 ACM
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/~iliano/linearbib/llb.html): More
The Undecidability Of Second Order Linear Logic Without.. - Lafont (1995) (Correct)
The Finite Model Property For Various Fragments Of Linear Logic - Lafont (1997) (Correct)
Linear Continuations - Filinski (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