S. Ferenczi and I. Futo. CS-Prolog: A Communicating Sequential Prolog. In P. Kacsuk and M. J. Wise, editors, Implementations of Distributed Prolog, pages 357-378. John Wiley, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....= 0) this.wait( return messagePort.removeFirst( Figure 17: Implementing send receive in Java without using the piped input and output streams. See Section 5.4 for a discussion on the performance of this implementation. 5.3. 4 CS Prolog Professional CS Prolog Professional [35, 45] is a Prolog system developed in Hungary. It supports several independent processes (to avoid ambiguity, we will refer to them as threads) similar to SICStus MT. However, there are a couple of important differences. Thread are not created dynamically, but pseudo static . This means that the ....

S. Ferenczi and I. Futo. CS-Prolog: A Communicating Sequential Prolog. In P. Kacsuk and M. J. Wise, editors, Implementations of Distributed Prolog, pages 357-378. John Wiley, 1992.

....that captures distributed logic programs in a declarative way. 1 Introduction A new paradigm of Process based logic programming languages is emerging from a long standing and slowly background evolution. Some representatives of Process based Prolog languages are Delta Prolog [CMCP92] CS Prolog [FF92] and PMS Prolog [WJH92] The roots of these languages reaches back to the middle eighties. Recent blackboard oriented languages like Shared Prolog [BC91] belong to process based languages as well. Common problem of process based logic languages is that only procedural meaning can be attached to a ....

....tree and the communication patterns of these processes correspond to links among the search trees. The basic CS Prolog language implies the concept of tree unification by tree matching along branches with the same communication pattern and unifying variables used in the individual communications [FF92] as an extension to unification of terms in the goals and in the heads of the predicates used in conventional Prolog. No specific programming language is used in this paper since the concepts explored here are supposed to suit for a whole class of Process based logic programming languages. 2 ....

[Article contains additional citation context not shown here]

Szabolcs Ferenczi and Iv'an Fut'o. CS--Prolog: A Communicating Sequential Prolog. In Kacsuk and Wise [KW92], pages 357--378.

.... Prolog, PVM, X Window, evolutionary, message passing, process based 1 Introduction Interest in process based logic programming systems featuring explicit communication and distributed execution has recently revived [2] 15] although research has been continuing in this area over the years [6] [8]. This type of approach to developing parallel logic programming systems is not as promising for exploiting parallelism as more specialised approaches such as [11] However, it substantially reduces the effort required to build such systems, and avoids making the systems architecture so special ....

....They also avoid the inefficiency of making all interprocess communication indirect. They are not quite as expressive, because they force users to address all messages or consign them to named channels, but in practice this drawback can be finessed. Representative examples include CS Prolog [8] and PMS Prolog [15] A common design choice of such Prologs has been to support dynamic process creation and to adopt a purely synchronous style of message reception. Dynamic process creation provides flexibility and expressiveness but has rather high overheads, since it is normally realised by ....

S. Ferenczi and I. Futo. CS-prolog: A communicating sequential prolog. In P. Kacsuk and M.J. Wise, editors, Implementations of Distributed Prolog, pages 357--378. John Wiley, 1992.

....objects, the objective is to have a convenient way of abstracting away the behaviour of external components. This modelling facility is also supported by a solid formal basis [14] In distributed systems, however, synchrony is difficult to 1. To our knowledge, only Delta Prolog [20] and CS Prolog [13] offer built in distributed backtracking. 1. Here synchronous is not taken in the sense of blocking method calls. simulate, because of the lack of absolute time reference and the non negligible communication medium. Some work has been done to implement Esterel on local area networks by maximizing ....

Sz. Ferrenczi and I. Futo, "CS-Prolog: a Communicating Sequential Prolog", in P. Kacsuk and M. Wise editors, Implementations of Distributed Prolog, pp 357-378, John Wiley & Sons, Chichester, 1992.

....of logic languages are related to control parallelism [6] There are two main traditional approaches. The first one is a parallelisation a priori by extending a logic language with concurrent control structures. This includes mechanisms like guards, delaying or ask and tell primitives [25] 24] [7]. Like in imperative languages, it forces the programmer to pay the price of this expressiveness by manipulating several interacting control flows which may lead to non deterministic execution, or to deadlocks. An other solution is a parallelisation a posteriori with no or minimal changes to the ....

Sz. Ferenczi and I. Fut'o. CS-Prolog: a communicating sequential Prolog. In Kacsuk and Wise [16], chapter 16, pages 357--378.

....memory ones. Besides AND , OR , and stream AND parallel execution of Prolog programs, there emerged a so called process based program execution with explicit process creation and explicit communication [3] Some representatives of process based Prolog languages are Delta Prolog [4, 5] CS Prolog [6, 7, 8] and PMS Prolog [9] The roots of these languages reaches back into the middle eighties. Even recent blackboard oriented languages (e.g. Shared Prolog [10] and Multi Prolog [11] and coordination languages (e.g. Vienna Parallel Logic [12] do belong to process based languages as well. Common ....

....a Prolog process cannot contain unbound variables in the arguments. This is because otherwise all the problems of AND parallel execution would arise. Shared Prolog, for example, allows only atoms in clause heads describing processes [10] whereas CS Prolog allows bound variable arguments as well [8]. In general, as in AND parallel execution, unbound variable arguments may be allowed if some mechanism provides that these variables will be bound to the same binding value. For AND parallelism the mechanism is implicit. In case of distributed logic languages, this mechanism is realized by ....

[Article contains additional citation context not shown here]

Szabolcs Ferenczi and Iv'an Fut'o. CS--Prolog: A Communicating Sequential Prolog. In Kacsuk and Wise [3], pages 357--378.

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