Hubert Comon

Available identifiers

zbMath Open comon.hubertMaRDI QIDQ685392

List of research outcomes

Publication	Date of Publication	Type
Diophantine equations, Presburger arithmetic and finite automata	2023-02-23	Paper
Inductive proofs by specification transformations	2022-12-09	Paper
About the theory of tree embedding	2022-11-02	Paper
Negation elimination in equational formulae	2022-08-18	Paper
Completion of rewrite systems with membership constraints	2019-12-04	Paper
Pumping, cleaning and symbolic constraints solving	2019-04-29	Paper
Deciding the confluence of ordered term rewrite systems	2017-06-13	Paper
Tree automata with one memory set constraints and cryptographic protocols	2005-04-06	Paper
Ground reducibility is EXPTIME-complete	2004-11-23	Paper
Sequentiality, monadic second-order logic and tree automata.	2003-01-14	Paper
Induction = I-axiomatization + first-order consistency.	2003-01-14	Paper
Inductionless induction	2002-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4535056	2002-06-12	Paper
Completion of rewrite systems with membership constraints. I: Deduction rules	2002-04-29	Paper
Completion of rewrite systems with membership constraints. II: Constraint solving	2002-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q2762629	2002-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q2753678	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4954438	2000-06-07	Paper
A methodological view of constraint solving	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4942651	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4936127	2000-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4705604	1999-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4270062	1999-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4218930	1998-11-15	Paper
The first-order theory of lexicographic path orderings is undecidable	1998-07-23	Paper
Equational formulae with membership constraints	1995-12-13	Paper
Complete axiomatizations of some quotient term algebras	1995-04-20	Paper
On unification of terms with integer exponents	1995-04-05	Paper
Syntacticness, cycle-syntacticness and shallow theories	1995-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q4038726	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4036586	1993-05-18	Paper
A rewrite-based type discipline for a subset of computer algebra	1992-06-25	Paper
SOLVING SYMBOLIC ORDERING CONSTRAINTS	1990-01-01	Paper
Equational problems and disunification	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3490949	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3785921	1986-01-01	Paper

Research outcomes over time

This page was built for person: Hubert Comon