Results 1  10
of
53
Decision Problems for Propositional Linear Logic
, 1990
"... Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifierfree) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, ..."
Abstract

Cited by 91 (17 self)
 Add to MetaCart
Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifierfree) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, which indicates unboundedness of resources, the decision problem becomes pspacecomplete. We also establish membership in np for the multiplicative fragment, npcompleteness for the multiplicative fragment extended with unrestricted weakening, and undecidability for certain fragments of noncommutative propositional linear logic. 1 Introduction Linear logic, introduced by Girard [14, 18, 17], is a refinement of classical logic which may be derived from a Gentzenstyle sequent calculus axiomatization of classical logic in three steps. The resulting sequent system Lincoln@CS.Stanford.EDU Department of Computer Science, Stanford University, Stanford, CA 94305, and the Computer Science Labo...
LFG Semantics via Constraints
 University of Utrecht
"... Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Traditionally, meanings are combined via function composition, which works well when consti ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Traditionally, meanings are combined via function composition, which works well when constituent structure trees are used to guide semantic composition.
Applications of Linear Logic to Computation: An Overview
, 1993
"... This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. After a substantial introduction to LL, it discusses the implications of LL to functional programming, logic programming, concurrent and objectoriented programming and some other applications of LL, li ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. After a substantial introduction to LL, it discusses the implications of LL to functional programming, logic programming, concurrent and objectoriented programming and some other applications of LL, like semantics of negation in LP, nonmonotonic issues in AI planning, etc. Although the overview covers pretty much the stateoftheart in this area, by necessity many of the works are only mentioned and referenced, but not discussed in any considerable detail. The paper does not presuppose any previous exposition to LL, and is addressed more to computer scientists (probably with a theoretical inclination) than to logicians. The paper contains over 140 references, of which some 80 are about applications of LL. 1 Linear Logic Linear Logic (LL) was introduced in 1987 by Girard [62]. From the very beginning it was recognized as relevant to issues of computation (especially concurrency and stat...
Programming in Lygon: An Overview
 ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY
, 1996
"... Recently, there has been much interest in the derivation of logic programming languages based on linear logic, a logic of resourceconsumption. Such languages provide a notion of resourceoriented programming, often leading to programs that are more elegant and concise than their equivalents in la ..."
Abstract

Cited by 40 (18 self)
 Add to MetaCart
Recently, there has been much interest in the derivation of logic programming languages based on linear logic, a logic of resourceconsumption. Such languages provide a notion of resourceoriented programming, often leading to programs that are more elegant and concise than their equivalents in languages, such as Prolog, based on classical logics. We discuss, with examples, the design, implementation and applications of Lygon, a linear logic programming language. Lygon is based on a prooftheoretic analysis of which occurrences of the linear connectives provide an adequate basis for programming. In common with other linear logic programming languages, Lygon allows clauses to be used exactly once in a computation, thereby avoiding the need for the explicit resourcecounting often necessary in Prologlike languages. Indeed, it appears that resourcesensitivity leads to significant differences between the natural programming methodologies in Lygon and Prolog. Just as linear logic...
HigherOrder, Linear, Concurrent Constraint Programming
, 1992
"... We present a very simple and powerful framework for indeterminate, asynchronous, higherorder computation based on the formulaasagent and proofascomputation interpretation of (higherorder) linear logic [Gir87]. The framework significantly refines and extends the scope of the concurrent constrai ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
We present a very simple and powerful framework for indeterminate, asynchronous, higherorder computation based on the formulaasagent and proofascomputation interpretation of (higherorder) linear logic [Gir87]. The framework significantly refines and extends the scope of the concurrent constraint programming paradigm [Sar89] in two fundamental ways: (1) by allowing for the consumption of information by agents it permits a direct modelling of (indeterminate) state change in a logical framework, and (2) by admitting simplytyped terms as dataobjects, it permits the construction, transmission and application of (abstractions of) programs at runtime. Much more dramatically, however, the framework can be seen as presenting higherorder (and if desired, constraintenriched) versions of a variety of other asynchronous concurrent systems, including the asynchronous ("input guarded") fragment of the (firstorder) ßcalculus, Hewitt's actors formalism, (abstract forms of) Gelernter's Lin...
Linear Logic
, 1992
"... this paper we will restrict attention to propositional linear logic. The sequent calculus notation, due to Gentzen [10], uses roman letters for propositions, and greek letters for sequences of formulas. A sequent is composed of two sequences of formulas separated by a `, or turnstile symbol. One may ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
this paper we will restrict attention to propositional linear logic. The sequent calculus notation, due to Gentzen [10], uses roman letters for propositions, and greek letters for sequences of formulas. A sequent is composed of two sequences of formulas separated by a `, or turnstile symbol. One may read the sequent \Delta ` \Gamma as asserting that the multiplicative conjunction of the formulas in \Delta together imply the multiplicative disjunction of the formulas in \Gamma. A sequent calculus proof rule consists of a set of hypothesis sequents, displayed above a horizontal line, and a single conclusion sequent, displayed below the line, as below: Hypothesis1 Hypothesis2 Conclusion 4 Connections to Other Logics
Implementing the Linear Logic Programming Language Lygon
 INTERNATIONAL LOGIC PROGRAMMING SYMPOSIUM
