Guillaume Burel

MaRDI QIDQ2209543zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Journal of Automated Reasoning	2020-11-02	Paper
Linking focusing and resolution with selection ACM Transactions on Computational Logic	2020-09-11	Paper
A Completion Method to Decide Reachability in Rewrite Systems Frontiers of Combining Systems	2017-02-27	Paper
Cut Admissibility by Saturation Lecture Notes in Computer Science	2014-07-24	Paper
Detection of First Order Axiomatic Theories Frontiers of Combining Systems	2013-09-20	Paper
Experimenting with deduction modulo Lecture Notes in Computer Science	2011-07-29	Paper
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo Logical Methods in Computer Science	2011-05-26	Paper
Embedding Deduction Modulo into a Prover Computer Science Logic	2010-09-03	Paper
Regaining cut admissibility in deduction modulo using abstract completion Information and Computation	2010-02-26	Paper
Automating theories in intuitionistic logic Frontiers of Combining Systems	2010-01-07	Paper
Unbounded Proof-Length Speed-Up in Deduction Modulo Computer Science Logic	2009-03-05	Paper
Cut Elimination in Deduction Modulo by Abstract Completion Logical Foundations of Computer Science	2008-01-04	Paper
Completion Is an Instance of Abstract Canonical System Inference Algebra, Meaning, and Computation	2007-09-07	Paper

Research outcomes over time

This page was built for person: Guillaume Burel