Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
From MaRDI portal
Recommendations
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- An Exponential Lower Bound for Width-Restricted Clause Learning
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
- On the power of clause-learning SAT solvers as resolution engines
- Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
- Logic Programming and Nonmonotonic Reasoning
Cited in
(44)- A note about k-DNF resolution
- What is answer set programming to propositional satisfiability
- On dedicated CDCL strategies for PB solvers
- Learning a propagation complete formula
- Propositional proof systems based on maximum satisfiability
- Strong ETH and resolution via games and the multiplicity of strategies
- Clause size reduction with all-UIP learning
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Trade-offs between time and memory in a tighter model of CDCL SAT solvers
- On Q-resolution and CDCL QBF solving
- Knowledge compilation with empowerment
- Space complexity in polynomial calculus
- An upper bound for resolution size: characterization of tractable SAT instances
- An Exponential Lower Bound for Width-Restricted Clause Learning
- A note on SAT algorithms and proof complexity
- Algorithms for computing minimal equivalent subformulas
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
- On linear resolution
- On CDCL-Based Proof Systems with the Ordered Decision Strategy
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Bounds on the size of PC and URC formulas
- Narrow proofs may be maximally long
- Constructing hard examples for graph isomorphism
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
- On the power of clause-learning SAT solvers as resolution engines
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Propositional proof complexity
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- Are hitting formulas hard for resolution?
- Classes of hard formulas for QBF resolution
- Should Decisions in QCDCL Follow Prefix Order?
- Dependency schemes in CDCL-based QBF solving: a proof-theoretic study
- Using execution logs for improving pseudo-Boolean propagation
- Speeding up pseudo-Boolean propagation
- The relative strength of \#SAT proof systems
- Bounded Henkin quantifiers and the exponential time hierarchy
- Runtime vs. extracted proof size: an exponential gap for CDCL on QBFs
- Improving and understanding the power of satisfaction-driven clause learning
- Dependency schemes in CDCL-based QBF solving: a proof-theoretic study
- QCDCL with cube learning or pure literal elimination -- what is best?
- Understanding the relative strength of QBF CDCL solvers and QBF resolution
- Polynomial calculus for quantified Boolean logic: lower bounds through circuits and degree
- Extended resolution clause learning via dual implication points
- The relative strength of \#SAT proof systems
This page was built for publication: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894155)