, 1995
"... There has been considerable work aimed at enhancing the expressiveness of logic programming languages. To this end logics other than classical first order logic have been considered, including intuitionistic, relevant, temporal, modal and linear logic. Girard's linear logic has formed the basis ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
There has been considerable work aimed at enhancing the expressiveness of logic programming languages. To this end logics other than classical first order logic have been considered, including intuitionistic, relevant, temporal, modal and linear logic. Girard's linear logic has formed the basis of a number of logic programming languages. These languages are successful in enhancing the expressiveness of (pure) Prolog and have been shown to provide natural solutions to problems involving concurrency, natural language processing, database processing and various resource oriented problems. One of the richer linear logic programming languages is Lygon. In this paper we investigate the implementation of Lygon. Two significant problems that arise are the division of resources between subbranches of the proof and the selection of the formula to be decomposed. We present solutions to both of these problems.
Linear Logic and Computation: A Survey
 Proof and Computation, Proceedings Marktoberdorf Summer School
, 1993
"... . This is a survey of computational aspects of linear logic related to proof search. Keywords. Linear logic, cut free proof search, logic programming, complexity. 1 Introduction Linear logic, introduced by Girard [14, 36, 32], is a refinement of classical logic. While the central notions of truth ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
. This is a survey of computational aspects of linear logic related to proof search. Keywords. Linear logic, cut free proof search, logic programming, complexity. 1 Introduction Linear logic, introduced by Girard [14, 36, 32], is a refinement of classical logic. While the central notions of truth (emphasized in classical logic) and proof construction (emphasized in intuitionistic logic) remain important in linear logic, it might be said that the emphasis in linear logic is on state. Linear logic is sometimes described as being resource sensitive because it provides an intrinsic and natural accounting of process states, events, and resources. Linear logic also sheds new light on classical logic and its relationship to intuitionistic logic, see Girard [15, 16] and Danos et al. [11]. An evocative semantic paradigm for linear logic by means of games is proposed by Blass [7] and by Abramsky and Jagadeesan [2]. As an intuitive motivation, let us consider reading logical deductions so tha...
First Order Linear Logic without Modalities Is NEXPTIMEHard
 Theoretical Computer Science
, 1994
"... The decision problem is studied for the nonmodal or multiplicativeadditive 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 p ..."
Abstract

Cited by 15 (11 self)
 Add to MetaCart
The decision problem is studied for the nonmodal or multiplicativeadditive 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 resourcesensitive refinement of classical logic [10, 29]. Linear logic gains its expressive power by restricting the "structural" proof rules of contraction (copying) and weakening (erasing). The contraction rule makes it possible to reuse any stated assumption as often as desired. The weakening rule makes it possible to use dummy assumptions, i.e., it allows a deduction to be carried out without using all of the hypotheses. Because contraction and weakening together make it possible to use an assu...
Specifying RealTime FiniteState Systems in Linear Logic
 In 2nd International Workshop on Constraint Programming for TimeCritical Applications and MultiAgent Systems (COTIC
, 1998
"... Realtime finitestate systems may be specified in linear logic by means of linear implications between conjunctions of fixed finite length. In this setting, where time is treated as a dense linear ordering, safety properties may be expressed as certain provability problems. These provability proble ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Realtime finitestate systems may be specified in linear logic by means of linear implications between conjunctions of fixed finite length. In this setting, where time is treated as a dense linear ordering, safety properties may be expressed as certain provability problems. These provability problems are shown to be in pspace. They are solvable, with some guidance, by finite proof search in concurrent logic programming environments based on linear logic and acting as sort of modelcheckers. One advantage of our approach is that either it provides unsafe runs or it actually establishes safety. 1 Introduction There are a number of formalisms for expressing realtime processes, including [1, 6, 7, 3, 4, 5, 50, 44, 45, 38]. Many of these realtime formalisms are based on temporal logic or its variations [46, 38, 33] or on timed process algebras [14, 42, 43, 23, 12], or on Buchi automata [52, 3]. In some cases exact complexitytheoretic information is available, such as [51, 3, 5], while ...