The following pages link to Guillaume Burel (Q2209543):
Displaying 14 items.
- 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)
- Detection of First Order Axiomatic Theories (Q2849492) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo (Q3003304) (← links)
- Embedding Deduction Modulo into a Prover (Q3586040) (← links)
- Unbounded Proof-Length Speed-Up in Deduction Modulo (Q3608434) (← links)
- Automating Theories in Intuitionistic Logic (Q3655199) (← links)
- (Q5005105) (← links)
- Linking Focusing and Resolution with Selection (Q5121269) (← links)
- Cut Admissibility by Saturation (Q5170812) (← links)
- Experimenting with Deduction Modulo (Q5200022) (← links)
- Cut Elimination in Deduction Modulo by Abstract Completion (Q5434502) (← links)
- Completion Is an Instance of Abstract Canonical System Inference (Q5757934) (← links)
