Thierry Boy de la Tour - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2020

Parallel rewriting of attributed graphsThierry Boy de la Tour, Rachid Echahed. TCS, 848:106-132, 2020. [doi]

Combining Parallel Graph Rewriting and Quotient GraphsThierry Boy de la Tour, Rachid Echahed. WRLA 2020: 1-18 [doi]

Parallel Coherent Graph TransformationsThierry Boy de la Tour, Rachid Echahed. WADT 2021: 75-97 [doi]

Monographs, a Category of Graph StructuresThierry Boy de la Tour. WADT 2021: 54-74 [doi]

2017

Properties of Constrained Generalization AlgorithmsThierry Boy de la Tour. gcai 2017: 64-77 [doi]

2016

Proof Generalization in $$\mathrm {LK}$$ LK by Second Order Unifier MinimizationThierry Boy de la Tour, Nicolas Peltier. JAR, 57(3):245-280, 2016. [doi]

2014

Analogy in Automated Deduction: A SurveyThierry Boy de la Tour, Nicolas Peltier. In Henri Prade, Gilles Richard, editors, Computational Approaches to Analogical Reasoning: Current Trends. Volume 548 of Studies in Computational Intelligence, pages 103-130, Springer, 2014. [doi]

2008

Unification and Matching Modulo Leaf-Permutative Equational PresentationsThierry Boy de la Tour, Mnacho Echenim, Paliath Narendran. cade 2008: 332-347 [doi]

2007

PrefaceMyla Archer, Thierry Boy de la Tour, César Muñoz. ENTCS, 174(11):1-2, 2007. [doi]

Permutative rewriting and unificationThierry Boy de la Tour, Mnacho Echenim. iandc, 205(4):624-650, 2007. [doi]

Determining Unify-Stable PresentationsThierry Boy de la Tour, Mnacho Echenim. RTA 2007: 63-77 [doi]

2005

PrefaceMaria Paola Bonacina, Thierry Boy de la Tour. ENTCS, 125(2):1-3, 2005. [doi]

An Isomorph-Free SEM-Like Enumeration of ModelsThierry Boy de la Tour, Prakash Countcham. ENTCS, 125(2):91-113, 2005. [doi]

Unification in a Class of Permutative TheoriesThierry Boy de la Tour, Mnacho Echenim. RTA 2005: 105-119 [doi]

2004

On the Complexity of Deduction Modulo Leaf Permutative EquationsThierry Boy de la Tour, Mnacho Echenim. JAR, 33(3-4):271-317, 2004. [doi]

Overlapping Leaf Permutative EquationsThierry Boy de la Tour, Mnacho Echenim. cade 2004: 430-444 [doi]

2003

On Leaf Permutative Theories and Occurrence Permutation GroupsThierry Boy de la Tour, Mnacho Echenim. ENTCS, 86(1):61-75, 2003. [doi]

NP-Completeness Results for Deductive Problems on Stratified TermsThierry Boy de la Tour, Mnacho Echenim. lpar 2003: 317-331 [doi]

2002

A Note on Symmetry Heuristics in SEMThierry Boy de la Tour. cade 2002: 181-194 [doi]

2000

Some Techniques of Isomorph-Free SearchThierry Boy de la Tour. AISC 2001: 240-252 [doi]

1998

On the Complexity of Finite Sorted AlgebrasThierry Boy de la Tour. ftp 2000: 95-108 [doi]

Clifford Term Rewriting for Geometric Reasoning in 3DThierry Boy de la Tour, Stéphane Fèvre, Dongming Wang. adg 1999: 130-155 [doi]

1996

Ground Resolution with Group Computations on Semantic SymmetriesThierry Boy de la Tour. cade 1996: 478-492

1995

On the Complexity of Extending Ground Resolution with Symmetry RulesThierry Boy de la Tour, Stéphane Demri. IJCAI 1995: 289-297

1992

An Optimality Result for Clause Form TranslationThierry Boy de la Tour. JSC, 14(4):283-302, 1992.

Building Proofs by Analogy via the Curry-Horward IsomorphismThierry Boy de la Tour, Christoph Kreitz. lpar 1992: 202-213

1991

Optimisation par renommage dans la méthode de résolution. (Optimizations by renaming in the resolution method)Thierry Boy de la Tour. PhD thesis, Grenoble Institute of Technology, France, 1991. [doi]

1990

The Use of Renaming to Improve the Effeciency of Clausal Theorem ProvingThierry Boy de la Tour, Gilles Chaminade. aimsa 1990: 3-12

Minimizing the Number of Clauses by RenamingThierry Boy de la Tour. cade 1990: 558-572

1988

Some Tools for an Inference Laboratory (ATINF)Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade. cade 1988: 744-745

A Formal Approach to some Usually Informal Techniques Used in Mathematical ReasoningThierry Boy de la Tour, Ricardo Caferra. issac 1989: 402-406

Some Tools for an Inference Laboratory (ATINF)Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade. STACS 1988: 395-396

1987

Proof Analogy in Interactive Theorem Proving: A Method to Express and Use It via Second Order Pattern MatchingThierry Boy de la Tour, Ricardo Caferra. AAAI 1987: 95-99

Sign in or sign up to see more results.

runs on WebDSL