Boston University Center for the Study of Conflict, Ideology, and Policy
Publication date
01/01/2002
Field of study
Dubois Patrick. THIBAUT (Francisque). In: , . Le dictionnaire de pédagogie et d'instruction primaire de Ferdinand Buisson : répertoire biographique des auteurs. Paris : Institut national de recherche pédagogique, 2002. p. 136. (Bibliothèque de l'Histoire de l'Education, 17
It is known that the first-order theory of rewriting is decidable for ground
term rewrite systems, but the general technique uses tree automata and often
takes exponential time. For many properties, including confluence (CR),
uniqueness of normal forms with respect to reductions (UNR) and with respect to
conversions (UNC), polynomial time decision procedures are known for ground
term rewrite systems. However, this is not the case for the normal form
property (NFP). In this work, we present a cubic time algorithm for NFP, an
almost cubic time algorithm for UNR, and an almost linear time algorithm for
UNC, improving previous bounds. We also present a cubic time algorithm for CR