Thierry Boy de la Tour

44 papers A* 2A 7B 3Misc 2Journal 11Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Algebraic properties and transformations of monographs. Theor. Comput. Sci. Thierry Boy de la Tour
2023	J	`jnl`	Algebraic Monograph Transformations. CoRR Thierry Boy de la Tour
2023	—	`conf`	Subsumptions of Algebraic Rewrite Rules. ACT Thierry Boy de la Tour
2020	—	`ch.`	Automated Deduction. A Guided Tour of Artificial Intelligence Research (2) (II) Thierry Boy de la Tour, Ricardo Caferra, Nicola Olivetti, Nicolas Peltier, Camilla Schwind
2020	—	`conf`	Combining Parallel Graph Rewriting and Quotient Graphs. WRLA Thierry Boy de la Tour, Rachid Echahed
2020	—	`conf`	Monographs, a Category of Graph Structures. WADT Thierry Boy de la Tour
2020	—	`conf`	Parallel Coherent Graph Transformations. WADT Thierry Boy de la Tour, Rachid Echahed
2020	—	`conf`	Parallel Independence in Attributed Graph Rewriting. TERMGRAPH@FSCD Thierry Boy de la Tour
2020	J	`jnl`	Parallel rewriting of attributed graphs. Theor. Comput. Sci. Thierry Boy de la Tour, Rachid Echahed
2019	J	`jnl`	Parallelism Theorem and Derived Rules for Parallel Coherent Transformations. CoRR Thierry Boy de la Tour
2019	J	`jnl`	True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans. CoRR Thierry Boy de la Tour, Rachid Echahed
2018	J	`jnl`	A Set-Theoretic Framework for Parallel Graph Rewriting. CoRR Thierry Boy de la Tour, Rachid Echahed
2017	—	`conf`	Properties of Constrained Generalization Algorithms. GCAI Thierry Boy de la Tour
2016	J	`jnl`	Proof Generalization in $$\mathrm {LK}$$ LK by Second Order Unifier Minimization. J. Autom. Reason. Thierry Boy de la Tour, Nicolas Peltier
2014	—	`ch.`	Analogy in Automated Deduction: A Survey. Computational Approaches to Analogical Reasoning Thierry Boy de la Tour, Nicolas Peltier
2011	J	`jnl`	Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries CoRR Thierry Boy de la Tour, Mnacho Echenim
2008	A	`conf`	Unification and Matching Modulo Leaf-Permutative Equational Presentations. IJCAR Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran
2007	—	`conf`	Determining Unify-Stable Presentations. RTA Thierry Boy de la Tour, Mnacho Echenim
2007	J	`jnl`	Permutative rewriting and unification. Inf. Comput. Thierry Boy de la Tour, Mnacho Echenim
2007	—	`ed.`	Proceedings of the 6th International Workshop on Strategies in Automated Deduction, STRATEGIES@IJCAR 2006, Part of PLoC 2006, Seattle, WA, USA, August 16, 2006 STRATEGIES@IJCAR Myla Archer, Thierry Boy de la Tour, César A. Muñoz
2006	—	`conf`	Preface. STRATEGIES@IJCAR Myla Archer, Thierry Boy de la Tour, César A. Muñoz
2005	—	`ed.`	Proceedings of the 5th International Workshop on Strategies in Automated Deduction, STRATEGIES@IJCAR 2004, Cork, Ireland, July 4, 2004 STRATEGIES@IJCAR Maria Paola Bonacina, Thierry Boy de la Tour
2005	—	`conf`	Unification in a Class of Permutative Theories. RTA Thierry Boy de la Tour, Mnacho Echenim
2004	—	`conf`	An Isomorph-Free SEM-Like Enumeration of Models. STRATEGIES@IJCAR Thierry Boy de la Tour, Prakash Countcham
2004	J	`jnl`	On the Complexity of Deduction Modulo Leaf Permutative Equations. J. Autom. Reason. Thierry Boy de la Tour, Mnacho Echenim
2004	A	`conf`	Overlapping Leaf Permutative Equations. IJCAR Thierry Boy de la Tour, Mnacho Echenim
2004	—	`conf`	Preface. STRATEGIES@IJCAR Maria Paola Bonacina, Thierry Boy de la Tour
2003	B	`conf`	NP-Completeness Results for Deductive Problems on Stratified Terms. LPAR Thierry Boy de la Tour, Mnacho Echenim
2003	—	`conf`	On Leaf Permutative Theories and Occurrence Permutation Groups. FTP Thierry Boy de la Tour, Mnacho Echenim
2002	A	`conf`	A Note on Symmetry Heuristics in SEM. CADE Thierry Boy de la Tour
2000	Misc	`conf`	Some Techniques of Isomorph-Free Search. AISC Thierry Boy de la Tour
1998	—	`conf`	Clifford Term Rewriting for Geometric Reasoning in 3D. Automated Deduction in Geometry Thierry Boy de la Tour, Stéphane Fèvre, Dongming Wang
1998	—	`conf`	On the Complexity of Finite Sorted Algebras. FTP (LNCS Selection) Thierry Boy de la Tour
1996	A	`conf`	Ground Resolution with Group Computations on Semantic Symmetries. CADE Thierry Boy de la Tour
1995	A*	`conf`	On the Complexity of Extending Ground Resolution with Symmetry Rules. IJCAI Thierry Boy de la Tour, Stéphane Demri
1992	J	`jnl`	An Optimality Result for Clause Form Translation. J. Symb. Comput. Thierry Boy de la Tour
1992	B	`conf`	Building Proofs by Analogy via the Curry-Horward Isomorphism. LPAR Thierry Boy de la Tour, Christoph Kreitz
1991	—	`—`	Optimisation par renommage dans la méthode de résolution. (Optimizations by renaming in the resolution method). Thierry Boy de la Tour
1990	A	`conf`	Minimizing the Number of Clauses by Renaming. CADE Thierry Boy de la Tour
1990	Misc	`conf`	The Use of Renaming to Improve the Effeciency of Clausal Theorem Proving. AIMSA Thierry Boy de la Tour, Gilles Chaminade
1988	B	`conf`	A Formal Approach to some Usually Informal Techniques Used in Mathematical Reasoning. ISSAC Thierry Boy de la Tour, Ricardo Caferra
1988	A	`conf`	Some Tools for an Inference Laboratory (ATINF). CADE Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade
1988	A	`conf`	Some Tools for an Inference Laboratory (ATINF). STACS Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade
1987	A*	`conf`	Proof Analogy in Interactive Theorem Proving: A Method to Express and Use It via Second Order Pattern Matching. AAAI Thierry Boy de la Tour, Ricardo Caferra