Towards "propagation = logic + control"

Authors:
Sebastian Brand;Roland H. C. Yap
Affiliations:
National ICT Australia, Victoria Research Lab, Melbourne, Australia;School of Computing, National University of Singapore, Singapore
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 9
Cited 4

Concurrent constraint programming

Concurrent constraint programming
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Algorithm = logic + control

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Global Constraints for Lexicographic Orderings

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constrained decision diagrams

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Propagating logical combinations of constraints

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Dynamic variable elimination during propagation solving

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming

Artificial Intelligence
Half reification and flattening

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint propagation algorithms implement logical inference. For efficiency, it is essential to control whether and in what order basic inference steps are taken. We provide a high-level framework that clearly differentiates between information needed for controlling propagation versus that needed for the logical semantics of complex constraints composed from primitive ones. We argue for the appropriateness of our controlled propagation framework by showing that it captures the underlying principles of manually designed propagation algorithms, such as literal watching for unit clause propagation and the lexicographic ordering constraint. We provide an implementation and benchmark results that demonstrate the practicality and efficiency of our framework.