Thierry Boy de la Tour

发表

The Use of Renaming to Improve the Effeciency of Clausal Theorem Proving

Thierry Boy de la Tour, Gilles Chaminade, 1990, AIMSA.

Determining Unify-Stable Presentations

Mnacho Echenim, Thierry Boy de la Tour, 2007, RTA.

On the Complexity of Extending Ground Resolution with Symmetry Rules

Stéphane Demri, Thierry Boy de la Tour, 1995, IJCAI.

Some Techniques of Isomorph-Free Search

Thierry Boy de la Tour, 2000, AISC.

Some Tools for an Inference Laboratory (ATINF)

Ricardo Caferra, Thierry Boy de la Tour, Gilles Chaminade, 1988, STACS.

On Leaf Permutative Theories and Occurrence Permutation Groups

Mnacho Echenim, Thierry Boy de la Tour, 2003, Electron. Notes Theor. Comput. Sci..

Minimizing the Number of Clauses by Renaming

Thierry Boy de la Tour, 1990, CADE.

Parallel rewriting of attributed graphs

Rachid Echahed, Thierry Boy de la Tour, 2020, Theor. Comput. Sci..

Analogy in Automated Deduction: A Survey

Nicolas Peltier, Thierry Boy de la Tour, N. Peltier, 2014, Computational Approaches to Analogical Reasoning.

Preface

Maria Paola Bonacina, Thierry Boy de la Tour, 2005, Electron. Notes Theor. Comput. Sci..

NP-Completeness Results for Deductive Problems on Stratified Terms

Mnacho Echenim, Thierry Boy de la Tour, 2003, LPAR.

Unification in a Class of Permutative Theories

Mnacho Echenim, Thierry Boy de la Tour, 2005, RTA.

Proof Generalization in LK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {LK}$$\end{document} by Second Order

Nicolas Peltier, Thierry Boy de la Tour, N. Peltier, 2016, Journal of Automated Reasoning.

True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans pdf

Rachid Echahed, Thierry Boy de la Tour, R. Echahed, 2019, ArXiv.

Preface

Myla Archer, César A. Muñoz, Thierry Boy de la Tour, 2007, Electron. Notes Theor. Comput. Sci..

Clifford Term Rewriting for Geometric Reasoning in 3D

Dongming Wang, Thierry Boy de la Tour, Stéphane Fèvre, 1998, Automated Deduction in Geometry.

Permutative rewriting and unification

Mnacho Echenim, Thierry Boy de la Tour, M. Echenim, 2007, Inf. Comput..

On the Complexity of Deduction Modulo Leaf Permutative Equations

Mnacho Echenim, Thierry Boy de la Tour, 2004, Journal of Automated Reasoning.

Ground Resolution with Group Computations on Semantic Symmetries

Thierry Boy de la Tour, 1996, CADE.

Proof Analogy in Interactive Theorem Proving: A Method to Express and Use It via Second Order Pattern Matching

Ricardo Caferra, Thierry Boy de la Tour, 1987, AAAI.

Unification and Matching Modulo Leaf-Permutative Equational Presentations

Paliath Narendran, Mnacho Echenim, Thierry Boy de la Tour, 2008, IJCAR.

Some Tools for an Inference Laboratory (ATINF)

Ricardo Caferra, Thierry Boy de la Tour, Gilles Chaminade, 1988, CADE.

Properties of Constrained Generalization Algorithms

Thierry Boy de la Tour, 2017, GCAI.

An Isomorph-Free SEM-Like Enumeration of Models

Thierry Boy de la Tour, Prakash Countcham, 2005, Electron. Notes Theor. Comput. Sci..

Combining Parallel Graph Rewriting and Quotient Graphs

Rachid Echahed, Thierry Boy de la Tour, 2020, WRLA@ETAPS.

Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries pdf

Mnacho Echenim, Thierry Boy de la Tour, 2011, ArXiv.

On Parallel and Sequential Independence in Attributed Graph Rewriting

Thierry Boy de la Tour, 2020 .

Parallelism Theorem and Derived Rules for Parallel Coherent Transformations pdf

Thierry Boy de la Tour, 2019, ArXiv.

Building Proofs by Analogy via the Curry-Horward Isomorphism

Christoph Kreitz, Thierry Boy de la Tour, C. Kreitz, 1992, LPAR.

A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning

Ricardo Caferra, Thierry Boy de la Tour, R. Caferra, 1988, ISSAC.

Optimisation par renommage dans la méthode de résolution. (Optimizations by renaming in the resolution method)

Thierry Boy de la Tour, 1991 .

A Note on Symmetry Heuristics in SEM

Thierry Boy de la Tour, 2002, CADE.

A Set-Theoretic Framework for Parallel Graph Rewriting pdf

Rachid Echahed, Thierry Boy de la Tour, R. Echahed, 2018, ArXiv.

On the Complexity of Finite Sorted Algebras

Thierry Boy de la Tour, 1998, FTP.

Overlapping Leaf Permutative Equations

Mnacho Echenim, Thierry Boy de la Tour, 2004, IJCAR.

An Optimality Result for Clause Form Translation

Thierry Boy de la Tour, 1992, J. Symb. Comput..

Global Conference on Artificial Intelligence Properties of Constrained Generalization Algorithms

Thierry Boy de la Tour, 2017 .

Permutative Rewriting and Unification 1

Thierry Boy de la Tour, M. Echenim, 2006 .

On Monographs, Monadic Many-Sorted Algebras and Graph Structures

Thierry Boy de la Tour, 2020 .

Parallel Independence in Attributed Graph Rewriting

Thierry Boy de la Tour, 2021, TERMGRAPH@FSCD.

Proof Generalization in $$\mathrm {LK}$$LK by Second Order Unifier Minimization

Thierry Boy de la Tour, N. Peltier, 2016, Journal of Automated Reasoning.

Determining Unify-Stable Presentations ( long version )

Thierry Boy de la Tour, M. Echenim, 2007 .

Proof Technology and Learning in Mathematics: Common Issues and Perspectives

Thierry Boy de la Tour, N. Balacheff, Thierry Boy de la Tour, 2019, Proof Technology in Mathematics Research and Teaching.