The following pages link to Benjamin Kiesl (Q1680259):
Displaying 12 items.
- A little blocked literal goes a long way (Q1680260) (← links)
- Extended resolution simulates \({\mathsf{DRAT}}\) (Q1799112) (← links)
- QRAT polynomially simulates \(\forall\)-Exp+Res (Q2181931) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
- Short proofs without new variables (Q2405245) (← links)
- A unifying principle for clause elimination in first-order logic (Q2405255) (← links)
- Super-Blocked Clauses (Q2817910) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- (Q4553279) (← links)
- (Q4631192) (← links)
- Blocked Clauses in First-Order Logic (Q4645725) (← links)