Thierry Boy de la Tour

Theor. Comput. Sci., 2025

2023

Subsumptions of Algebraic Rewrite Rules.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Applied Category Theory 2023, 2023

Algebraic Monograph Transformations.

[BibT_eX]

[DOI]

CoRR, 2023

2020

Parallel rewriting of attributed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Parallel Independence in Attributed Graph Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th International Workshop on Computing with Terms and Graphs, 2020

Combining Parallel Graph Rewriting and Quotient Graphs.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Logic and Its Applications - 13th International Workshop, 2020

Parallel Coherent Graph Transformations.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2020

Monographs, a Category of Graph Structures.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2020

Automated Deduction.

[BibT_eX]

[DOI]

Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume II: AI Algorithms, 2020

2019

Parallelism Theorem and Derived Rules for Parallel Coherent Transformations.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

2018

A Set-Theoretic Framework for Parallel Graph Rewriting.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Properties of Constrained Generalization Algorithms.

[BibT_eX]

[DOI]

Proceedings of the GCAI 2017, 2017

2016

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

[BibT_eX]

[DOI]

Nicolas Peltier

J. Autom. Reason., 2016

2014

Analogy in Automated Deduction: A Survey.

[BibT_eX]

[DOI]

Nicolas Peltier

Proceedings of the Computational Approaches to Analogical Reasoning: Current Trends, 2014

2011

Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries

[BibT_eX]

[DOI]

CoRR, 2011

2008

Unification and Matching Modulo Leaf-Permutative Equational Presentations.

[BibT_eX]

[DOI]

Paliath Narendran

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

Permutative rewriting and unification.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Determining Unify-Stable Presentations.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2006

Preface.

[BibT_eX]

[DOI]

Myla Archer

César A. Muñoz

Proceedings of the 6th International Workshop on Strategies in Automated Deduction, 2006

2005

Unification in a Class of Permutative Theories.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004

On the Complexity of Deduction Modulo Leaf Permutative Equations.

[BibT_eX]

[DOI]

J. Autom. Reason., 2004

An Isomorph-Free SEM-Like Enumeration of Models.

[BibT_eX]

[DOI]

Prakash Countcham

Proceedings of the 5th International Workshop on Strategies in Automated Deduction, 2004

Preface.

[BibT_eX]

[DOI]

Maria Paola Bonacina

Proceedings of the 5th International Workshop on Strategies in Automated Deduction, 2004

Overlapping Leaf Permutative Equations.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003

On Leaf Permutative Theories and Occurrence Permutation Groups.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

NP-Completeness Results for Deductive Problems on Stratified Terms.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2003

2002

A Note on Symmetry Heuristics in SEM.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2002

2000

Some Techniques of Isomorph-Free Search.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2000

1998

On the Complexity of Finite Sorted Algebras.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

Clifford Term Rewriting for Geometric Reasoning in 3D.

[BibT_eX]

[DOI]

Stéphane Fèvre

Dongming Wang

Proceedings of the Automated Deduction in Geometry, 1998

1996

Ground Resolution with Group Computations on Semantic Symmetries.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995

On the Complexity of Extending Ground Resolution with Symmetry Rules.

[BibT_eX]

[DOI]

Stéphane Demri

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1992

An Optimality Result for Clause Form Translation.

[BibT_eX]

[DOI]

J. Symb. Comput., 1992

Building Proofs by Analogy via the Curry-Horward Isomorphism.

[BibT_eX]

[DOI]

Christoph Kreitz

Proceedings of the Logic Programming and Automated Reasoning, 1992

1991

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

[BibT_eX]

[DOI]

PhD thesis, 1991

1990

Minimizing the Number of Clauses by Renaming.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Automated Deduction, 1990

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

[BibT_eX]

Gilles Chaminade

Proceedings of the Artificial Intelligence IV: Methodology, Systems, Applications, 1990

1988

Some Tools for an Inference Laboratory (ATINF).

[BibT_eX]

[DOI]

Ricardo Caferra

Gilles Chaminade

Proceedings of the STACS 88, 1988

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

[BibT_eX]

[DOI]

Ricardo Caferra

Proceedings of the Symbolic and Algebraic Computation, 1988

1987

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

[BibT_eX]

[DOI]