Skip to main content
Springer Nature Link
Log in

Dynamic Analysis of Bounds Versus Domain Propagation

  • Conference paper
Logic Programming (ICLP 2008)

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

Included in the following conference series:

  • 1210 Accesses

Abstract

Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search space is traversed.

This paper introduces a dynamic yet considerably simpler approach to uncover the same information. The information is obtained by a linear time traversal of an analysis graph that straightforwardly reflects the properties of propagators implementing constraints. Experiments confirm that the simple dynamic method is efficient and that it can be used interleaved with search, taking advantage of the simplification of the constraint graph that arises from search.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space? ACM Trans. Program. Lang. Syst. 27(3), 388–425 (2005)

    Article  Google Scholar 

  2. Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Choi, C.W., Harvey, W., Lee, J.H.M., Stuckey, P.J.: Finite domain bounds consistency revisited. In: Sattar, A., Kang, B.-h. (eds.) AI 2006. LNCS, vol. 4304, pp. 49–58. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Gecode Team: Gecode: Generic constraint development environment (2006), http://www.gecode.org

Download references

Author information

Authors and Affiliations

  1. ICT, KTH - Royal Institute of Technology, Sweden

    Christian Schulte

  2. National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia

    Peter J. Stuckey

Authors
  1. Christian Schulte
    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. Clayton School of Information Technology, Monash University, Australia

    Maria Garcia de la Banda

  2. Department of Computer Science, New Mexico State University, NM 88003, Las Cruces, USA

    Enrico Pontelli

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schulte, C., Stuckey, P.J. (2008). Dynamic Analysis of Bounds Versus Domain Propagation. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89982-2_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89981-5

  • Online ISBN: 978-3-540-89982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics