Removing propagation redundant constraints in redundant modeling
From MaRDI portal
Publication:5277788
DOI10.1145/1276920.1276925zbMath1367.68262arXivcs/0412026OpenAlexW2070281006MaRDI QIDQ5277788
Peter J. Stuckey, Chiu Wo Choi, Jimmy Ho-man Lee
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0412026
Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Visual search tree profiling ⋮ Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ On redundant topological constraints ⋮ Algorithms for computing minimal equivalent subformulas ⋮ Automatic generation of redundant models for permutation constraint satisfaction problems ⋮ Propagation via lazy clause generation
Uses Software
This page was built for publication: Removing propagation redundant constraints in redundant modeling