A.C. Kakas, and G.A. Papadopoulos. Parallel Abduction in Logic Programming. In Proc.Int. Symp. on Parallel Symbolic Computation PASCO94. pages 214-224, World Scientific Pub., 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Dynamic Composition of Abductive Agents in ALIAS - Ciampolini, Lamma, Mello.. (Correct)
....In Theorist, consistency is immediately checked for those hypotheses with no variables and delayed until the end for hypotheses containing variables at the time they are generated. A parallel implementation of the proof procedure described in [14] has been proposed by Kakas and Papadopoulos in [15]. Various forms of parallelism (OR and dependent AND parallelism) are exploited to parallelise deductive logic pro11 gramming in the framework of abductive logic programming. This parallel model for abduction is then mapped into the Andorra model. Nonetheless, the focus of [15] is on a parallel ....
....and Papadopoulos in [15] Various forms of parallelism (OR and dependent AND parallelism) are exploited to parallelise deductive logic pro11 gramming in the framework of abductive logic programming. This parallel model for abduction is then mapped into the Andorra model. Nonetheless, the focus of [15] is on a parallel implementation of a single abductive logic programming computation rather than on the multi agent case. A notion of abduction for the family of Concurrent Constraint (cc) languages was proposed by Codognet and Saraswat in [7] The key idea of the cc framework is to use ....
A.C. Kakas, and G.A. Papadopoulos. Parallel Abduction in Logic Programming. In Proc.Int. Symp. on Parallel Symbolic Computation PASCO94. pages 214-224, World Scientific Pub., 1994.
Abductive Behaviour Of Concurrent Logic Programs - George Papadopoulos (1994) Self-citation (Papadopoulos) (Correct)
....defined within this framework and has been used in building meta interpreters on top of Prolog systems. However, as in usual deductive logic programming, abductive inference mechanisms have several sources of parallelism of many forms (OR parallelism, independent and dependent AND parallelism) In [9] we examine the introduction of these forms of parallelism into an abductive logic program, we study the operational behaviour of such a program enhanced with parallelism and we highlight its effect on the efficiency of execution compared with the corresponding sequential version. An alternative ....
A. C. Kakas and G. A. Papadopoulos (1994), `Parallel Abduction in Logic Programming', Proc. 1st International Symposium on Parallel Symbolic Computation, Linz, Austria, (to appear).
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