Guillaume Burel

Available identifiers

Publication	Date of Publication	Type
Linking focusing and resolution with selection	2021-08-04	Paper
First-order automated reasoning with theories: when deduction modulo theory meets practice	2020-11-02	Paper
Linking focusing and resolution with selection	2020-09-11	Paper
A Completion Method to Decide Reachability in Rewrite Systems	2017-02-27	Paper
Cut Admissibility by Saturation	2014-07-24	Paper
Detection of First Order Axiomatic Theories	2013-09-20	Paper
Experimenting with deduction modulo	2011-07-29	Paper
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo	2011-05-26	Paper
Embedding Deduction Modulo into a Prover	2010-09-03	Paper
Regaining cut admissibility in deduction modulo using abstract completion	2010-02-26	Paper
Automating theories in intuitionistic logic	2010-01-07	Paper
Unbounded Proof-Length Speed-Up in Deduction Modulo	2009-03-05	Paper
Cut Elimination in Deduction Modulo by Abstract Completion	2008-01-04	Paper
Completion Is an Instance of Abstract Canonical System Inference	2007-09-07	Paper

This page was built for person: Guillaume Burel