Abstract
The CIB method seems more suited to implement both OR and AND parallelism than the usual way of executing Prolog:
-
(i)
for the OR parallelism a process can be associated to each unifiable plan generated by the backtrack method (each process independent from the others).
-
(ii)
for AND parallelism the DCG graph of a plan P will surely be useful in coordinating the work of several processes expanding P.
For these reasons it is surely very interesting to explore the usefulness of the CIB mehtod in parallel implementations of logic programming.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bruynooghe and L.M. Pereira; Deduction revision by intelligent backtracking. In implementation of Prolog, Compbell (ed.), Ellis Hood 1984, 194–215.
P.T. Cox; Finding backtrack points for intelligent back-tracking. In implementation of Prolog, op.cit.,216–233
C. Codognet and P. Codognet; Un bactracking intelligent pour Prolog. D.E.A. Thesis, Université de Bordeaux I, France
J.W. Lloyd; "Foundations of Logic Programming". Springer Verlag, Series in Symbolic Computation, 1984.
S. Matwin and T. Pietrzykowski; Exponential improvement of exhaustive backtracking: data structures and implementation. Sixth CADE, LNCS 138, Springer Verlag 1982, 240–259.
S. Matwin and T. Pietrzykowski; Intelligent backtracking for automated deduction in FOL. Logic Programming Workshop 83, Algarve, Portugal, 186–191.
T. Pietrzykowski and S. Matwin; Exponential improvement of exhaustive backtracking: a strategy for plan-based deduction. Sixth CADE, LNCS 138, Springer Verlag 1982, 223–239.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codognet, C., Codognet, P., Filé, G. (1986). A very intelligent backtracking method for Logic Programs. In: Robinet, B., Wilhelm, R. (eds) ESOP 86. ESOP 1986. Lecture Notes in Computer Science, vol 213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16442-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-16442-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16442-5
Online ISBN: 978-3-540-39782-3
eBook Packages: Springer Book Archive