Citations: Ecient resource management for linear logic proof search - Cervesato, Hodas, Pfenning (ResearchIndex)

14 citations found. Retrieving documents...

I. Cervesato, J. Hodas, and F. Pfenning. Ecient resource management for linear logic proof search. In R. Dyckho and Peter Schroeder-Heister, editors, Fifth Intl. Workshop on Extensions of Logic Programming, pages 67-81, 1996.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of (Correct)

....rule for 0 . Unrestricted Implication. If the focus formula is an unrestricted implication A 1 A 2 we have to solve A 1 as a subgoal, but with access to any of the linear resources. A 1 A 2 P n A 1 Here we should think of as a single binary connective, a point overlooked in [CHP00]. The reason is that it should be statically obvious when solving G in a proposition A 1 that A 1 cannot consume any resources remaining from G. The new connective is characterized by the following right rule. G ; A A For the left rule (which is not needed here) see ....

Iliano Cervesato, Joshua S. Hodas, and Frank Pfenning. Ecient resource management for linear logic proof search. Theoretical Computer Science, 232(1-2):133-163, February 2000. Special issue on Proof Search in Type-Theoretic Languages, D. Galmiche and D. Pym, editors.

Linear Logic Programming for AI Planning - Küngas (2002) (Correct)

....graph is generated on the y and no state is examined twice. 3.7 Logical properties of reachability analysis When attempting to nd a proof of P G G 2 ; G, in [62] the technique of passing the unused resources from one conjunct to another is used. A similar approach has been applied in [35, 39, 17] and as stated in [35] can be used as memory mechanism. While analysing the reachability of a particular Petri net marking (a program goal) the programming context is represented by a Petri net marking. It turns out that the same technique of passing unused resources from one goal to another ....

I. Cervesato, J. S. Hodas, F. Pfenning. Ecient resource management for linear logic proof search. Theoretical Computer Science, Vol. 232, No. 1-2, pp. 133-163, 2000.

linTAP: A Tableau Prover for Linear Logic - Mantel, Otten (1999) (5 citations) (Correct)

....generic. They can be duplicated using the contraction rule c and are removed by the weakening rule w. When the rule is applied the context of the sequent must be split, i.e. 1 and 2 must be a partition of the context. Several solutions have been proposed in order to optimize these choices [1,10,23,6,13]. Additional diculties arise from the rules axiom , and . The rules axiom and require an empty context which expresses that all formulas must be used up in a proof. The rule requires that all formulas in the context are of type . The careful handling of the context re ects the resource ....

I. Cervesato, J.S. Hodas, F. Pfenning. Ecient resource management for linear logic proof search. In Extensions of Logic Programming, LNAI 1050, pages 67-81. Springer, 1996.

A General Procedure to Test Containment of Conjunctive.. - Penabad, Brisaboa.. (2001) (Correct)

....such as the redundancy of integrity constraints, which involves a generalization of the concept of query containment with regard to database integrity. Also, it should be interesting to target an extension of QCC to other collection types, e.g. the resource oriented collections of Linear Logic [5], or the location and communication aware containers of the XML based semi structured data description language of RDF [1] ....

Iliano Cervesato, Joshua S. Hodas, and Frank Pfenning. Ecient resource management for linear logic proof search. ELP '96, 67-81. SpringerVerlag LNAI 1050, 1996.

A Matrix Characterization for MELL - Mantel, Kreitz (1998) (1 citation) (Correct)

....formula must be chosen. Unless the principal formula has type , this choice determines which rule must be applied. If a rule is applied the context of the sequent must be partitioned onto the premises (context splitting) Several solutions have been proposed in order to optimize these choices [1,10,23,6,13]. Additional diculties arise from the rules axiom , and . The rules axiom and require an empty context which expresses that all formulas must be used up in a proof. The rule requires that all formulas in the context are of type . Though the connectives of linear logic make proof search ....

I. Cervesato, J.S. Hodas, F. Pfenning. Ecient resource management for linear logic proof search. In Extensions of Logic Programming, LNAI 1050, pages 67-81. Springer, 1996.

Labelled Deduction in the Composition of Form and Meaning - Moortgat (Correct)

....the problem of spurious non determinism in rule application order characteristic for naive sequent proof search. But this problem can be tackled by adding procedural control , as shown in the categorial literature by [K onig 91, Hepple 90, Hendriks 93] and by [Hodas Miller 94, Andreoli 92, Cervesato e.a.] among others, in the context of linear re nements of Logic Programming. 3.2 Labelled Proof Nets In this section, we consider labelled versions of the proof nets of Linear Logic as an optimalization of sequent proof search. Proof nets can be decorated with Curry Howard term labelling in ....

Iliano Cervesato, Joshua S. Hodas and Frank Pfenning. Ecient resource management for Linear Logic proof search. In Proceedings International Workshop on Extensions of Logic Programming, Leipzig, 1996.

Efficient Resource Management for Linear Logic Proof Search - Cervesato, Hodas, Pfenning (2000) (18 citations) Self-citation (Cervesato Hodas Pfenning) (Correct)

.... Miller [10] Here, solving a subgoal consumes some resources and passes the remaining ones on to other subgoals. 3. Additive truth, requires slack resources introduced in [9] which need not be consumed. 4. Additive conjunction, A B, requires strict resources rst proposed by the authors in [3]. Strict resources are those which must be consumed during the solution of a goal and may not be passed on to other subgoals. In this paper, which is a signi cantly revised and extended version of [3] we exhibit the relationship between these interacting features and prove that the system which ....

....consumed. 4. Additive conjunction, A B, requires strict resources rst proposed by the authors in [3] Strict resources are those which must be consumed during the solution of a goal and may not be passed on to other subgoals. In this paper, which is a signi cantly revised and extended version of [3], we exhibit the relationship between these interacting features and prove that the system which combines all of them is sound and complete with respect to provability in intuitionistic linear logic. We proceed in the order above, each time showing that the new system is sound and complete with ....

Iliano Cervesato, Joshua S. Hodas, and Frank Pfenning. Ecient resource management for linear logic proof search. In R. Dyckho, H. Herre, and P. Schroeder-Heister, editors, Proceedings of the Fifth International Workshop on Extensions of Logic Programming | ELP'96, pages 67-81, Leipzig, Germany, 28-30 March 1996. Springer-Verlag LNAI 1050.

A Model for Declarative Programming and Specification with.. - Caires (1999) (Correct)

No context found.

I. Cervesato, J. Hodas, and F. Pfenning. Ecient resource management for linear logic proof search. In R. Dyckho and Peter Schroeder-Heister, editors, Fifth Intl. Workshop on Extensions of Logic Programming, pages 67-81, 1996.

An Overview of Linear Logic Programming - Dale Miller Inria (Correct)

No context found.

Iliano Cervesato, Joshua Hodas, and Frank Pfenning. Ecient resource management for linear logic proof search. In Roy Dyckho, Heinrich Herre, and Peter Schroeder-Heister, editors, Proceedings of the 1996 Workshop on Extensions to Logic Programming, pages 28-30, Leipzig, Germany, March 1996. Springer-Verlag LNAI.

Unknown - Linear Logic Programming (Correct)

Unknown - Linear Type Theory (Correct)

Unknown - Linear Calculus In (Correct)

Linear Type Checking - The Typing Rules (Correct)

Termination - As The Example (Correct)

No context found.

Iliano Cervesato, Joshua S. Hodas, and Frank Pfenning. Ecient resource management for linear logic proof search. Theoretical Computer Science, 232(1-2):133-163, February 2000. Special issue on Proof Search in Type-Theoretic Languages, D. Galmiche and D. Pym, editors.

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