Ground Reducibility is EXPTIME-complete

Hubert Comon-Lundh 1 Florent Jacquemard 2
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizable tree languages. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints A(R,t) to a rewrite system R and a term t. This automaton is deterministic and accepts at least one term iff t is not ground reducible by R. The number of states of A(R,t) is O(2^|R|x|t|) and the size of its constraints is polynomial in the size of R, t. Then we prove some new pumping lemmas, using a total ordering on the computations of the automaton. Thanks to these lemmas, we can show that emptiness for an automaton with disequality constraints can be decided in a time which is polynomial in the number of states and exponential in the size of the constraints. Altogether, we get a simply exponential time deterministic algorithm for ground reducibility decision.
Type de document :
Article dans une revue
Information and Computation, Elsevier, 2003, 187 (1), pp.123-153
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00578859
Contributeur : Florent Jacquemard <>
Soumis le : mardi 22 mars 2011 - 15:06:57
Dernière modification le : jeudi 11 janvier 2018 - 06:22:14
Document(s) archivé(s) le : jeudi 23 juin 2011 - 02:47:07

Fichier

CJ-icomp.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00578859, version 1

Collections

Citation

Hubert Comon-Lundh, Florent Jacquemard. Ground Reducibility is EXPTIME-complete. Information and Computation, Elsevier, 2003, 187 (1), pp.123-153. 〈inria-00578859〉

Partager

Métriques

Consultations de la notice

276

Téléchargements de fichiers

119