Pages that link to "Item:Q543613"
From MaRDI portal
The following pages link to On the power of clause-learning SAT solvers as resolution engines (Q543613):
Displaying 35 items.
- Symmetry in Gardens of Eden (Q396822) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- Proof complexity of modal resolution (Q832717) (← 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)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- QBFFam: a tool for generating QBF families from proof complexity (Q2118282) (← links)
- Lower bounds for QCDCL via formula gauge (Q2118284) (← 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)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- A simple proof of QBF hardness (Q2656352) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- Incremental Determinization (Q2818028) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- Knowledge Compilation with Empowerment (Q2891394) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- Oblivious bounds on the probability of boolean functions (Q2943565) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
- Machine learning and logic: a new frontier in artificial intelligence (Q6056641) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← 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)
