A decomposition-based implementation of search strategies

ACM Transactions on Computational Logic

Volumn 5, Issue 2, 2004, Pages 351-383

  Michel, Laurent ^a,b   Van Hentenryck, Pascal ^a,c  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c Brown Univerity   (United States)

Author keywords

Combinatorial optimization; Constraint programming; Search

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINT PROGRAMMING; DECOMPOSITION ALGORITHMS;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SOFTWARE; ITERATIVE METHODS; LOGIC DESIGN; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); THEOREM PROVING;

CONSTRAINT THEORY;

EID: 4444347375     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/976706.976714     Document Type: Article

References (36)

1. BAPTISTE, P. AND PAPE, C. L. 1995. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-95). 600-606.
2. CHEN, H., GOMES, C., AND SELMAN, B. 2001. Formal models of heavy-tailed behavior in combinatorial search. In Proceedings of the 7th International Conference on the Principles and Practice of Constraint Programming (CP'01). Cyprus.
3. CLOCKSIN, W. AND ALSHAWI, H. 1988. A method for efficiently executing Horn clause programs using multiple processors. New Gen. Comput. 5, 361-376.
4. COLMERAUER, A. 1990. An introduction to Prolog III. Commun. ACM 28, 4, 412-418.
5. EL SAKKOUT, H. AND WALLACE, M. 2000. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5, 4 (Oct.).
6. FIKES, R. 1968. A heuristic program for solving problems stated as non-deterministic procedures. Ph.D. dissertation, Comput. Sci. Dept., Carnegie-Mellon Univ. Pittsburgh, Pa.
7. FREUDER, E. AND HUBBE, P. 1995. A disjunctive decomposition control schema for constraint satisfaction. In Principles and Practice of Constraint Programming, V. Saraswat and P. V. Hentenryck, Eds. The MIT Press, Cambridge, Mass.
8. HARALICK, R. AND ELLIOT, G. 1980. Increasing tree search efficiency for constraint satisfaction problems. Artif. Intel. 14, 263-313.
9. HARVEY, W. AND GINSBERG, M. 1995. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (Montreal, Ont., Canada).
10. HOOKER, J. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York.
11. HOOKER, J., OTTOSSON, G., THORNSTEINSSON, E., AND KIM, H.-J. 2001. A scheme for unifying optimization and constraint satisfaction methods. Knowl. Eng. Rev. 15, 11-30.
12. JAFFAR, J. AND LASSEZ, J.-L. 1987. Constraint logic programming. In Proceedings of POPL-87 (Munich, Germany).
13. KNUTH, D. 1998. Sorting and Searching. In The Art of Computer Programming, vol. 3 (Second Edition). Addison-Wesley, Reading, Mass.
14. KORF, R. 1996. Improved limited discrepancy search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96) (Portland, Ore.). 209-215.
15. LABURTHE, F. AND CASEAU, Y. 1998. SALSA: A language for search algorithms. In Proceedings of the 4h International Conference on the Principles and Practice of Constraint Programming (CP'98) (Pisa, Italy).
16. LAURIERE, J.-L. 1978. A language and a program for stating and solving combinatorial problems. Artif. Intel. 10, 1, 29-127.
17. MACKWORTH, A. 1977. Consistency in networks of relations. Artif. Intel. 8, 1, 99-118.
18. MESEGUER, P. 1997. Interleaved depth-first search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (Nagoya, Japan).
19. MONTANARI, U. 1974. Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7, 2, 95-132.
20. NUIJTEN, W. 1994. Time and resource constrained scheduling: A constraint satisfaction approach. Ph.D. dissertation, Eindhoven University of Technology.
21. PERRON, L. 1999. Search procedures and parallelism in constraint programming. In Proceedings of the 5th International Conference on the Principles and Practice of Constraint Programming (CP'99) (Alexandra, Va.).
22. PLOTKIN, G. 1981. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, CS Department, University of Aarhus.
23. REFALO, P. 1999. Tight cooperation and its application in piecewise linear optimization. In Proceedings of the 5th International Conference on the Principles and Practice of Constraint Programming (CP'99) (Alexandra, Va.).
24. lin) Revised. In Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (Bonn, Germany).
25. SALKIN, H. 1970. On the merit of the generalized origin and restarts in implicit enumeration. Oper. Res. 18, 549-554.
26. SCHULTE, C. 1997. Programming constraint inference engines. In Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (Schloss Hagenberg, Linz, Austria). Lecture Notes in Computer Science vol. 1330. Springer-Verlag, New York, 519-533.
27. SCHULTE, C. 2000. Programming deep concurrent constraint combinators. In Proceedings of the 2nd International Workshop on Practical Aspects of Declarative Languages (PADL'00) (Boston, Mass.) Lecture Notes in Computer Science vol. 1753. Springer-Verlag, New York.
28. SHAPIRO, E. 1987. An OR-parallel execution algorithm for PROLOG and Its FCP implementation. In Proceedings of the 4th International Conference on Logic Programming (Melbourne, Australia). 311-337.
29. VAN HENTENRYCK, P. 1989. Constraint Satisfaction in Logic Programming. Logic Programming Series, The MIT Press, Cambridge, Mass.
30. VAN HENTENRYCK, P. 1990. Incremental Constraint Satisfaction in Logic Programming. In Proceedings of the 7th International Conference on Logic Programming (Jerusalem, Israel).
31. VAN HENTENRYCK, P. 1999. The OPL Optimization Programming Language. The MIT Press, Cambridge, Mass.
32. VAN HENTENRYCK, P. AND LE PROVOST, T. 1991. Incremental constraint satisfaction in logic programming. New Generation Computing. (Selected Paper from ICLP'90).
33. VAN HENTENRYCK, P., PERRON, L., AND PUGET, J.-F. 2000. Search and strategies in OPL. ACM Transactions on Computational Logic 1, 2 (October), 1-36.
34. WALSH, T. 1997. Depth-bounded discrepancy search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence. (Nagoya, Japan).
35. WALTZ, D. 1972. Generating semantic descriptions from drawings of scenes with shadows. Tech. Rep. AI271. MIT, Cambridge, Mass, Nov.
36. WOLSEY, L. 1998. Integer Programming. Wiley, New York.