default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Burel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Guillaume Burel, Gilles Dowek:
How can we prove that a proof search method is not an instance of another? CoRR abs/2304.11882 (2023)- [i1]Ali Assaf, Guillaume Burel, Raphaël Cauderlier, David Delahaye, Gilles Dowek, Catherine Dubois, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant, Ronan Saillard:
Dedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory. CoRR abs/2311.07185 (2023) - 2020
- [j4]Guillaume Burel, Guillaume Bury, Raphaël Cauderlier, David Delahaye
, Pierre Halmagrand, Olivier Hermant:
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice. J. Autom. Reason. 64(6): 1001-1050 (2020) - [j3]Guillaume Burel:
Linking Focusing and Resolution with Selection. ACM Trans. Comput. Log. 21(3): 18:1-18:30 (2020)
2010 – 2019
- 2019
- [c17]Catherine Dubois, Virgile Prevosto, Guillaume Burel:
Teaching Formal Methods to Future Engineers. FMTea 2019: 69-80 - [c16]Mohamed Yacine El Haddad, Guillaume Burel, Frédéric Blanqui:
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). PxTP 2019: 27-35 - 2018
- [c15]Guillaume Burel:
Linking Focusing and Resolution with Selection. MFCS 2018: 9:1-9:14 - 2015
- [c14]Guillaume Burel, Gilles Dowek, Ying Jiang:
A Completion Method to Decide Reachability in Rewrite Systems. FroCos 2015: 205-219 - [c13]Ali Assaf, Guillaume Burel:
Translating HOL to Dedukti. PxTP@CADE 2015: 74-88 - 2014
- [c12]Guillaume Burel:
Cut Admissibility by Saturation. RTA-TLCA 2014: 124-138 - 2013
- [c11]Guillaume Burel:
A Shallow Embedding of Resolution and Superposition Proofs into the λΠ-Calculus Modulo. PxTP@CADE 2013: 43-57 - [c10]Guillaume Burel, Simon Cruanes:
Detection of First Order Axiomatic Theories. FroCos 2013: 229-244 - 2012
- [c9]Mathieu Boespflug, Guillaume Burel:
CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo. PxTP 2012: 44-50 - 2011
- [j2]Guillaume Burel:
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo. Log. Methods Comput. Sci. 7(1) (2011) - [c8]Guillaume Burel:
Experimenting with Deduction Modulo. CADE 2011: 162-176 - 2010
- [j1]Guillaume Burel, Claude Kirchner:
Regaining cut admissibility in deduction modulo using abstract completion. Inf. Comput. 208(2): 140-164 (2010) - [c7]Guillaume Burel:
Embedding Deduction Modulo into a Prover. CSL 2010: 155-169
2000 – 2009
- 2009
- [b1]Guillaume Burel:
Bonnes démonstrations en déduction modulo. (Good proofs in deduction modulo). Henri Poincaré University, Nancy, France, 2009 - [c6]Guillaume Burel:
Automating Theories in Intuitionistic Logic. FroCoS 2009: 181-197 - [c5]Guillaume Burel, Gilles Dowek:
How can we prove that a proof search method is not an instance of another? LFMTP 2009: 84-87 - 2008
- [c4]Guillaume Burel:
A First-Order Representation of Pure Type Systems Using Superdeduction. LICS 2008: 253-263 - 2007
- [c3]Guillaume Burel:
Unbounded Proof-Length Speed-Up in Deduction Modulo. CSL 2007: 496-511 - [c2]Guillaume Burel, Claude Kirchner:
Cut Elimination in Deduction Modulo by Abstract Completion. LFCS 2007: 115-131 - 2006
- [c1]Guillaume Burel, Claude Kirchner:
Completion Is an Instance of Abstract Canonical System Inference. Essays Dedicated to Joseph A. Goguen 2006: 497-520
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
