Porto, A., and Rosado, P . 1992. The AbstrAct Scheme for Concurrent Programming.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....programmer. In other words, when an agent produces some data as output, it does not have to know which agent will take them as input, or if the data will eventually be taken. The tuple space paradigm inspired the design of languages like: Linda [38, 40] Swarm [109] LO [13] Gamma [24, 25] Tao [102, 101], SP [31] ESP [34] PoliS [46] Pat e [12] and eta [4, 6] They are also called coordination languages. The combination of associative access and uncoupling results in a very high expressive power when describing coordination properties of different cooperating entities. In almost all of them ....

....occurring in the head. The theoretical basis for LO is Linear Logic [62] the current goal is a multiset rather than a set of atoms. In this perspective, object states in LO are multiset of atoms, and clauses are rewriting rules on them. Tao [102] is a tuple space language based on the AbstrAct [101] model. The interaction with the tuple space is described by rules as in most languages we have seen. A composition (parallel, sequential, choice, synchronous) of rules defines agents behaviour. Indeed, Tao shows many similarities with Pat e, the main difference is the possibility of constraining ....

Ant'onio Porto and Paulo Rosado. The AbstrAct scheme for concurrent programming. In Evelina Lamma and Paola Mello, editors, Extensions of Logic Programming, volume 660 of LNAI, pages 216-- 241. Springer-Verlag, 1993.

....with the tuple space and the computation fired by the specified configurations of the tuple space, resp. can be uniformly described by the same formalism. The tuple space paradigm inspired the design of many programming languages, like Linda [18, 20] Swarm [48] LO [7] Gamma [12, 13] Tao [47, 46, 42], manifold [9] SP [14] 3 ESP [17] PoliS [24] Pat e [6] and eta [4, 5] A focussed discussion of the characteristics of some of these languages can be found at the beginning of section 2 1.2 Motivations Our target is the definition of a logical, heterogeneous, and compositional refinement ....

A. Porto and P. Rosado. The AbstrAct scheme for concurrent programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, volume 660 of LNAI, pages 216--241. Springer-Verlag, 1993.

....proves that this is possible and does not lead to intricacies. However, the connections with linear logic will be explored in future work. The concept of resource handling is closely related to the notions of action and change, which have recently been the subjects of many researches: see e.g. [8, 10, 11, 13, 14, 19, 20, 21, 22, 23, 25]. Our work differs from them as follows. The language AbstrAct [25] specifies the activities of systems by action rules characterizing agents capable of performing actions that operate on a global shared data space. A feature of AbstrAct is that it distinguishes between actions to induce state ....

....will be explored in future work. The concept of resource handling is closely related to the notions of action and change, which have recently been the subjects of many researches: see e.g. 8, 10, 11, 13, 14, 19, 20, 21, 22, 23, 25] Our work differs from them as follows. The language AbstrAct [25] specifies the activities of systems by action rules characterizing agents capable of performing actions that operate on a global shared data space. A feature of AbstrAct is that it distinguishes between actions to induce state transformations and deductions that can be performed in each state. ....

A. Porto and P. Rosado. The AbstrAct Scheme for Concurrent Programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, volume 660 of Lecture Notes in Artificial Intelligence, pages 216--241, Berlin, 1993. SpringerVerlag.

....output is a program optimized for a dataflow like evaluation. Other models and languages that have some affinity with PoliS and SP are LO, AbstrAct, Gamma, and Swarm. For a discussion on the relationship between LO and SP, see [5] AbstrAct is a logic programming language by Porto and Rosado [37]. In AbstrAct the blackboard coordination model is used: a set of tasks called agenda share a dataspace that is a set of logic terms. Non monotonic update is supported. AbstrAct has not been implemented and it is still in evolution: the main concern of its designers is on semantic cleanness of ....

A. Porto and P. Rosado. The AbstrAct Scheme for Concurrent programming. In E. Lamma and P. Mello, editors, Proc. 3rd Workshop on Extensions of Logic Programming, volume 660 of Lecture Notes in Computer Science, pages 216--241. Springer-Verlag, Berlin, 1992.

....the language, as shown in the distributed problem solving solution. Other models and languages that have some affinity with PoliS and SP are LO, AbstrAct, Gamma, and Swarm. For a discussion on the relationship between LO and SP, see [7] AbstrAct is a logic programming language by Porto and Rosado [29]. In AbstrAct the blackboard coordination model is used: a set of tasks called agenda share a dataspace that is a set of logic terms. Non monotonic update is supported. AbstrAct has not been implemented and it is still in evolution: the main concern of its designers is on semantic cleanness of ....

A. Porto and P. Rosado. The AbstrAct Scheme for Concurrent programming. In E. Lamma and P. Mello, editors, Proc. 3rd Workshop on Extensions of Logic Programming, volume 660 of Lecture Notes in Computer Science, pages 216--241. Springer-Verlag, Berlin, 1992.

....the connections with linear logic will be explored in future work. The concept of resource handling is closely related to the notions ofhe concept of resource handling is closely related to the notions of action and change, which have recently been the subjects of many researches: see e.g. [20, 22, 21, 19, 13, 11, 14, 23, 10, 8, 25]. Our work differs from them as follows. The language AbstrAct [25] specifies the activities of systems by action rules characterizing agents capable of performing actions that operate on a global shared data space. A feature of AbstrAct is that it distinguishes between actions to induce state ....

....is closely related to the notions ofhe concept of resource handling is closely related to the notions of action and change, which have recently been the subjects of many researches: see e.g. 20, 22, 21, 19, 13, 11, 14, 23, 10, 8, 25] Our work differs from them as follows. The language AbstrAct [25] specifies the activities of systems by action rules characterizing agents capable of performing actions that operate on a global shared data space. A feature of AbstrAct is that it distinguishes between actions to induce state transformations and deductions that can be performed in each state. ....

A. Porto and P. Rosado. The AbstrAct Scheme for Concurrent Programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, volume 660 of Lecture Notes in Artificial Intelligence, pages 216--241, Berlin, 1993. Springer-Verlag.

No context found.

A. Porto and P. Rosado. The AbstrAct scheme for concurrent programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, volume 660 of LNAI, pages 216--241. Springer-Verlag, 1993.

No context found.

Porto, A., and Rosado, P . 1992. The AbstrAct Scheme for Concurrent Programming.

No context found.

Porto, A., and Rosado, P. 1992. The AbstrAct Scheme for Concurrent Programming. Extensions of logic programming : third international workshop, ELP '92, Bologna, Italy, February 26-28, 1992, proceedings / E. Lamma, P. Mello (eds.). Lecture Notes in Artificial Intelligence; 660.

No context found.

A. Porto and P. Rosado. The AbstrAct Scheme for Concurrent programming. In E. Lamma and P. Mello, editors, Proc. 3rd Workshop on Extensions of Logic Programming, volume 660 of Lecture Notes in Computer Science, pages 216--241. Springer-Verlag, Berlin, 1992.

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