Compiling constraints in clp(FD)

Journal of Logic Programming

Volumn 27, Issue 3, 1996, Pages 185-226

  Codognet, Philippe ^a   Diaz, Daniel ^b  

^a INRIA ROCQUENCOURT   (France)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; OPTIMIZATION;

ABSTRACT INSTRUCTION SET; COMPILING CONSTRAINTS; CONSTRAINT LOGIC PROGRAMMING; FINITE DOMAIN CONSTRAINTS; SINGLE PRIMITIVE CONSTRAINT;

LOGIC PROGRAMMING;

EID: 0030166485     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00121-2     Document Type: Article

References (52)

1. Aggoun, A. and Beldiceanu, N., Time Stamps Techniques for the Trailed Data in CLP Systems, in: Actes du Séminaire 1990 - Programmation en Logique, Tregastel, France, CNET 1990.
2. Aggoun, A. and Beldiceanu, N., Overview of the CHIP Compiler System, in: 8th Int. Conf. on Logic Programming, Paris, France, MIT Press, 1991. Also in Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (eds.), MIT Press, 1993.
3. Aggoun, A. and Beldiceanu, N., Overview of the CHIP Compiler System, in: 8th Int. Conf. on Logic Programming, Paris, France, MIT Press, 1991. Also in Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (eds.), MIT Press, 1993.
4. Aït-Kaci, H., Warren's Abstract Machine, A Tutorial Reconstruction, Logic Programming Series, MIT Press, 1991.
5. BNR-Prolog User's Manual, Bell Northern Research, Ottawa, Canada, 1988.
6. Bockmayr, A., Logic Programming with Pseudo-Boolean Constraints, Research Report MPI-I-91-227, Max Planck Institut, Saarbrucken, Germany, 1991.
7. Bryant, R. E., Graph Based Algorithms for Boolean Function Manipulation, IEEE Trans. Computers c-35(8):677-691 (1986).
8. Büttner, W. and Simonis, H., Embedding Boolean Expressions into Logic Programming, J. Symbolic Computation (4):191-205 (1987).
9. Carlsson, B. and Carlsson, M., Constraint Solving and Entailment Algorithms for cc(FD), Research Report, SICS, Sweden, 1993.
10. Carlsson, B. Carlsson, M., and Diaz, D., Entailment of Finite Domain Constraints, in: 11th Int. Conf. on Logic Programming, Santa Margherita, Italy, MIT Press, 1994.
11. Codognet, P., Fages, F., and Sola, T., A Metalevel Compiler for CLP(FD) and its Combination with Intelligent Backtracking, in: Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (eds.), MIT Press, 1993.
12. Codognet, P. and Diaz, D., A Minimal Extension of the WAM for clp(FD), in: 10th Int. Conf. on Logic Programming, Budapest, Hungary, MIT Press, 1993.
13. Codognet, P. and Diaz, D., Boolean Constraint Solving Using clp(FD), in: Int. Logic Programming Symp., Vancouver, B.C., Canada, MIT Press, 1993.
14. Codognet, P. and Diaz, D., clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving, in: Programming Language Implementation and Logic Programming, Madrid, Spain, Springer-Verlag, 1994.
15. Codognet, P. and Diaz, D., A Simple and Efficient Boolean Solver for Constraint Logic Programming, J. Automated Reasoning (to appear).
16. Chemla, D., Diaz, D., Kerlirzin, P., and Manchon, S., Using clp(FD) to Support Air Traffic Flow Management, in: Int. Logic Programming Symp. Post-Conf. Workshop on Constraint Languages/Systems and Their Use in Problem Modelling, Ithaca, NY, P. Lim and J. Jourdan (eds.), 1994.
17. Codognet, P. and Diaz, D., wamcc: Compiling Prolog to C, in: 12th Int. Conf. on Logic Programming, Tokyo, Japan, MIT Press, 1995.
18. Colmerauer, A., An Introduction to Prolog-III, Commun. ACM 33(7) (July 1990).
19. Santos Costa, V., Warren, D. H. D., and Yang, R., The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model, in: 8th Int. Conf. on Logic Programming, Paris, France, MIT Press, 1991.
20. Diaz, D., Etude de la Compilation des Langages Logiques de Programmation par Contraintes sur les Domaines Finis: Le Système clp(FD), Ph.D. thesis, University of Orleans, France, Jan. 1995.
21. Dincbas, M., Simonis, H., and Van Hentenryck, P., Solving the Car-Sequencing Problem in Constraint Logic Programming, in: ECAI-88, Munich, Germany, Aug. 1988.
22. Dincbas, M., Simonis, H., and Van Hentenryck, P., Solving Large Combinatorial Problems in Logic Programming, J. Logic Programming 8(1,2) (1990).
23. Dore, G. and Codognet, P., A Prototype Compiler for Prolog with Boolean Constraints, in: GULP'93, Italian Conf. on Logic Programming, Gizzeria Lido, Italy, 1993.
24. Gallo, G. and Urbani, G., Algorithms for Testing the Satisfiability of Propositional Formulae, J. Logic Programming (7):45-61 (1989).
25. Haralick, R. M. and Elliot, G. L., Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intell., 14:263-313 (1980).
26. Haridi, S. and Janson, S., Kernel Andorra Prolog and Its Computation Model, in: 7th Int. Conf. on Logic Programming, Jerusalem, Israel, MIT Press, 1990.
27. Jaffar, J. and Lassez, J.-L., Constraint Logic Programming, in: Principles of Programming Languages, Munich, Germany, Jan. 1987.
28. Jaffar, J. and Michaylov, S., A Methodology for Managing Hard Constraints in CLP Systems, in: Proc. of SIGPLAN PLDI, Toronto, Canada, ACM Press, 1991.
29. Jaffar, J., Michaylov, S., Stuckey, P. J., and Yap, R., An Abstract Machine for CLP(ℛ), in: Proc. of SIGPLAN PLDI, San Francisco, CA, ACM Press, 1992.
30. Jourdan, J. and Sola, T., The Versatility of Handling Disjunctions as Constraints, in: Programming Language Implementation and Logic Programming, Talin, Estonia, 1993.
31. Mackworth, A. K., Consistency in Networks of Relations, Artificial Intell. 8:99-118 (1977).
32. Martin, U. and Nipkow, T., Boolean Unification - The Story So Far, J. Symbolic Computation (7):191-205 (1989).
33. Massat, J.-L., Using Local Consistency Techniques to Solve Boolean Constraints, in: Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (eds.), MIT Press, 1993.
34. Nadel, B. A., Constraint Satisfaction Algorithms, Computational Intell. 5:188-224 (1989).
35. Older, W.J. and Benhamou, F., Programming in clp(BNR), in: Position Papers of 1st PPCP, Newport, RI, 1993.
36. Pereira, L. M. and Porto, A., Intelligent Backtracking and Sidetracking in Horn Clause Programs, Technical Report CIUNL 2/79, Universitade Nova de Lisboa, 1979.
37. Rauzy, A., L'Evaluation Sémantique en Calcul Propositionnel, Ph.D. thesis, University of Aix-Marseille II, Marseille, France, Jan. 1989.
38. Rauzy, A. Adia, Technical Report, LaBRI, Université Bordeaux I, 1991.
39. Rauzy, A., Using Enumerative Methods for Boolean Unification, in: Constraint Logic Programming: Selected Research, A. Colmerauer and F. Benhamou (eds.), MIT Press, 1993.
40. Rauzy, A., Some Practical Results on the SAT Problem, Draft, 1993.
41. Saraswat, V.A., Concurrent Constraint Programming Languages, Ph.D. thesis, Research Report CMU-CS-89-108, Carnegie-Mellon University, 1989. Also (revised), MIT Press, 1993.
42. Saraswat, V., The Category of Constraint Systems is Cartesian-Closed, in: Logic in Computer Science, IEEE Press, 1992.
43. Scott, D. S., Domains for Denotational Semantics, in: ICALP'82, Int. Colloquium on Automata Languages and Programming, 1982.
44. Simonis, H. and Dincbas, M., Propositional Calculus Problems in CHIP, ECRC, Technical Report TR-LP-48, 1990.
45. Van Hentenryck, P., Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, 1989.
46. Van Hentenryck, P. and Deville, Y., The Cardinality Operator: A new Logical Connective for Constraint Logic Programming, in: 8th Int. Conf. on Logic Programming, Paris, France, MIT Press, 1991.
47. Van Hentenryck, P., Saraswat, V., and Deville, Y., Constraint Processing in cc(FD), Draft, 1991.
48. Van Hentenryck, P., Saraswat, V., and Deville, Y., Design, Implementation and Evaluation of the Constraint Language cc(FD), Draft, 1993.
49. Van Hentenryck, P., Deville, Y., and Teng, C.-M., A Generic Arc-Consistency Algorithm and its Specializations, Artificial Intell. (57):291-321 (1992).
50. Van Hentenryck, P., Simonis, H., and Dincbas, M., Constraint Satisfaction Using Constraint Logic Programming, Artificial Intell. (58):113-159 (1992).
51. Warren, D. H. D., An Abstract Prolog Instruction Set, Technical Report 309, SRI International, Oct. 1983.
52. Warren, D. H. D., The Andorra Principle, Internal Report, Gigalips Group, 1987.