From chaotic iteration to constraint propagation
From MaRDI portal
Publication:4571938
DOI10.1007/3-540-63165-8_163zbMath1401.68282OpenAlexW1556356866MaRDI QIDQ4571938
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/17341
Related Items
Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
Cites Work
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Network-based heuristics for constraint-satisfaction problems
- A generic arc-consistency algorithm and its specializations
- Consistency in networks of relations
- Value constraints in the CLP scheme
- Local and global relational consistency
- Constraint relaxation may be perfect
- Chaotic relaxation
- Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14.1]
- Applying interval arithmetic to real, integer, and boolean constraints
- Unnamed Item
- Unnamed Item