𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed Logic Objects: A Fragment of Rewriting Logic and its Implementation

✍ Scribed by Anna Ciampolini; Evelina Lamma; Paola Mello; Cesare Stefanelli


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
816 KB
Volume
4
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis


This paper presents a logic language (called Distributed Logic Objects, DLO for short) that supports objects, messages and inheritance. The operational semantics of the language is given in terms of rewriting rules acting upon the (possibly distributed) state of the system. In this sense, the logic underlying the language is Rewriting Logic. In the paper we discuss the implementation of this language on distributed memory MIMD architectures, and we describe the advantages achieved in terms of exibility, scalability and load balancing. In more detail, the implementation is obtained by translating logic objects into a concurrent logic language based on multi-head clauses, taking advantage from its distributed implementation on a massively parallel architecture. In the underlying implementation, objects are clusters of processes, objects' state is represented by logical variables, message-passing communication between objects is performed via multi-head clauses, and inheritance is mapped into clause union. Some interesting features such as transparent object migration and intensional messages are easily achieved thanks to the underlying support. In the paper, we also sketch a (direct) distributed implementation supporting the indexing of clauses for single-named methods.


πŸ“œ SIMILAR VOLUMES


A general theory of confluent rewriting
✍ JΓΌrgen Dix; Mauricio Osorio; Claudia Zepeda πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 236 KB

Recently, Brass and Dix showed (J. Automat. Reason. 20(1) (1998) 143-165) that the well founded semantics WFS can be deΓΏned as a con uent calculus of transformation rules. This led not only to a simple extension to disjunctive programs (J. Logic Programming 38(3) (1999) 167-213), but also to a new c