Pages that link to "Item:Q5894155"
From MaRDI portal
The following pages link to Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5894155):
Displaying 25 items.
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- Learning a propagation complete formula (Q2170198) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- Knowledge Compilation with Empowerment (Q2891394) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
- On Linear Resolution (Q5015599) (← links)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)
- New stochastic local search approaches for computing preferred extensions of abstract argumentation (Q5145445) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Constructing Hard Examples for Graph Isomorphism (Q5377355) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
- Classes of hard formulas for QBF resolution (Q6488807) (← links)
- Should Decisions in QCDCL Follow Prefix Order? (Q6493568) (← links)
