Pages that link to "Item:Q1680253"
From MaRDI portal
The following pages link to On tackling the limits of resolution in SAT solving (Q1680253):
Displaying 10 items.
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Learning a propagation complete formula (Q2170198) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- (Q3620438) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- Theory and Applications of Satisfiability Testing (Q5325849) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- Polynomial calculus for optimization (Q6665696) (← links)