The following pages link to Cut Admissibility by Saturation (Q5170812):
Displaying 5 items.
- Resolution is cut-free (Q972424) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Regaining cut admissibility in deduction modulo using abstract completion (Q2266989) (← links)
- About folding-unfolding cuts and cuts modulo (Q2752529) (← links)
- Linking focusing and resolution with selection (Q5005105) (← links)