The Role of Commutativity in Constraint Propagation Algorithms
Krzysztof R. Apt
Abstract
Constraint propagation algorithms form an important part of most of the constraint programming systems. We provide here a simple, yet very general framework that allows us to explain several constraint propagation algorithms in a systematic way. In this framework we proceed in two steps. First, we introduce a generic iteration algorithm on partial orderings and prove its correctness in an abstract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the notions commutativity and semi-commutativity, we show that the AC-3, PC-2, DAC and DPC algorithms for achieving (directional) arc consistency and (directional) path consistency are instances of a single generic algorithm. The work reported here extends and simplifies that of Apt Apt99b.
Create a lesson
Related papers
SysPilot: Cross-Library Performance Autotuning via Library Performance Contracts
Yineng Yan, Haowei Chen, Christopher J. Rossbach
Memory-Access Profiling for Early Multicore Interference Awareness in Embedded Systems
Jean-Baptiste Lefoul, Ahmad Shahnejat Bushehri, Alaric Chan Lock et al.
Easy Multi-Precision Acceleration via Vectorization
Chansup Byun, Piotr Luszczek, Jeremy Kepner et al.
Software Design Patterns for Latency Measurements with eBPF in SDN Environments
Pedro Lucas M. S. Rosa, Bruno L. Dalmazo, Leticia S. Machado et al.
Trustworthiness as a Measurement Structure for Task Conformance in 6G Service Chains
Bin Han, Xintong Ling, Muxia Sun et al.
Warpline: Binary-Level Tracing and Unified Evidence for Agentic GPU Kernel Optimization
Junyu Yin, Vinod Grover, Keren Zhou