. Notons and . Qu, il est evidemment possible d'utiliser un sch ema de propagation par full-lookahead comme indiqu e pr ec edemment. En eeet, dans le cas de termes non-lin eaires, l'approximation par les intervalles peut ^ etre trop grossi ere

A. A. Chip, . Programme, and . Crypta, Dans beaucoup de probl emes il est n ecessaire de pouvoir raisonner sur des distances donc en termes de valeur absolue (ex. placements, allocation de fr equences, p.192

*. E. Sr1 and C. *. D+10000, A+10, *G, labeling(LD)

%. Ba and #. Aa+ad, disj(Aa,Ad,Ba,Bd):greatereqc(Aa

. Unix, Allows certain interactions with the operating system Under Unix the possible forms of Term are as follows: access(+Path,+Mode) Tests if Mode is the accessability of Path as in the C-function access

. Finally, note that bit-vectors are not dynamic, i.e. all vectors must have the same size (0::vector max) So the use of fd vector max/1 is limited to the initial deenition of vector sizes and must occur before any constraint

A. J. Manuel-d-'utilisation and . De-clp, relationc(+CTuples,+Vars) similar to relation/2 but the tuples are given column by column (faster than, p.262

. Boolean-built, FD) ooers a set of boolean constraints based on Finite Domains. A boolean variable is nothing more than a FD variable with an initial domain 0::1. So arc-consistency is also used for booleans and thus the enumeration phase is required as for traditional FD constraints. No declarations are needed for boolean variables. When a varialble is involved in a boolean constraint it is automatically set to the initial domain 0, p.1

A. Aggoun and N. Beldiceanu, Time Stamps Techniques for the Trailed Data in CLP Systems, Actes du S eminaire 1990 -Programmation en Logique, 1990.

A. Aggoun and N. Beldiceanu, Overview of the CHIP Compiler System, 8th International Conference on Logic Programming Also in Constraint Logic Programming, 1991.

F. Benhamou, Boolean Algorithms in PrologIII, Constraint Logic Programming, 1993.

H. Bennaceur and G. Plateau, FASTLI: An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference, Research Report, LIPN, 1991.

H. Bennaceur and G. Plateau, Logical Inference Problem in Variables 0/1, IFORS 93 Conference, 1993.

A. Bockmayr, Logic Programming with Pseudo-Boolean Constraints. Research Report MPI-I-91-227, 1991.

M. Bonnard, S. Manchon, and P. Planchon, Bilan des etudes de la division AOC sur la r egulation du traac a erien, 1992.

S. Manchon, D. Chemla, C. Gobier, and P. Kerlirzin, Dossier de sp eciications du Syst eme Pr etactique pour Optimiser la R egulation du Traac a erien: SPORT V4, 1992.

M. Bruynooghe, An Interpreter for Predicate Logic Programs: Basic Principles, Research Report, vol.10, 1976.

M. Bruynooghe, The Memory Management of Prolog Implemantations, pp.12-20, 1980.

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

W. Uttner and H. Simonis, Embedding Boolean Expressions into Logic Programming, Journal of Symbolic Computation, issue.4, pp.191-205, 1987.

M. Carlsson, Design and Implementation of an Or-Parallel Prolog Engine, 1990.

B. Carlson and M. Carlsson, Constraint Solving and Entailment Algorithms for cc(FD), Research Report, 1993.

B. Carlsson, M. Carlsson, and D. Diaz, Entailment of Finite Domain Constraints, 11th International Conference on Logic Programming, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00668885

D. Chemla, D. Diaz, P. Kerlirzin, and S. Manchon, Using clp(FD) to Support Air Trafc Flow Management, 3rd International Conference on the Practical Application of Prolog, 1995.

T. Chikayama, T. Fujise, and D. Sekita, A portable and EEcient Implementation of KL1, ICOT/NSF Workshop on Parallel Logic Programming and its Programming Environments, 1994.

P. Codognet, F. Fages, and T. Sola, A metalevel compiler for CLP(FD) and its combination with intelligent backtracking, Constraint Logic Programming, 1993.

D. Diaz, wamcc Prolog Compiler User's Manual, 1994.

D. Diaz, clp(FD) User's Manual, 1994.

P. Codognet and D. Diaz, wamcc: Compiling Prolog to C, 12th International Conference on Logic Programming, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00668817

P. Codognet and D. Diaz, A Minimal Extension of the WAM for clp(FD), 10th International Conference on Logic Programming, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00668913

P. Codognet and D. Diaz, Compiling constraints in clp(FD), The Journal of Logic Programming, vol.27, issue.3
DOI : 10.1016/0743-1066(95)00121-2

URL : https://hal.archives-ouvertes.fr/hal-00693245

P. Codognet and D. Diaz, Boolean Constraint Solving Using clp(FD), International Logic Programming Symposium, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00668897

P. Codognet and D. Diaz, Clp(B): Combining simplicity and efficiency in boolean Constraint solving, Programming Language Implementation and Logic Programming Madrid, 1994.
DOI : 10.1007/3-540-58402-1_18

P. Codognet and D. Diaz, A Simple and EEcient Boolean Solver for Constraint Logic Programming

P. Codognet and D. Diaz, Finite Domain Constraints in Constraint Logic Programming, 14th European Conference on Operational Research, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00668846

D. and C. De-verdi-ere, Utilisation des techniques de recherche op erationnelle pour les etudes Air Traac Management, 1992.

A. Colmerauer, An introduction to Prolog-III, Communications of the ACM, vol.33, issue.7, 1990.

