Publication:5715680
From MaRDI portal
zbMath1080.68651arXiv1107.0044MaRDI QIDQ5715680
Ashish Sabharwal, Henry A. Kautz, P. W. Beame
Publication date: 4 January 2006
Full work available at URL: https://arxiv.org/abs/1107.0044
Related Items
Present and Future of Practical SAT Solving, Parameterized Complexity of DPLL Search Procedures, Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution, Towards NP-P via proof complexity and search, A note on SAT algorithms and proof complexity, On the power of clause-learning SAT solvers as resolution engines, Extended clause learning, Producing and verifying extremely large propositional refutations, Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT, A comparative runtime analysis of heuristic algorithms for satisfiability problems, Formalization and implementation of modern SAT solvers, Substitutions into propositional tautologies, A generative power-law search tree model, \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver, Pool resolution is NP-hard to recognize, Conflict-driven answer set solving: from theory to practice, Resolution cannot polynomially simulate compressed-BFS, Limitations of restricted branching in clause learning, Constructive generation of very hard 3-colorability instances, The state of SAT, Faster Extraction of High-Level Minimal Unsatisfiable Cores, On Freezing and Reactivating Learnt Clauses, Generalized Conflict-Clause Strengthening for Satisfiability Solvers, Empirical Study of the Anatomy of Modern Sat Solvers, A Generalized Framework for Conflict Analysis, Limitations of Restricted Branching in Clause Learning, Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases, Some applications of propositional logic to cellular automata
Uses Software
