| Publication | Date of Publication | Type |
|---|
Diophantine equations, Presburger arithmetic and finite automata
Trees in Algebra and Programming — CAAP '96 | 2023-02-23 | Paper |
Inductive proofs by specification transformations
Rewriting Techniques and Applications | 2022-12-09 | Paper |
About the theory of tree embedding
Lecture Notes in Computer Science | 2022-11-02 | Paper |
Negation elimination in equational formulae (extended abstract)
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Completion of rewrite systems with membership constraints
Automata, Languages and Programming | 2019-12-04 | Paper |
Pumping, cleaning and symbolic constraints solving
Automata, Languages and Programming | 2019-04-29 | Paper |
Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science | 2005-04-06 | Paper |
Ground reducibility is EXPTIME-complete
Information and Computation | 2004-11-23 | Paper |
Sequentiality, monadic second-order logic and tree automata.
Information and Computation | 2003-01-14 | Paper |
Induction = I-axiomatization + first-order consistency.
Information and Computation | 2003-01-14 | Paper |
| Inductionless induction | 2002-08-27 | Paper |
| scientific article; zbMATH DE number 1754629 (Why is no real title available?) | 2002-06-12 | Paper |
Completion of rewrite systems with membership constraints. I: Deduction rules
Journal of Symbolic Computation | 2002-04-29 | Paper |
Completion of rewrite systems with membership constraints. II: Constraint solving
Journal of Symbolic Computation | 2002-04-29 | Paper |
| scientific article; zbMATH DE number 1688810 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670482 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1456949 (Why is no real title available?) | 2000-06-07 | Paper |
A methodological view of constraint solving
Constraints | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1414314 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1392288 (Why is no real title available?) | 2000-01-24 | Paper |
| scientific article; zbMATH DE number 1380887 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1361127 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1223619 (Why is no real title available?) | 1998-11-15 | Paper |
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science | 1998-07-23 | Paper |
Equational formulae with membership constraints
Information and Computation | 1995-12-13 | Paper |
Complete axiomatizations of some quotient term algebras
Theoretical Computer Science | 1995-04-20 | Paper |
On unification of terms with integer exponents
Mathematical Systems Theory | 1995-04-05 | Paper |
Syntacticness, cycle-syntacticness and shallow theories
Information and Computation | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 177848 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176756 (Why is no real title available?) | 1993-05-18 | Paper |
A rewrite-based type discipline for a subset of computer algebra
Journal of Symbolic Computation | 1992-06-25 | Paper |
SOLVING SYMBOLIC ORDERING CONSTRAINTS
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
Equational problems and disunification
Journal of Symbolic Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4164137 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4049024 (Why is no real title available?) | 1986-01-01 | Paper |