V. , S. Costa, D. H. Warren, and R. Yang, The Andorra-I engine: A parallel implementation of the basic Andorra model, 8th International Conference on Logic Programming, 1991.

M. Dincbas, H. Simonis, and P. Van-hentenryck, Solving the Car-Sequencing Problem in Constraint Logic Programming, ECAI-88, 1988.

M. Dincbas, H. Simonis, and P. Van-hentenryck, Solving large combinatorial problems in logic programming, The Journal of Logic Programming, vol.8, issue.1-2, 1990.
DOI : 10.1016/0743-1066(90)90052-7

G. Dore and P. Codognet, A Prototype Compiler for Prolog with Boolean Constraints, GULP'93, Italian Conference on Logic Programming, 1993.

G. Gallo and G. Urbani, Algorithms for Testing the Satissability of Propositional Formulae, Journal of Logic Programming, issue.7, pp.45-61, 1989.

J. M. Garot, Airspace Management in Europe: issues and solutions, IFORS 1993: 13th International Conference of Operational Research, 1993.

D. Gudeman, Representing Type Information in Dynamically Typed Languages, 1993.

D. Gudeman, K. De-bosschere, and S. Debray, jc: An EEcient and Portable Sequential Implementation of Janus, Joint International Conference and Symposium on Logic Programming, 1992.

R. M. Haralick and G. L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

S. Haridi and S. Janson, Kernel Andorra Prolog and its computation model, 7th International Conference on Logic Programming, 1990.

B. Haussman, Turbo Erlang: Approaching the Speed of C, Implementations of Logic Programming Systems, 1994.
DOI : 10.1007/978-1-4615-2690-2_9

J. N. Hooker and C. Fedjki, Branch-and-cut solution of inference problems in propositional logic, Annals of Mathematics and Artificial Intelligence, vol.29, issue.1-4, 1987.
DOI : 10.1007/BF01531074

J. Jaaar and J. Lassez, Constraint Logic Programming, Principles Of Programming Languages, 1987.

J. Jaaar and S. Michaylov, A Methodology for Managing Hard Constraints in CLP Systems, proceedings of Sigplan PLDI, 1991.

J. Jaaar, S. Michaylov, P. J. Stuckey, and R. Yap, An Abstract Machine for CLP(R), proceedings of Sigplan PLDI, 1992.

J. Jourdan, Modelisation of terminal zone aircraft sequencing in constraint logic programming, 1992.

J. Jourdan and T. Sola, The Versatility of Handling Disjunctions as Constraints In Programming Language Implementation and Logic Programming, 1993.

A. K. Mackworth, Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

U. Martin and T. Nipkow, Boolean Uniication { The story so far, Journal of Symbolic Computation, issue.7, pp.191-205, 1989.

J. Massat, Using Local Consistency Techniques to Solve Boolean Constraints, Constraint Logic Programming: Selected Research, 1993.

C. S. Mellish, An alternative to Structure-Sharing in Logic Programming edited by, pp.99-106, 1982.

W. J. Older and F. Benhamou, Programming in clp(BNR) In Position Papers of 1st PPCP, 1993.

L. M. Pereira and A. Porto, Intelligent backtracking and sidetracking in horn clause programs, 1979.

A. Rauzy, L'Evaluation S emantique en Calcul Propositionnel, 1989.

A. Rauzy, Using Enumerative Methods for Boolean Uniication, Constraint Logic Programming, 1993.

A. Rauzy, Some Practical Results on the SAT Problem, Draft BIBLIOGRAPHIE, vol.269, 1993.

V. A. Saraswat, Concurrent Constraint Programming Languages Also (revised), 1989.

V. Saraswat, The category of constraint systems is Cartesian-closed, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, 1992.
DOI : 10.1109/LICS.1992.185546

D. S. Scott, Domains for denotational semantics, ICALP'82, International Colloquium on Automata Languages and Programming, 1982.
DOI : 10.1007/BFb0012801

H. Simonis and M. Dincbas, Propositional calculus problems in CHIP, ECRC, 1990.
DOI : 10.1007/3-540-53162-9_39

T. E. Uribe and M. E. Stickel, Ordered Binary Decision Diagrams and the Davis-Putnam procedure, CCL'94 Constraints in Computational Logics, 1994.
DOI : 10.1007/BFb0016843

P. Van-hentenryck, Constraint Satisfaction in Logic Programming. Logic Programming Series, 1989.

P. Van-hentenryck and Y. Deville, The Cardinality Operator: A new Logical Connective for Constraint Logic Programming, 8th International Conference on Logic Programming, 1991.

P. Van-hentenryck, V. Saraswat, and Y. Deville, Constraint processing in cc(FD). Draft, 1991.

P. Van-hentenryck, V. Saraswat, and Y. Deville, Design, Implementation and Evaluation of the Constraint language cc(FD). Draft, 1993.

P. Van-hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

P. Van-hentenryck, H. Simonis, and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence, vol.58, issue.1-3, pp.113-159, 1992.
DOI : 10.1016/0004-3702(92)90006-J

P. Van-roy, Can Logic Programming run as fast as Imperative Programming ? Report No UCB/CSD90, 1990.

P. Van-roy and A. Despain, High-performance logic programming with the Aquarius Prolog compiler, Computer, vol.25, issue.1, pp.54-67, 1992.
DOI : 10.1109/2.108055

D. H. Warren, An Abstract Prolog Instruction Set, 1983.

D. H. Warren, The Andorra Principle. Internal Report, Gigalips Group, Des contraintes na^ t la beaut e L eonard de Vinci, 1987.