P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Electronic Notes in Theoretical Computer Science 30 No. 3 (2003) - Url Http Www (Correct)
....of sequents is infinite, because the idempotent laws do not hold for multiplicative conjunction (# ) and multiplicative disjunction (#) that is, the sequent B, B is not equivalent to A B. Therefore, proof search of linear logic is undecidable in general, even for propositional fragment [13]. Therefore, in order to develop abstract proof search in linear logic, we need to map the sequents into finite sets. Of course, the provability is not equivalent between the original sequent and the mapped sequent. However, our concern is to statically detect the unprovability of the sequents, ....
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
Resource-Conscious AI Planning with Conjunctions and Disjunctions - Küngas (2002) (Correct)
....calculus) it is by now the most investigated one. Since its introduction LL has enjoyed increasing attention both from proof theorists and computer scientists. Therefore, because of its maturity, LL is useful as formal representation of planning system kernel. Good tutorials to LL are [32] and [21]. One of the rst overviews of LL applications is presented in [1] There exist several ecient formal method tools for proving LL sequents [31] From the complete set of LL connectives and operators we are using multiplicative conjunction ( additive disjunction ( and of course ( ....
....nondeterminism in results of actions. The operator means that we can use or generate particular resource as much as we want the resource is somehow unlimited for us. To illustrate the above let us consider the following LL formula, adapted to our set of LL connectives and operators, from [21] (D D D D D) H C F (P I) which encodes a xed price menu in a fastfood restaurant: for 5 dollars (D) you can get an hamburger (H) a coke (C) all the french fries (F ) you can eat plus a pie (P ) or an ice cream (I) depending on availability. To increase the expressiveness of ....
P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
Linear Logic Programming for AI Planning - Küngas (2002) (Correct)
....relevance logic and Lambek calculus) it is by now the most investigated one. Since its introduction LL has enjoyed increasing attention both from proof theorists and computer scientists. Therefore, because of its maturity, LL is useful as a declarative language. Good tutorials to LL are [92] and [64]. One of the rst overviews of LL applications is presented in [1] There exist several ecient formal method tools for proving LL sequents [90] From the complete set of LL connectives and operators we are using here multiplicative conjunction ( additive disjunction ( and of course ( ....
....to represent nondeterminism in an environment. The operator means that we can use or generate particular resource as much as we want the resource is somehow unlimited for us. To illustrate preceding let us consider following LL formula, adapted to our set of LL connectives and operators, from [64] (D D D D D) H C F (P I) which encodes a xed price menu in a fastfood restaurant: for 5 dollars (D) you can get an hamburger (H) a coke (C) all the french fries (F ) you can eat plus a pie (P ) or an ice cream (I) depending on availability. To increase the expressiveness of ....
P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
Typed Concurrent Programs: Specification & Verification - Nagarajan (1998) (1 citation) (Correct)
....Linear Logic is shown in the following section. Further Reading The seminal paper by Girard [55] is a must; other accounts of Linear Logic can be found in Proofs and Types [56] and Troeltrsa s book [126] A few articles which have very elementary introductions to Linear Logic have also appeared [117, 118, 87, 132]. The first term assignment system developed for Classical Linear Logic was proof expressions [1] however we use the term assignment that was presented together with the notion of Linear Realizability Algebras [4, 12] to give a realizability semantics to Classical Linear Logic. We shall not ....
P. Lincoln. Linear logic. ACM SIGACTNotices, 23(2):29-37, Spring 1992. (p30)
A Static Analysis Method for a Classical Linear Logic.. - Kang, Tamura (2000) (Correct)
....is infinite, because the idempotent laws do not hold for multiplicative conjunction (# ) and multiplicative disjunction (#) that is, the sequent A, A # B, B is not equivalent to A # B. Therefore, proof search of linear logic is undecidable in general, even for propositional fragment [13]. Therefore, in order to develop abstract proof search in linear logic, we need to map the sequents into finite sets. Of course, the provability is not equivalent between the original sequent and the mapped sequent. However, our concern is to statically detect the unprovability of the sequents, so ....
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
Resource-Conscious AI Planning with Conjunctions and Disjunctions - Küngas (2002) (Correct)
....calculus) it is by now the most investigated one. Since its introduction LL has enjoyed increasing attention both from proof theorists and computer scientists. Therefore, because of its maturity, LL is useful as formal representation of planning system kernel. Good tutorials to LL are [27] and [17]. One of the rst overviews of LL applications is presented in [1] There exist several ecient formal method tools for proving LL sequents [26] From the complete set of LL connectives and operators we are using multiplicative conjunction ( additive disjunction ( and of course ( ....
....nondeterminism in results of actions. The operator means that we can use or generate particular resource as much as we want the resource is somehow unlimited for us. To illustrate preceding let us consider following LL formula, adapted to our set of LL connectives and operators, from [17] (D D D D D) H C F (P I) which encodes a xed price menu in a fastfood restaurant: for 5 dollars (D) you can get an hamburger (H) a coke (C) all the french fries (F ) you can eat plus a pie (P ) or an ice cream (I) depending on availability. To increase the expressiveness of ....
P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
A Static Analysis of a Classical Linear Logic Programming Language - Kang (Correct)
....is infinite, because the idempotent laws do not hold for multiplicative conjunction (# ) and multiplicative disjunction (#) that is, the sequent A, A # B, B is not equivalent to A # B. Therefore, proof search of linear logic is undecidable in general, even for propositional fragment [30]. Therefore, in order to develop abstract proof search in linear logic, we need to map the sequents into finite sets. Of course, the provability is not equivalent between the original sequent and the mapped sequent. However, our concern is to statically detect the unprovability of the sequents, so ....
....is infinite, because the idempotent laws do not hold for multiplicative 27 conjunction (# ) and multiplicative disjunction (#) that is, the sequent A, A # B, B is not equivalent to A # B. Therefore, proof search of linear logic is undecidable in general, even for propositional fragment [30]. Therefore, in order to develop abstract proof search in linear logic, we need to map the sequents into finite sets. Of course, the provability is not equivalent between the original sequent and the mapped sequent. However, our concern is to statically detect the unprovability of the sequents, so ....
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992. 52
Using Linear Logic Planning to Make Knowledge Bases Reactive - Küngas (2001) (Correct)
....in a environment. Since its introduction linear logic has enjoyed increasing attention both from proof theorists and computer scientists. Therefore linear logic could be useful as a strictly formal representation of planning system kernel. A good tutorial to linear logic is presented in [36] and [19]. One of the rst overviews of linear logic applications is presented in [1] There exist several ecient formal methods tools to prove the correctness of linear logic formulas [35] Linear logic theorem proving has been used by Jacopin [16] as a classical AI planning kernel. As only the ....
....many pieces of resource A we have, if we want to obtain B, we have to expend them all. And C F means that while expending resource C, we get a number of resources F , but we do not know how many if any overall. To illustrate preceding let us consider following linear logic formula modi ed from [19] (D D D D D) H C F (P I) which encodes a xed price menu in some fastfood restaurant: for 5 dollars (D) you can get an hamburger (H) a coke (C) all the french fries (F ) you can eat plus a pie (P ) or an ice cream (I) depending on availability. To increase the expressiveness of ....
P. Lincoln. Linear logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
Unknown - Linear Logic Programming (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
Symbolic Negotiation with Linear Logic - Peep Kungas And (2004) (1 citation) (Correct)
No context found.
P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29--37, Spring 1992.
Termination - As The Example (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
Unknown - Linear Type Theory (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
Unknown - Linear Calculus In (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29--37, Spring 1992.
Unknown - Sequent Calculus In (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
Linear Logic, Partial Deduction and Cooperative Problem Solving - Küngas, Matskin (2003) (Correct)
No context found.
P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
Symbolic Negotiation with Linear Logic - Küngas, Matskin (2004) (Correct)
No context found.
P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
Unknown - Linear Logic Programming (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
Unknown - Linear Type Theory (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
If ; ; =) A + then ; =) A. - If Then Proof (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
Unknown - Linear Calculus In (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
Unknown - Proof Search Linear (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
Linear Type Checking - The Typing Rules (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
Termination - As The Example (Correct)
No context found.
P. Lincoln. Linear logic. ACM SIGACT Notices, 23(2):29-37, Spring 1992.
First 50 documents
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