Dynamic variable elimination during propagation solving
Pages 247 - 257
Abstract
Constraint propagation solvers interleave propagation (removing impossible values from variables domains) with search. Propagation is performed by executing propagators (removing values) implementing constraints (defining impossible values). In order to specify constraint problems with a propagation solver often many new intermediate variables need to be introduced. Each variable plays a role in calculating the value of some expression. But as search proceeds not all of these expressions will be of interest any longer, but the propagators implementing them will remain active. In this paper we show how we can analyse the propagation graph of the solver in linear time to determine intermediate variables that can be removed without effecting the result. Experiments show that applying this analysis can reduce the space and time requirements for constraint propagation on example problems
References
[1]
Sebastian Brand and Roland H. C. Yap. Towards "Propagation = Logic + Control". In Sandro Etalle and Miroslaw Truszczynski, editors, Logic Programming, 22nd International Conference, pages 102--116, 2006.]]
[2]
Chiu Wo Choi,Warwick Harvey, Jimmy Ho-Man Lee, and Peter J. Stuckey. Finite domain bounds consistency revisited. In AI 2006: Advances in Artificial Intelligence, volume 4304 of Lecture Notes in Computer Science, pages 49--58. Springer-Verlag, Berlin, Germany, 2006.]]
[3]
CSPLib. CSPLib: a problem library for constraints, 2006. Available from http://www.csplib.org.]]
[4]
Andreas Fordan and Roland H. C. Yap. Early projection in CLP(R). In Michael J.Maher and Jean-Francois Puget, editors, Principles and Practice of Constraint Programming - CP98, 4th International Conference, pages 177--191, 1998.]]
[5]
Gecode Team. Gecode: Generic constraint development environment, 2006. Available from http://www.gecode.org.]]
[6]
Ian P. Gent, Chris Jefferson, and Ian Miguel. Watched literals for constraint propagation in Minion. In Frédéric Benhamou, editor, Twelfth International Conference on Principles and Practice of Constraint Programming, volume 4204 of LNCS, pages 182--197, Nantes, France, September 2006. Springer.]]
[7]
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H.C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, 1992.]]
[8]
Mikael Z. Lagerkvist and Christian Schulte. Advisors for incremental propagation. In Christian Bessière, editor, Thirteenth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, pages 409--422, Providence, RI, USA, September 2007. Springer-Verlag.]]
[9]
A.D.Macdonald, P.J. Stuckey, and R.H.C. Yap. Redundancy of variables in CLP(R). In Logic Programming: Proceedings of the 1993 International Symposium, pages 75--93, Vancouver, Canada, October 1993.MIT Press.]]
[10]
Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99--118, 1977.]]
[11]
Jean-François Puget andMichel Leconte. Beyond the glass box: Constraints as objects. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 513--527, Portland, OR, USA, December 1995. The MIT Press.]]
[12]
Christian Schulte. Programming Constraint Services, volume 2302 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2002.]]
[13]
Christian Schulte and Peter J. Stuckey. Efficient constraint propagation engines. Transactions on Programming Languages and Systems, 2008. To appear.]]
[14]
Christian Schulte and Peter J. Stuckey. Speeding up constraint propagation. In M. Wallace, editor, Proceedings of the International Conference on Principle and Practice of Constraint Programming, volume 3258 of LNCS, pages 619--633. Springer-Verlag, 2004.]]
[15]
Christian Thiffault, Fahiem Bacchus, and Toby Walsh. Solving non-clausal formulas with DPLL search. In Mark Wallace, editor, Principles and Practice of Constraint Programming - CP 2004, 10th International Conference, pages 663--678, 2004.]]
Index Terms
- Dynamic variable elimination during propagation solving
Recommendations
Efficient constraint propagation engines
This article presents a model and implementation techniques for speeding up constraint propagation. Three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping track of ...
Removing propagation redundant constraints in redundant modeling
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. One common technique to improve the execution efficiency is to add ...
Variable ordering and constraint propagation for constrained CP-nets
A Conditional Preferences network (CP-net) is a known graphical model for representing qualitative preferences. In many real world applications we are often required to manage both constraints and preferences in an efficient way. The goal here is to ...
Comments
Information & Contributors
Information
Published In
July 2008
278 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 July 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
PPDP '08 Paper Acceptance Rate 24 of 48 submissions, 50%;
Overall Acceptance Rate 230 of 486 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 70Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View allView Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in