A very intelligent backtracking method for Logic Programs

  • Christian Codognet
  • Philippe Codognet
  • Gilberto Filé
Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 213)


The CIB method seems more suited to implement both OR and AND parallelism than the usual way of executing Prolog:
  1. (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).

  2. (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.


Logic Program Unifiable Plan Unification Failure Conflict Tree Deduction Step 
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.


  1. [Bru84]
    M. Bruynooghe and L.M. Pereira; Deduction revision by intelligent backtracking. In implementation of Prolog, Compbell (ed.), Ellis Hood 1984, 194–215.Google Scholar
  2. [Cox84]
    P.T. Cox; Finding backtrack points for intelligent back-tracking. In implementation of Prolog, op.cit.,216–233Google Scholar
  3. [Cod85]
    C. Codognet and P. Codognet; Un bactracking intelligent pour Prolog. D.E.A. Thesis, Université de Bordeaux I, FranceGoogle Scholar
  4. [Llo84]
    J.W. Lloyd; "Foundations of Logic Programming". Springer Verlag, Series in Symbolic Computation, 1984.Google Scholar
  5. [Mat82]
    S. Matwin and T. Pietrzykowski; Exponential improvement of exhaustive backtracking: data structures and implementation. Sixth CADE, LNCS 138, Springer Verlag 1982, 240–259.Google Scholar
  6. [Mat83]
    S. Matwin and T. Pietrzykowski; Intelligent backtracking for automated deduction in FOL. Logic Programming Workshop 83, Algarve, Portugal, 186–191.Google Scholar
  7. [Pie 82]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Christian Codognet
    • 1
  • Philippe Codognet
    • 1
  • Gilberto Filé
    • 1
  1. 1.U.E.R. de Mathématiques et d'InformatiqueUniversité de Bordeaux ITalence CédexFrance

Personalised recommendations