default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThierry Boy de la Tour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c28]Thierry Boy de la Tour:
Subsumptions of Algebraic Rewrite Rules. ACT 2023: 20-38- [i5]Thierry Boy de la Tour:
Algebraic Monograph Transformations. CoRR abs/2303.01137 (2023) - 2020
- [j5]Thierry Boy de la Tour, Rachid Echahed:
Parallel rewriting of attributed graphs. Theor. Comput. Sci. 848: 106-132 (2020) - [c27]Thierry Boy de la Tour:
Monographs, a Category of Graph Structures. WADT 2020: 54-74 - [c26]Thierry Boy de la Tour, Rachid Echahed:
Parallel Coherent Graph Transformations. WADT 2020: 75-97 - [c25]Thierry Boy de la Tour, Rachid Echahed:
Combining Parallel Graph Rewriting and Quotient Graphs. WRLA@ETAPS 2020: 1-18 - [c24]Thierry Boy de la Tour:
Parallel Independence in Attributed Graph Rewriting. TERMGRAPH@FSCD 2020: 62-77 - [p2]Thierry Boy de la Tour, Ricardo Caferra, Nicola Olivetti, Nicolas Peltier, Camilla Schwind:
Automated Deduction. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 53-81
2010 – 2019
- 2019
- [i4]Thierry Boy de la Tour, Rachid Echahed:
True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans. CoRR abs/1904.08850 (2019) - [i3]Thierry Boy de la Tour:
Parallelism Theorem and Derived Rules for Parallel Coherent Transformations. CoRR abs/1907.06585 (2019) - 2018
- [i2]Thierry Boy de la Tour, Rachid Echahed:
A Set-Theoretic Framework for Parallel Graph Rewriting. CoRR abs/1808.03161 (2018) - 2017
- [c23]Thierry Boy de la Tour:
Properties of Constrained Generalization Algorithms. GCAI 2017: 64-77 - 2016
- [j4]Thierry Boy de la Tour, Nicolas Peltier:
Proof Generalization in $$\mathrm {LK}$$ LK by Second Order Unifier Minimization. J. Autom. Reason. 57(3): 245-280 (2016) - 2014
- [p1]Thierry Boy de la Tour, Nicolas Peltier:
Analogy in Automated Deduction: A Survey. Computational Approaches to Analogical Reasoning 2014: 103-130 - 2011
- [i1]Thierry Boy de la Tour, Mnacho Echenim:
Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries. CoRR abs/1107.4553 (2011)
2000 – 2009
- 2008
- [c22]Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran:
Unification and Matching Modulo Leaf-Permutative Equational Presentations. IJCAR 2008: 332-347 - 2007
- [j3]Thierry Boy de la Tour, Mnacho Echenim:
Permutative rewriting and unification. Inf. Comput. 205(4): 624-650 (2007) - [c21]Thierry Boy de la Tour, Mnacho Echenim:
Determining Unify-Stable Presentations. RTA 2007: 63-77 - [e2]Myla Archer, Thierry Boy de la Tour, César A. Muñoz:
Proceedings of the 6th International Workshop on Strategies in Automated Deduction, STRATEGIES@IJCAR 2006, Part of PLoC 2006, Seattle, WA, USA, August 16, 2006. Electronic Notes in Theoretical Computer Science 174(11), Elsevier 2007 [contents] - 2006
- [c20]Myla Archer, Thierry Boy de la Tour, César A. Muñoz:
Preface. STRATEGIES@IJCAR 2006: 1-2 - 2005
- [c19]Thierry Boy de la Tour, Mnacho Echenim:
Unification in a Class of Permutative Theories. RTA 2005: 105-119 - [e1]Maria Paola Bonacina, Thierry Boy de la Tour:
Proceedings of the 5th International Workshop on Strategies in Automated Deduction, STRATEGIES@IJCAR 2004, Cork, Ireland, July 4, 2004. Electronic Notes in Theoretical Computer Science 125(2), Elsevier 2005 [contents] - 2004
- [j2]Thierry Boy de la Tour, Mnacho Echenim:
On the Complexity of Deduction Modulo Leaf Permutative Equations. J. Autom. Reason. 33(3-4): 271-317 (2004) - [c18]Thierry Boy de la Tour, Mnacho Echenim:
Overlapping Leaf Permutative Equations. IJCAR 2004: 430-444 - [c17]Maria Paola Bonacina, Thierry Boy de la Tour:
Preface. STRATEGIES@IJCAR 2004: 1-3 - [c16]Thierry Boy de la Tour, Prakash Countcham:
An Isomorph-Free SEM-Like Enumeration of Models. STRATEGIES@IJCAR 2004: 91-113 - 2003
- [c15]Thierry Boy de la Tour, Mnacho Echenim:
NP-Completeness Results for Deductive Problems on Stratified Terms. LPAR 2003: 317-331 - [c14]Thierry Boy de la Tour, Mnacho Echenim:
On Leaf Permutative Theories and Occurrence Permutation Groups. FTP 2003: 61-75 - 2002
- [c13]Thierry Boy de la Tour:
A Note on Symmetry Heuristics in SEM. CADE 2002: 181-194 - 2000
- [c12]Thierry Boy de la Tour:
Some Techniques of Isomorph-Free Search. AISC 2000: 240-252
1990 – 1999
- 1998
- [c11]Thierry Boy de la Tour, Stéphane Fèvre, Dongming Wang:
Clifford Term Rewriting for Geometric Reasoning in 3D. Automated Deduction in Geometry 1998: 130-155 - [c10]Thierry Boy de la Tour:
On the Complexity of Finite Sorted Algebras. FTP (LNCS Selection) 1998: 95-108 - 1996
- [c9]Thierry Boy de la Tour:
Ground Resolution with Group Computations on Semantic Symmetries. CADE 1996: 478-492 - 1995
- [c8]Thierry Boy de la Tour, Stéphane Demri:
On the Complexity of Extending Ground Resolution with Symmetry Rules. IJCAI 1995: 289-297 - 1992
- [j1]Thierry Boy de la Tour:
An Optimality Result for Clause Form Translation. J. Symb. Comput. 14(4): 283-302 (1992) - [c7]Thierry Boy de la Tour, Christoph Kreitz:
Building Proofs by Analogy via the Curry-Horward Isomorphism. LPAR 1992: 202-213 - 1991
- [b1]Thierry Boy de la Tour:
Optimisation par renommage dans la méthode de résolution. (Optimizations by renaming in the resolution method). Grenoble Institute of Technology, France, 1991 - 1990
- [c6]Thierry Boy de la Tour, Gilles Chaminade:
The Use of Renaming to Improve the Effeciency of Clausal Theorem Proving. AIMSA 1990: 3-12 - [c5]Thierry Boy de la Tour:
Minimizing the Number of Clauses by Renaming. CADE 1990: 558-572
1980 – 1989
- 1988
- [c4]Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade:
Some Tools for an Inference Laboratory (ATINF). CADE 1988: 744-745 - [c3]Thierry Boy de la Tour, Ricardo Caferra:
A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning. ISSAC 1988: 402-406 - [c2]Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade:
Some Tools for an Inference Laboratory (ATINF). STACS 1988: 395-396 - 1987
- [c1]Thierry Boy de la Tour, Ricardo Caferra:
Proof Analogy in Interactive Theorem Proving: A Method to Express and Use It via Second Order Pattern Matching. AAAI 1987: 95-99
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-08-07 22:25 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:
