Pages that link to "Item:Q3623009"
From MaRDI portal
The following pages link to Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (Q3623009):
Displaying 17 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- Extended clause learning (Q622116) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Clause trees: A tool for understanding and implementing resolution in automated reasoning (Q1402732) (← links)
- Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
- On Linear Resolution (Q5015599) (← links)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning (Q5387867) (← links)
- A resolution proof system for dependency stochastic Boolean satisfiability (Q6050766) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
- Regular resolution effectively simulates resolution (Q6551714) (← links)
