GAC Via Unit Propagation
From MaRDI portal
Publication:3523055
DOI10.1007/978-3-540-74970-7_12zbMATH Open1145.68502OpenAlexW1531545757MaRDI QIDQ3523055FDOQ3523055
Authors: 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
Recommendations
Cites Work
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Efficient CNF encoding of Boolean cardinality constraints
- Revisiting the Sequence Constraint
- Principles and Practice of Constraint Programming – CP 2004
- Decomposing Global Grammar Constraints
- Title not available (Why is that?)
- A comparison between SAT and CSP techniques
- Propagation in CSP and SAT
Cited In (14)
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- Computing AES related-key differential characteristics with constraint programming
- Bounds on the size of PC and URC formulas
- Synthesis of domain specific CNF encoders for bit-vector solvers
- The power of propagation: when GAC is enough
- Title not available (Why is that?)
- A lower bound on CNF encodings of the at-most-one constraint
- Automated Reasoning with Analytic Tableaux and Related Methods
- New Encodings of Pseudo-Boolean Constraints into CNF
- Knowledge compilation with empowerment
- Propagation complete encodings of smooth DNNF theories
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Computational protein design as an optimization problem
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
This page was built for publication: GAC Via Unit Propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523055)
