Complexity issues related to propagation completeness
- 31 October 2013
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 203, 19-34
Abstract
No abstract availableKeywords
Funding Information
- Charles University Grant Agency (266111, 265511, 600112)
- Czech Science Foundation (P202/10/1188)
This publication has 30 references indexed in Scilit:
- Knowledge Compilation with Empowerment2012
- Universal Booleanization of Constraint Models2008
- Encodings of the Sequence Constraint2007
- GAC Via Unit Propagation2007
- A perspective on certain polynomial-time solvable classes of satisfiabilityDiscrete Applied Mathematics, 2003
- GRASP-A new search algorithm for satisfiability2002
- Chaff: engineering an efficient SAT solver2002
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- On finding solutions for extended Horn formulasInformation Processing Letters, 1995
- A machine program for theorem-provingCommunications of the ACM, 1962