GAC Via Unit Propagation

DOI10.1007/978-3-540-74970-7_12zbMath1145.68502OpenAlexW1531545757MaRDI QIDQ3523055

Fahiem Bacchus

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

Knowledge Compilation with Empowerment ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ The power of propagation: when GAC is enough ⋮ Computational protein design as an optimization problem ⋮ Bounds on the size of PC and URC formulas ⋮ A lower bound on CNF encodings of the at-most-one constraint ⋮ Computing AES related-key differential characteristics with constraint programming ⋮ Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers ⋮ New Encodings of Pseudo-Boolean Constraints into CNF ⋮ Propagation complete encodings of smooth DNNF theories ⋮ Set constraint model and automated encoding into SAT: application to the social golfer problem

Cites Work

• A comparison between SAT and CSP techniques
• Decomposing Global Grammar Constraints
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Propagation in CSP and SAT
• Revisiting the Sequence Constraint
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item

This page was built for publication: GAC Via Unit Propagation