Skip to main content
SpringerLink
Log in

Dominance Driven Search

  • Conference paper
Book cover Principles and Practice of Constraint Programming (CP 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8124))

  • 2467 Accesses

Abstract

Recently, a generic method for identifying and exploiting dominance relations using dominance breaking constraints was proposed. In this method, sufficient conditions for a solution to be dominated are identified and these conditions are used to generate dominance breaking constraints which prune off the dominated solutions. We propose to use these dominance relations in a different way in order to boost the search for good/optimal solutions. In the new method, which we call dominance jumping, when search reaches a point where all solutions in the current domain are dominated, rather than simply backtrack as in the original dominance breaking method, we jump to the subtree which dominates the current subtree. This new strategy allows the solver to move from a bad subtree to a good one, significantly increasing the speed with which good solutions can be found. Experiments across a range of problems show that the method can be very effective when the original search strategy was not very good at finding good solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 73–87. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Procs. of ECAI 2004, pp. 146–150 (2004)

    Google Scholar 

  3. Chu, G., Stuckey, P.J.: A generic method for identifying and exploiting dominance relations. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 6–22. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning, pp. 148–159. Morgan Kaufmann (1996)

    Google Scholar 

  5. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352–366. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Focacci, F., Shaw, P.: Pruning sub-optimal search branches using local search. In: CPAIOR, vol. 2, pp. 181–189 (2002)

    Google Scholar 

  8. Frisch, A.M., Jefferson, C., Miguel, I.: Constraints for Breaking More Row and Column Symmetries. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 318–332. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. de la Banda, M.G., Stuckey, P.J., Chu, G.: Solving talent scheduling with dynamic programming. INFORMS Journal on Computing 23(1), 120–137 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gargani, A., Refalo, P.: An efficient model and strategy for the steel mill slab design problem. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 77–89. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Gent, I., Smith, B.M.: Symmetry breaking in constraint programming. In: 14th European Conference on Artificial Intelligence, pp. 599–603 (2000)

    Google Scholar 

  12. Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence (1980)

    Google Scholar 

  13. Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: Veloso, M.M. (ed.) Proc. of IJCAI 2007, pp. 131–136 (2007)

    Google Scholar 

  14. Luks, E.M., Roy, A.: The Complexity of Symmetry-Breaking Formulas. Ann. Math. Artif. Intell. 41(1), 19–45 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Miller, H.E., Pierskalla, W.P., Rath, G.J.: Nurse scheduling using mathematical programming. Operations Research, 857–870 (1976)

    Google Scholar 

  16. Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58(1), 161–205 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Procs. of DAC 2001, pp. 530–535 (2001)

    Google Scholar 

  18. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: Towards a Standard CP Modelling Language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = Lazy Clause Generation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544–558. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Puget, J.F.: On the Satisfiability of Symmetrical Constrained Satisfaction Problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350–361. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  21. Puget, J.F.: Breaking symmetries in all different problems. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proc. of IJCAI 2005, pp. 272–277. Professional Book Center (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Victoria Laboratory, National ICT Australia, Australia

    Peter J. Stuckey

  2. Department of Computing and Information Systems, University of Melbourne, Australia

    Geoffrey Chu & Peter J. Stuckey

Authors
  1. Geoffrey Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter J. Stuckey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information and Communication Technology, KTH Royal Institute of Technology, P.O. Box Forum 120, 16440, Kista, Sweden

    Christian Schulte

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chu, G., Stuckey, P.J. (2013). Dominance Driven Search. In: Schulte, C. (eds) Principles and Practice of Constraint Programming. CP 2013. Lecture Notes in Computer Science, vol 8124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40627-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40627-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40626-3

  • Online ISBN: 978-3-642-40627-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation