Abstract

Valid cuts are viewed in the operations research literature as inequalities that strengthen linear relaxations. The constraint satisfaction community has developed an alternate approach. Logical inference methods, such as the resolution method, can generate valid cuts that need not be inequalities and that are considered apart from any role in relaxations. They reduce backtracking by helping to achieve “consistency,” which is analogous to integrality in a polyhedral setting. The basic theory underlying these methods is presented here. Parallels with mathematical programming are pointed out, and resolution- based algorithms for generating cuts are proposed as a unifying theme. Specific topics include k-consistency, adaptive consistency, the dependency graph, and various measures of its width, including induced width and bandwidth.

Keywords

Search Tree Logic Programming Constraint Satisfaction Dependency Graph Constraint Satisfaction Problem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Arnborg, S., and A. Proskurowski (1986). Characterization and recognition of partial k-trees, SIAM Journal on Algebraic and Discrete Mathematics 7, 305–314.CrossRefGoogle Scholar
  2. [2]
    Barth, P. (1995). Logic-Based 0–1 Constraint Solving in Constraint Logic Programming, Dordrecht: Kluwer.Google Scholar
  3. [3]
    Bertele, U., and F. Brioschi (1972). Nonserial Dynamic Programming, New York: Academic Press.Google Scholar
  4. [4]
    Chvâtal, V. (1973). Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics 4, 305–337.CrossRefGoogle Scholar
  5. [5]
    Chhajed, D., and T. J. Lowe (1994). Solving structured multifacility location problems efficiently, Transportation Science 28, 104–115.CrossRefGoogle Scholar
  6. [6]
    Cooper, M. C. (1989). An optimal k-consistency algorithm,Artificial Intelligence 41, 89–95.Google Scholar
  7. [7]
    Dechter, R., and J. Pearl (1988). Tree-clustering schemes for constraint processing, Proceedings, National Conference on Artificial Intelligence (AAAI), 150–154.Google Scholar
  8. [8]
    Fourer, R. (1997). Proposed new AMPL features, http://achille.cs.belllabs.com/cm/cs/what/AMPL/NEW/FUTURE/logic.html.Google Scholar
  9. [9]
    Freuder, E. C. (1982). A sufficient condition for backtrack-free search, Journal of the ACM 29, 24–32.CrossRefGoogle Scholar
  10. [10]
    Ginsberg, M. L. (1993). Dynamic backtracking, Journal of Artificial Intelligence Research 1, 25–46.Google Scholar
  11. [11]
    Ginsberg, M. L., and D. A. McAllester (1994). GSAT and dynamic backtracking, Second Workshop on Principles and Practice of Constraint Programming, 216–225.Google Scholar
  12. [12]
    Gurari, E., and I. Sudborough (1984). Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem, Journal of Algorithms 5, 531–546.CrossRefGoogle Scholar
  13. [13]
    Haken, A. (1985). The intractability of resolution, Theoretical Computer Science 39, 297–308.CrossRefGoogle Scholar
  14. [14]
    Hooker, J. N. (1989). Input proofs and rank one cutting planes, ORSA Journal on Computing 1, 137–145.CrossRefGoogle Scholar
  15. [15]
    Hooker, J. N. (1992). Generalized resolution for 0–1 linear inequalities, Annals of Mathematics and Artificial Intelligence 6, 271–286.CrossRefGoogle Scholar
  16. [16]
    Hooker, J. N. (1994). Logic-based methods for optimization, in A. Borning, ed., Principles and Practice of Constraint Programming,Lecture Notes in Computer Science 874, 336–349.CrossRefGoogle Scholar
  17. [17]
    Hooker, J. N. (1994a). Tutorial in logic-based methods for optimization, CSTS Newsletter, Fall issue.Google Scholar
  18. [18]
    Hooker, J. N. (1995). Logic-based Benders decomposition, available on http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/jnh.html.Google Scholar
  19. [19]
    Hooker, J. N. and C. Fedjki (1990). Branch-and-cut solution of inference problems in propositional logic, Annals of Mathematics and AI 1, 123–140.Google Scholar
  20. [20]
    Hooker, J. N., and M. A. Osorio (1996). Mixed logical/linear programming, available at http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/jnh.html.Google Scholar
  21. [21]
    Jaffar, J., and J. L. Lassez (1987). Constraint logic programming, Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (POPL87), 111–119.Google Scholar
  22. [22]
    Jaffar, J., S. Michaylov, P. Stuckey and R. Yap (1992). A abstract machine for CLP(R+), Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 128–139.Google Scholar
  23. [23]
    McAllester, D. A. (1993). Partial order backtracking, manuscript, MIT AI Laboratory, 545 Technology Square, Cambridge, MA 02139 USA.Google Scholar
  24. [24]
    Quine, W. V. (1952). The problem of simplifying truth functions, American Mathematical Monthly 59, 521–531.CrossRefGoogle Scholar
  25. [25]
    Quine, W. V. (1952). A way to simplify truth functions, American Mathematical Monthly 62, 627–631.CrossRefGoogle Scholar
  26. [26]
    Robinson, J. A. (1965). A machine-oriented logic based on the resolution principle, Journal of the ACM 12, 23–41.CrossRefGoogle Scholar
  27. [27]
    Saxe, J. (1980). Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time, SIAM Journal on Algebraic and Discrete Methods 1, 363–369.CrossRefGoogle Scholar
  28. [28]
    Tsang, E. (1993). Foundations of Constraint Satisfaction, London: Academic Press.Google Scholar
  29. [29]
    Tseitin, G. S. (1968). On the complexity of derivations in the propositional calculus, in A. O. Slisenko, ed., Structures in Constructive Mathematics and Mathematical Logic, Part II (translated from Russian) 115–125.Google Scholar
  30. [30]
    Van Hentenryck, P. (1989). Constraint Satisfaction in Logic Programming, Cambridge, MA: MIT Press.Google Scholar
  31. [31]
    Van Hentenryck, P., and V. Saraswat (1996). Constraint programming, ACM Computing Surveys, December.Google Scholar
  32. [32]
    Zabih, R. (1990). Some applications of graph bandwidth to constraint satisfaction problems, Proceedings, National Conference on Artificial Intelligence (AAAI), 46–51.Google Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • J. N. Hooker
    • 1
  1. 1.Graduate School of Industrial AdministrationCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations