S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....functional programming) But a similar impact has also been achieved on the side of the computation as proof search paradigm, which gives the background for this paper. Here we find developments such as: logical accounts of the controversial negation as failure inference rule of logic programming [16, 29] and of control aspects of sequential logic programs [32] type and mode inference in logic programs [44] logical encodings of process calculi formalisms [41] declarative reconstructions of concurrent computational models, such as Linda tuple spaces [26] the Chemical Abstract Machine [9] ....

S. Cerrito. A linear semantics for allowed logic programs. In Proc. of the 5th IEEE Symposium on Logic in Computer Science, Philadelphia, Pa, U.S.A., 1990.

.... di#erence between these approaches and our approach is that we do not use proof theory as a foundation of a new logic programming language but instead we use proof theory as a tool for analyzing the old problem of Negation as Failure in classical logic programming, in the sense of [1] and [20] In [4], linear logic is used for this latter task. In our opinion linear logic is not appropriate for analyzing the problem of the semantics of Negation as Failure in classical logic programming, since contraction and weakening are unproblematic in this context. For example, if the goal #, L, L fails ....

S. Cerrito. A linear semantics for allowed logic programs. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, LICS '90, pages 219--227, Philadelphia, 1990.

.... internal logic of Prolog that arises from the use of depthfirst search using a non commutative linear logic [11] Cerrito appplied classical linear logic to the problem of formalizing finite failure for certain kinds of Horn clause programs where negations are permitted in the body of clauses [5]. Linear logic has been used to extend the basic design of logic programming languages in at least two papers other than this one. Andreoli and Pareschi extended Horn clauses so that programs in the resulting language make use of the multiple conclusion nature of full linear logic [2] In that ....

Serenella Cerrito. A linear semantics for allowed logic programs. In John Mitchell, editor, Proceedings of the Fifth Annual Symposium on Logic in Computer Science, Philadelphia, PA, pages 219 -- 227, June 1990.

.... and Pareschi develop a declarative treatment of object communication and concurrent object oriented computation [8, 9, 11, 10] A treatment of linear logic programming is given by Hodas and Miller [59] A role of linear logic in a declarative semantics of SLDNF resolution is considered by Cerrito [32]. An approach that spans both the proof reduction and the proof search paradigms is proposed by Girard [51] Recent topics include a treatment of concurrent constraint programming by Saraswat and Lincoln [86] and a closely related treatment of Milner s calculus of communicating processes by ....

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....by Mancarella et al. 101, 102, 18] Linear Logic is a modification of the classical Gentzen sequent calculus which was developed by Girard [74] to capture reasoning about resources. In particular linear logic is sensitive to how many times a formula is used as hypothesis in a proof. Cerrito [32, 33] showed that linear logic can be used to reason about logic programs by providing a translation of logic programs and program completions to linear logic theories for which soundness and completeness of the SLDNF resolution for allowed programs can be established and for which SLDNF resolution ....

