Ground reducibility is EXPTIME-complete

Information and Computation

Volumn 187, Issue 1, 2003, Pages 123-153

  Comon, Hubert ^a   Jacquemard, Florent ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Computational complexity; Computer theorem proving; Rewriting systems; Tree automata

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FINITE AUTOMATA; POLYNOMIALS; THEOREM PROVING;

REWRITING SYSTEMS; TREE AUTOMATA;

COMPUTATIONAL COMPLEXITY;

EID: 0344981314     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00134-2     Document Type: Article

References (14)

1. A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet, F. Jacquemard, Pumping, cleaning and symbolic constraints solving, in: Proc. Int. Conference on Algorithms, Languages and Programming, Lecture Notes in Computer Science, vol. 820, Springer, Berlin, 1994.
2. A.-C. Caron, J.-L. Coquidé, M. Dauchet, Encompassment properties and automata with constraints, in: C. Kirchner (Ed.), 5th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, Springer, Berlin, 1993.
3. H. Comon, An effective method for handling initial algebras, in: Proc. 1st Workshop on Algebraic and Logic Programming, Gaussig, Lecture Notes in Computer Science, vol. 343, Springer, Berlin, 1988.
4. H. Comon, F. Jacquemard, Ground reducibility and automata with disequality constraints, in: P. Enjalbert (Ed.), Proc. 11th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 775, Springer, Berlin, 1994.
5. Dauchet, Caron, Coquidé, Automata for reduction properties solving, JSCOMP: J. Symbolic Comput. 20 (1995).
6. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, North-Holland, Amsterdam, 1990, pp. 243-309.
7. T. Frühwirth, E. Shapiro, M. Y. Vardi, E. Yardemi, Logic programs as types for logic programs, in 6th IEEE Symp. Logic in Computer Science, 1991, pp. 300-309.
8. J. Gallier, R. Book, Reductions in tree replacement systems, Theoret. Comput. Sci. 37 (1985) 123-150.
9. J.-P. Jouannaud, E. Kounalis, Automatic proofs by induction in theories without constructors, Inform. Comput. 82 (1) (1989).
10. D. Kapur, P. Narendran, D. Rosenkrantz, H. Zhang, Sufficient completeness, ground reducibility and their complexity, Acta Inform. 28 (1991) 311-350.
11. D. Kapur, P. Narendran, H. Zhang, On sufficient completeness and related properties of term rewriting systems, Acta Inform. 24 (4) (1987) 395-415.
12. E. Kounalis, Testing for the ground (co)-reducibility in term rewriting systems, Theoret. Comput. Sci. 106 (11) (1992) 87-117.
13. D. Plaisted, Semantic confluence tests and completion methods, Inform. Control 65 (1985) 182-215.
14. H. Seidl, Haskell overloading is DEXPTIME-complete, Inform. Process. Lett. 52 (1994) 57-60.