Pages that link to "Item:Q1680253"
From MaRDI portal
The following pages link to On tackling the limits of resolution in SAT solving (Q1680253):
Displayed 6 items.
- Learning a propagation complete formula (Q2170198) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- Circular (Yet Sound) Proofs in Propositional Logic (Q6116357) (← links)