S. Cerrito. A linear semantics for allowed logic programs. In Proceedings of the 5th Symposium on Logic in Computer Science (LICS '90), pages 219--227, Philadelphia, PA., USA, 1991.

....J Y. Girard [28] It can be thought of as a resource conscious logic and has thus recently gained considerable interest from the computer science community. Applications include implementation models for functional languages [34, 47, 63] the study of process algebras [3, 2, 1] logic programming [4, 14, 40], planning in AI [50] and net theory [5, 9, 10, 11, 8, 24, 39, 49] The list is by no means meant to be comprehensive because the field is advancing very rapidly. The applications relevant to our purposes are the applications to net theory. The aim in these studies is twofold. Linear logic is a ....

Cerrito, S. A linear semantics for allowed logic programs. 5th IEEE Symp. on Logic in Computer Science. IEEE Press, 1990.

.... recent work has attempted to find a linear logical basis for many optimizations in (lazy) functional programming language implementations by concentrating on linear logic as a type system [1, 15, 39, 40, 25, 8, 29, 41] Other applications include analyzing the control structure of logic programs [7], generalized logic programming [4, 16] and natural language processing [23] A natural characterization of polynomial time computations can be given in a bounded version of linear logic [13] obtained by limiting reuse to specified bounds, i.e. by bounding the number of references to each datum ....

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

.... (cf [Gir87a, Gir87b, DR89, Laf90] and connection graphs, which were designed to model connection machine computation [Baw86] Other applications include optimization of copying in lazy functional programming language implementation [GH90] and analyzing the control structure of logic programs [Cer90, AP90]. A natural characterization of polynomial time computations can be given in a bounded version of linear logic [GSS90] obtained by limiting reuse to specified bounds, i.e. by bounding the number of references to each datum in memory. Informal introductions to linear logic may be found in [Gir90, ....

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....[LMSS90] The extra expressive power of linear logic has enabled the study of practical problems in implementation of declarative programming languages. For example, Lafont has eliminated garbage collection in functional languages [Laf88] and Cerrito has analyzed Prolog using linear logic [Cer90]. In this paper we focus on the application of linear logic to functional programming type systems. Historically, intuitionistic logic has been the basis for type systems, via the Curry Howard isomorphism, or formulas as types principle [How80] Through this isomorphism, intuitionistic proofs of ....

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....less populated (though not necessarily less important) areas of application of LL which did not fit in the sections above. 6.1 LL for Logical Operational Semantics of Prolog A couple of papers by Serenella Cerrito give a logical account for some operational features of Prolog. The first paper [41] is in a traditional vein and gives a LL semantics for allowed programs similar to Clark s completion, the only difference being that LL is used instead of CL. A program is allowed if every variable occurring in the head of a clause also occurs in a positive literal in the body, thus SLDNF ....

S. Cerrito. A linear semantics for allowed logic programs. In Logic in Computer Science (LICS'90), pages 219--227, Philadelphia, PA, June 1990. IEEE Computer Society Press.

....[Guzm an Hudak 1990, O Hearn 1991, Maraist et al. 95, Wadler 90, Chirimar et.al. Linear Logic has also shown promise in helping with the analysis of conventional logic programs. See, for example, the work of Cerrito on specifying the semantics of various aspects of Prolog using linear logic [Cerrito 1990, Cerrito 1992b, Cerrito 1992a] and of Reddy in specifying modes using linear logic [Reddy 1993] The most active work on using linear logic in logic programming, however, has been in the area of designing and using new logic programming languages. 3 New Logic Programming Languages In the field ....

S. Cerrito. A linear semantics for allowed logic programs. In Proceedings of the Fifth Symposium on Logic in Computer Science, pages 219227, Philadelphia, Pennsylvania, June 1990. IEEE Computer Society Press.

....out in detail by Cerrito (Cerrito, 1992) to provide a logical specification of Prolog evaluation for propositional Horn clauses. Cerrito has also used classical linear logic to provide a formalization of the Clark completion theory that is sound and complete for SLDNF on allowed logic programs (Cerrito, 1990). Gabbay has used the ideas that arise from linear logic to isolate different computational aspects of proof search in a variety of systems in an attempt to identify complete yet efficient search techniques (Gabbay, 1991) In particular, he was interested in those languages in which search may be ....

Cerrito, S. (1990). A Linear Semantics for Allowed Logic Programs. In Mitchell, J. (Ed.), Proceedings of the Fifth Annual Symposium on Logic in Computer Science, Philadelphia, PA, pp.

....in multiplicative linear logic (c.f. 14, 15, 9, 26] and connection graphs, which were designed to model connection machine computation [5] Other applications include optimization of copying in lazy functional programming language implementation [21] and the control structure of logic programs [7, 2]. A natural characterization of polynomial time computations can be given in a bounded version of linear logic [19] obtained by limiting reuse to specified bounds, i.e. by bounding the number of references to each datum in memory. In this paper, we study the complexity of provability for several ....

.... Phi, the constants 0, 1, and , but excludes the modal storage operators and . The proof rules of mall are all of the rules in the Appendix A that are associated with these connectives and constants. mall has been studied by Girard and Bellin, and used by Andreoli, Pareschi, and Cerrito [16, 6, 2, 7]. In contrast to classical propositional logic, which is co NPcomplete, we show below that provability for mall is pspace complete. The cut elimination theorem for the mall fragment follows from the cut elimination theorem and the subformula property for linear logic. Lemma 2.1 The provability ....

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....disallows both weakening and contraction in general although they are introduced for local use through modalities and it conserves a constructive character with a deep symmetry. Linear logic can be an appropriate framework to study logic programming (better than intuitionistic or classical logic) [3, 6, 16], concurrent aspects in logic programming [4, 18] Petri nets reachability [24] The main point is the resource sensitive aspect of this logic used, for example, for functional programming [19] In previous works, we considered the synthesis of correct programs using a theorem proving approach in ....

S. Cerrito. A linear semantics for allowed logic programs. In 5th IEEE Symposium on Logic in Computer Science, pages 219--227, Philadelphia, June 1990.

....community. Applications include: ffl implementation models for functional languages (Girard and Lafont 1987, Lafont 1988, Wadler 1990) ffl the study of process algebras (Abramsky and Vickers 1990, Abramsky 1988, Abadi and Plotkin 1991) ffl logic programming (Andreoli and Pareschi 1990, Cerrito 1990, Harland and Pym 1990) ffl planning in AI (Masseron, Tollu and Vauzeilles 1990) ffl and net theory (Asperti, Gorrieri and Ferrari 1990, Brown 1989a, Brown 1989b, Brown and Gurr 1990, Brown 1991, Engberg and Winskel 1994, Gunter and Gehlot 1989, Marti Oliet and Meseguer 1989) The list is by ....

Cerrito, S.: 1990, A linear semantics for allowed logic programs, 5th IEEE Symp. on Logic in Computer Science, IEEE Press.

No context found.

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

S. Cerrito. A linear semantics for allowed logic programs. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

S. Cerrito. A linear semantics for allowed logic programs. In Proc. of the 5th IEEE Symposium on Logic in Computer Science, Philadelphia, Pa, U.S.A., 1990.

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