| 2008 |
|---|
| 25 | EE | Thierry Boy de la Tour,
Mnacho Echenim,
Paliath Narendran:
Unification and Matching Modulo Leaf-Permutative Equational Presentations.
IJCAR 2008: 332-347 |
| 2007 |
|---|
| 24 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Determining Unify-Stable Presentations.
RTA 2007: 63-77 |
| 23 | EE | Myla Archer,
Thierry Boy de la Tour,
César Muñoz:
Preface.
Electr. Notes Theor. Comput. Sci. 174(11): 1-2 (2007) |
| 22 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Permutative rewriting and unification.
Inf. Comput. 205(4): 624-650 (2007) |
| 2005 |
|---|
| 21 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Unification in a Class of Permutative Theories.
RTA 2005: 105-119 |
| 20 | EE | Maria Paola Bonacina,
Thierry Boy de la Tour:
Preface.
Electr. Notes Theor. Comput. Sci. 125(2): 1-3 (2005) |
| 19 | EE | Thierry Boy de la Tour,
Prakash Countcham:
An Isomorph-Free SEM-Like Enumeration of Models.
Electr. Notes Theor. Comput. Sci. 125(2): 91-113 (2005) |
| 2004 |
|---|
| 18 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
Overlapping Leaf Permutative Equations.
IJCAR 2004: 430-444 |
| 17 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
On the Complexity of Deduction Modulo Leaf Permutative Equations.
J. Autom. Reasoning 33(3-4): 271-317 (2004) |
| 2003 |
|---|
| 16 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
NP-Completeness Results for Deductive Problems on Stratified Terms.
LPAR 2003: 317-331 |
| 15 | EE | Thierry Boy de la Tour,
Mnacho Echenim:
On Leaf Permutative Theories and Occurrence Permutation Groups.
Electr. Notes Theor. Comput. Sci. 86(1): (2003) |
| 2002 |
|---|
| 14 | EE | Thierry Boy de la Tour:
A Note on Symmetry Heuristics in SEM.
CADE 2002: 181-194 |
| 2000 |
|---|
| 13 | EE | Thierry Boy de la Tour:
Some Techniques of Isomorph-Free Search.
AISC 2000: 240-252 |
| 1998 |
|---|
| 12 | EE | 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 |
| 11 | EE | Thierry Boy de la Tour:
On the Complexity of Finite Sorted Algebras.
FTP (LNCS Selection) 1998: 95-108 |
| 1996 |
|---|
| 10 | | Thierry Boy de la Tour:
Ground Resolution with Group Computations on Semantic Symmetries.
CADE 1996: 478-492 |
| 1995 |
|---|
| 9 | | Thierry Boy de la Tour,
Stéphane Demri:
On the Complexity of Extending Ground Resolution with Symmetry Rules.
IJCAI 1995: 289-297 |
| 1992 |
|---|
| 8 | | Thierry Boy de la Tour,
Christoph Kreitz:
Building Proofs by Analogy via the Curry-Horward Isomorphism.
LPAR 1992: 202-213 |
| 7 | | Thierry Boy de la Tour:
An Optimality Result for Clause Form Translation.
J. Symb. Comput. 14(4): 283-302 (1992) |
| 1990 |
|---|
| 6 | | Thierry Boy de la Tour,
Gilles Chaminade:
The Use of Renaming to Improve the Effeciency of Clausal Theorem Proving.
AIMSA 1990: 3-12 |
| 5 | | Thierry Boy de la Tour:
Minimizing the Number of Clauses by Renaming.
CADE 1990: 558-572 |
| 1988 |
|---|
| 4 | | Thierry Boy de la Tour,
Ricardo Caferra,
Gilles Chaminade:
Some Tools for an Inference Laboratory (ATINF).
CADE 1988: 744-745 |
| 3 | | Thierry Boy de la Tour,
Ricardo Caferra:
A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning.
ISSAC 1988: 402-406 |
| 2 | | Thierry Boy de la Tour,
Ricardo Caferra,
Gilles Chaminade:
Some Tools for an Inference Laboratory (ATINF).
STACS 1988: 395-396 |
| 1987 |
|---|
| 1 | | 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 |
