Arc and path consistence revisited
Artificial Intelligence
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using “weaker” functions for constraint propagation over real numbers
Proceedings of the 1999 ACM symposium on Applied computing
The OPL optimization programming language
The OPL optimization programming language
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Constraint-Based Scheduling
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
When do bounds and domain propagation lead to the same search space?
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming finite-domain constraint propagators in Action Rules
Theory and Practice of Logic Programming
Principles of Constraint Programming
Principles of Constraint Programming
Advisors for incremental propagation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Dynamic variable elimination during propagation solving
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Constraint programming for itemset mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
CHR for Imperative Host Languages
Constraint Handling Rules
Learning How to Propagate Using Random Probing
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Advisors for incremental propagation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Maintaining state in propagation solvers
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A 25-year perspective on logic programming
Integrating constraint programming and itemset mining
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
Using constraint programming to verify DOPLER variability models
Proceedings of the 5th Workshop on Variability Modeling of Software-Intensive Systems
Explaining the cumulative propagator
Constraints
Itemset mining: A constraint programming perspective
Artificial Intelligence
Octagonal domains for continuous constraints
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An overview of ciao and its design philosophy
Theory and Practice of Logic Programming - Prolog Systems
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
FDCC: a combined approach for solving constraints over finite domains and arrays
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Explaining propagators for s-DNNF circuits
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Maximising the net present value for resource-constrained project scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Constraint propagation as the core of local search
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
View-based propagator derivation
Constraints
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Relating constraint answer set programming languages and algorithms
Artificial Intelligence
Explaining circuit propagation
Constraints
| Hi-index | 0.00 |
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 which propagators are at fixpoint, choosing which propagator to apply next, and how to combine several propagators for the same constraint. We show how idempotence reasoning and events help track fixpoints more accurately. We improve these methods by using them dynamically (taking into account current variable domains to improve accuracy). We define priority-based approaches to choosing a next propagator and show that dynamic priorities can improve propagation. We illustrate that the use of multiple propagators for the same constraint can be advantageous with priorities, and introduce staged propagators that combine the effects of multiple propagators with priorities for greater efficiency.