A simple and efficient boolean solver for Constraint Logic Programming

Journal of Automated Reasoning

Volumn 17, Issue 1, 1996, Pages 97-128

  Codognet, Philippe ^a   Diaz, Daniel ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

Boolean solver; Compilation; Constraint logic programming; Finite domains; Implementation; Logic programming

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FORMAL LANGUAGES; PROBLEM SOLVING; PROGRAM COMPILERS;

BOOLEAN SOLVER; CONSTRAINT LOGIC PROGRAMMING; FINITE DOMAINS;

LOGIC PROGRAMMING;

EID: 0030213448     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00247670     Document Type: Article

References (43)

1. Aït-Kaci, H.: Warren's Abstract Machine, A Tutorial Reconstruction, Logic Programming Series, The MIT Press, Cambridge, MA, 1991.
2. Benhamou, F.: Boolean algorithms in PrologIII, in A. Colmerauer and F. Benhamou (eds), Constraint Logic Programming: Selected Research, The MIT Press, 1993.
3. Bennaceur, H. and Plateau, G.: FASTLI: An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference, Research Report, LIPN, Université Paris-Nord, Paris, France, 1991.
4. Bennaceur, H. and Plateau, G.: Logical inference problem in variables 0/1, in Proc. IFORS 93 Conf., Lisboa, Portugal, 1993.
5. Beringer, A., Hoos, H. H., and Metzger, M.: GSAT versus simulated annealing, in Proc. ECAI 94, 11th Eur. Conf. Artificial Intelligence, Amsterdam, The Netherlands, Wiley, New York, 1994.
6. BNR-Prolog User's Manual, Bell Northern Research, Ottawa, Canada, 1988.
7. Bockmayr, A.: Logic Programming with Pseudo-Boolean Constraints, Research Report MPI-I-91-227, Max Planck Institut, Saarbrücken, Germany, 1991.
8. Bryant, R. E.: Graph based algorithms for boolean function manipulation, IEEE Trans. Comp. 35(8) (1986), 677-691.
9. Büttner, W. and Simonis, H.: Embedding boolean expressions into logic programming, J. Symbolic Computation 4 (1987), 191-205.
10. Carlsson, B., Carlsson, M., and Diaz, D.: Entailment of finite domain constraints, in 11th Int. Conf. Logic Programming, Santa Margherita, Italy, The MIT Press, 1994.
11. Codognet, P. and Diaz, D.: A minimal extension of the WAM for clp(FD), in 10th Int. Conf. Logic Programming, Budapest, Hungary, The MIT Press, 1993.
12. Codognet, P. and Diaz, D.: Boolean constraint solving using clp(FD), in Int. Logic Programming Symp., Vancouver, BC, Canada, MIT Press, 1993.
13. Codognet, P. and Diaz, D.: clp(B): Combining simplicity and efficiency in boolean constraint solving, in Programming Logic Implementation and Logic Programming, Springer-Verlag, Madrid, Spain, 1994.
14. Codognet, P. and Diaz, D.: Compiling constraint in clp(FD), J. Logic Programming (1995), in press.
15. Colmerauer, A.: An introduction to PrologIII, Comm. ACM, 28(4) (1990), 412-418.
16. Corsini, M. M. and Rauzy, A.: CLP(B): Do it yourself, in GULP'93, Italian Conf. Logic programming, Gizzeria Lido, Italy, 1993.
17. Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM 7 (1960), 201-215.
18. Dore, G. and Codognet, P.: A prototype compiler for Prolog with boolean constraints, in GULP'93 Italian Conf. Logic Programming, Gizzeria Lido, Italy, 1993
19. Gallo, G. and Urbani, G.: Algorithms for testing the satisfiability of propositional formulae, J. Logic Programming 7 (1989), 45-61.
20. Gent, I. P. and Wash, T.: Towards an understanding of Hill-climbing procedures for SAT, in Proc. of AAAI 93, 11th Nat. Conf. Artificial Intelligence, AAAI Press, 1993.
21. Haralick, R. M. and Elliot, G. L.: Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980), 263-313.
22. Hooker, J. N. and Fedjki, C.: Branch-and-Cut Solution of Inference Problems in Propositional Logic, Research Report, Carnegie-Mellon University, Pittsburgh, PA, 1987.
23. Jaffar, J. and Lassez, J.-L.: Constraint logic programming, in Principle of Programming Languages, Munich, Germany, January 1987.
24. Mackworth, A. K.: Consistency in networks of relations, Artificial Intelligence 8 (1977), 99-118.
25. Martin, U. and Nipkow, T.: Boolean unification - the story so far, J. of Symbolic Computation, 7 (1989), 191-205.
26. Massat, J.-L.: Using local consistency techniques to solve boolean constraints, in A. Colmerauer and F. Benhamou (eds), Constraint Logic Programming: Selected Research, The MIT Press, 1993.
27. Montanari, U.: Networks of constraints: Fundamental properties and application to picture processing, Information Science 7 (1974).
28. Nadel, B. A.: Constraint satisfaction algorithms, Computational Intelligence 5 (1989), 188-224.
29. Rauzy, A.: L'Evaluation Sémantique en Calcul Propositionnel, PhD Thesis, Université Aix-Marseille II, Marseille, France, January 1989.
30. Rauzy, A.: Adia, Technical Report, LaBRI, Université Bordeaux I, 1991.
31. Uribe, T. E. and Stickel, M. E.: Ordered binary decision diagrams and the Davis-Putnam procedure, in J.-P. Jouannaud (ed.), Proc. CCL'94 1st Int. Conf. Constraints in Computational Logic, Springer-Verlag, Munich, Germany, LNCS 845, 1994,
32. Rauzy, A.: Using enumerative methods for boolean unification, in A. Colmerauer and F. Benhamou (eds), Constraint Logic Programming: Selected Research, The MIT Press, 1993.
33. Rauzy, A.: Some Practical Results on the SAT Problem, Draft, 1993.
34. Saraswat, V.: The category of constraint systems is Cartesian-closed, in Proc. LICS 92, Logic in Computer Science, IEEE Press, 1992.
35. Scott, D. S.: Domains for denotational semantics, in ICALP'82, Int. Coll. Automata Languages and Programming, 1982.
36. Selman, B. and Kautz, H. A.: An empirical study of greedy local search for satisfiability testing, in Proc. AAAI 93, 11th Nat. Conf. on Artificial Intelligence, AAAI Press, 1993.
37. Selman, B., Levesque, H., and Mitchell, D.: A new method for solving hard satisfiability problems, in Proc. AAAI 92, 10th Nat. Conf. Artificial Intelligence, AAAI Press, 1992.
38. Simonis, H. and Dincbas, M.: Prepositional Calculus Problems in CHIP, ECRC, Technical Report TR-LP-48, 1990.
39. van Hentenryck, P.: Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, Cambridge, MA, 1989.
40. van Hentenryck, P., Saraswat, V., and Deville, Y.: Constraint processing in cc(FD), in A. Podelski (ed.), Constraint Programming: Basics and Trends, Springer-Verlag, LNCS 910, 1995.
41. van Hentenryck, P., Simonis, H., and Dincbas, M.: Constraint satisfaction using constraint logic programming, Artificial Intelligence, 58 (1992), 113-159.
42. van Hentenryck, P., Deville, Y., and Teng, C.-M.: A generic arc-consistency algorithm and its specializations, Artificial Intelligence 57 (1992), 291-321.
43. Warren, D. H. D.: An Abstract Prolog Instruction Set, Technical Report 309, SRI International, Oct. 1983.