Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- 15 March 2014
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 70 (4) , 399-431
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based PlanningLogical Methods in Computer Science, 2007
- Formal methods for the validation of automotive product configuration dataArtificial Intelligence for Engineering Design, Analysis and Manufacturing, 2003
- On the minimality and global consistency of row-convex constraint networksJournal of the ACM, 1995
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Recognizing disguised NR(1) instances of the satisfiability problemJournal of Algorithms, 1980
- Renaming a Set of Clauses as a Horn SetJournal of the ACM, 1978
- Unit Refutations and Horn SetsJournal of the ACM, 1974
- Non-Cooperative GamesAnnals of Mathematics, 1951