Andreoli, J.-M. and R. Pareschi, Linear objects: Logical processes with built-in inheritance, New Generation Computing 9 (1991), pp. 445--473. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
....computation, and so it is likely that the logic programming interpretation for CLF will draw heavily from it. However, in Forum proofs cannot be manipulated as rst class objects not even cut elimination is treated, let al..one an equational theory on proofs. The same is true of LinLog [And92] LO [AP91], ACL [KY93] Lygon [HPW96] and LLP [HWTK98] all of which treat logic programming over other fragments of classical or intuitionistic linear logic. Perrier describes how the basic idea of linear logic programming as concurrent computation can be improved by adopting proof nets [Gir87] rather ....
Jean-Marc Andreoli and Remo Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445-473, 1991.
Automated Protocol Verification in Linear Logic - Bozzano, Delzanno (2002) (1 citation) (Correct)
....October 6 8, 2002, Pittsburgh, Pennsylvania, USA. Copyright 2002 ACM 1 58113 528 9 02 0010 . 5.00. 1. INTRODUCTION Linear logic [20] provides a logical characterization of concepts and mechanisms peculiar to concurrency like locality, recursion, non determinism in the de nition of a process [3, 22], and synchronization. Following the paradigm of proofs as computations proposed in [2, 28] provability in fragments of linear logic can be used then as a formal tool to reason about behavioural aspects of concurrent systems (see e.g. 31] In other paradigms for concurrency like the theory of ....
....Nets there exist however a number of consolidated algorithmic techniques for the validation of system properties. In [5, 6] we made a rst attempt of relating these techniques with propositional fragments of linear logic, and, more precisely, with the linear logic programming language called LO [3]. LO was originally introduced as a theoretical foundation for extensions of logic programming languages. The appealing feature of this fragment, however, is that it can also be viewed as a rich speci cation language for protocols and concurrent systems. In fact, speci cation languages like ....
[Article contains additional citation context not shown here]
J.-M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. New Generation Computing, 9(3-4):445-473, 1991.
Extension of WAM for a linear-logic-based logic programming.. - Tamura, Kaneda (1996) (Correct)
....is called resource conscious because it consumes hypotheses and consumed hypotheses can never be used again. Therefore, resource can be represented as a formula in linear logic rather than using a term. There have been several proposals for logic programming language based on linear logic: LO [2], Lolli [8] 3] Lygon [6] 7] and ACL [9] But, none of them have not been implemented on a compiler system. Lolli and Lygon are implemented as interpreter system on Prolog or SML, and their resource management methods are described in [4] and [10, 7] for Lolli and Lygon respectively. When ....
....structure ( is removed) The field rellist is a list representing the relatedresource #(i) But, we use the relative value to i instead of the absolute value. For example, in the resource p(W ( q(X) 1 p(Y 3, 4 , #(2) 3 , #(3) 1 . Therefore, the rellist for them are [ [1, 2, 3], 1, 1] 2, 1] and [ 3] respectively. The field one.l and one.r is a relative value of the left most (i.e. minimum) and right most (i.e. maximum) positions of #(i) respectively. If #(i) we set them to be one.l one.r. For example, in the resource ( q(X) 1 p(Y 1 , #(2) ....
[Article contains additional citation context not shown here]
Jean-Marc Andreoli and Remo Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445--473, 1991.
A Declarative Coordination Language - Ciancarini, Gaspari (Correct)
....In fact, processes coordinate themselves using a small set of primitives allowing to read (read) or delete (in) a tuple, and to write (out) a tuple in the shared dataspace. The Linda coordination model has been investigated in logic programming as well: Shared Prolog [8] log [35] and LO [3] are examples of logic languages based on shared dataspaces. In addition to this theoretical interest this coordination model has also achieved a signi cant impact in the existing Prolog implementations. For instance Sicstus Prolog [39, 46] a widespread Prolog implementation exploits the Linda ....
....of log [35] is based on a notion of truth with respect to traces (i.e. truth depends on the sequence of communication events which may occur during the computation) which has not an immediate intuitive meaning. The most prominent logic language based on multiset rewriting is Linear Objects (LO) [3]. A computation in LO can be thought of as the evolution of a system of communicating agents; an agent state is represented by a multiset of atoms contained in a private context; agent s state transitions are expressed by multiset rewritings, and can be either state transformations, or creations ....
J. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. New Generation Computing, 9(3-4):445-473, 1991.
Automated Verification of Security Protocols - Bozzano, Delzanno (2002) (Correct)
....of the Experimental Results . 30 7 Conclusions and Related Work 30 1 Introduction Linear logic [24] provides a logical characterization of concepts and mechanisms peculiar to concurrency like locality, recursion, non determinism, and synchronization [3, 32, 26]. Following the paradigm of proofs as computations proposed in [2, 33] provability in fragments of linear logic can be used then as a formal tool to reason about behavioural aspects of concurrent systems (see e.g. 36] In other paradigms for concurrency like the theory of Petri Nets there exist ....
....Nets there exist however a number of consolidated algorithmic techniques for the validation of system properties. In [6, 7] we made a rst attempt of relating these techniques with propositional fragments of linear logic, and, more precisely, with the linear logic programming language called LO [3]. LO was originally introduced as a theoretical foundation for extensions of logic programming languages. The appealing feature of this fragment, however, is that it can also be viewed as a rich speci cation language for protocols and concurrent systems. In fact, speci cation languages like ....
[Article contains additional citation context not shown here]
J.-M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. New Generation Computing, 9(3-4):445-473, 1991.
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
No context found.
Andreoli, J.-M. and R. Pareschi, Linear objects: Logical processes with built-in inheritance, New Generation Computing 9 (1991), pp. 445--473.
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004) (3 citations) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445--473, 1991.
Efficient Resource Management for Linear Logic Proof Search - Cervesato, Hodas, Pfenning (1997) (18 citations) (Correct)
No context found.
Jean-Marc Andreoli and Remo Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445--473, 1991.
EGO: Controlling the Power of Simplicity - Bejleri, Aldrich, Bierhoff (2006) (Correct)
No context found.
J. M. Andreoli, R. Pareschi. Linear objects: Logical Processes with Built-In Inheritance. New Generation Computing, 9:445-473, 1991.
Automated Protocol Verification in Linear Logic - Bozzano, Delzanno (2002) (1 citation) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. New Generation Computing, 9(3-4):445-473, 1991.
Logic Programming Languages for the Internet - Davison (2001) (3 citations) (Correct)
No context found.
Andreoli, J-M. and Pareschi, R. 1991. \Linear Objects: Logical Processes with Built-in Inheritance", New Generation Computing, Vol. 9, Nos. 3-4, pp.445-473.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. In Proc. 7-th International Conference on Logic Programming, Jerusalem, May 1990.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. In Proc. 7-th International Conference on Logic Programming, Jerusalem, May 1990.
Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler (1992) (24 citations) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. In Proc. 7-th International Conference on Logic Programming, Jerusalem, May 1990.
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (9 citations) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9, 1991.
Pi-calculus and LCC, a Space Odyssey - Soliman (2003) (Correct)
No context found.
J. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445473, 1991.
The O'Ciao Approach to Object Oriented Logic Programming - Pineda, Bueno (2002) (5 citations) (Correct)
No context found.
Jean-Marc Andreoli and Remo Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. In Proc. ICLP, June 1990.
O'CIAO - An Object Oriented Programming model using CIAO Prolog - Pineda, Hermenegildo (1999) (1 citation) (Correct)
No context found.
Jean-Marc Andreoli and Remo Pareschi. Linear objects: Logical processes with built-in inheritance. In Proceedings of the Seventh International Conference on Logic Programming, June 1990.
A Model for Declarative Programming and Specification with.. - Caires (1999) (Correct)
No context found.
J-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3-4):445-473, 1991.
A Theory of First-Order Built-in's of Prolog - Apt, Marchiori, Palamidessi (1992) (1 citation) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear Objects: Logical processes with built-in inheritance. New Generation Computing, 9:445--473, 1991. Also in the Proc. of the Seventh International Conference on Logic programming, 1990, Jerusalem. The MIT Press.
Logic Programming Languages for the Internet - Andrew Davison Prince (2001) (3 citations) (Correct)
No context found.
Andreoli, J-M. and Pareschi, R. 1991. \Linear Objects: Logical Processes with Built-in Inheritance", New Generation Computing, Vol. 9, Nos. 3-4, pp.445-473.
From Concurrent Logic Programming to Concurrent Constraint .. - de Boer, Palamidessi (1993) (6 citations) (Correct)
No context found.
Andreoli, J.-M. and Pareschi, R. (1991). Linear Objects: Logical processes with built-in inheritance. New Generation Computing, 9:445--473. Also in the Proc. of the Seventh International Conference on Logic programming, 1990, Jerusalem. The MIT Press.
An Overview of Linear Logic Programming - Dale Miller Inria (Correct)
No context found.
J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3-4):445-473, 1991.
Distributed Concurrent Linear Logic Programming - Kobayashi, Shimizu, Yonezawa (9 citations) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9:445 -- 473, 1991.
Travelling on Designs - Ludics Dynamics - Faggian (2002) (Correct)
No context found.
J.-M. Andreoli and R. Pareschi. Linear objects: logical processes with built-in inheritance. New Generation Computing, 9(3-4):445-473, 1991.
First 50 documents Next 50
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