Towards an efficient construction of test sets for deciding ground reducibility
We propose a method for constructing test sets for deciding whether a term is ground reducible w.r.t. an arbitrary, many-sorted, unconditional term rewriting system. Our approach is based on a suitable characterization of such test sets using a certain notion of transnormality. It generates very small test sets and shows some promise to be an important step towards a practicable implementation.
Unable to display preview. Download preview PDF.
- 1.B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proc. 9 th STACS, volume 577 of LNCS, pages 161–171. Springer, 1992.Google Scholar
- 2.R. Bündgen. Term completion versus algebraic completion. Ph.D. thesis, Fakultät für Informatik, Eberhard-Karls-Universität, Tübingen, Germany, May 1991.Google Scholar
- 3.H. Comon and F. Jacquemard. Ground reducibility and automata with disequality constraints. In Proc. 11 th STACS, LNCS 775, pages 151–162. Springer, 1994.Google Scholar
- 4.H. Comon and J.-L. Remy. How to characterize the language of ground normal forms. Rapports de Recherche 676, INRIA, 1987.Google Scholar
- 5.N. Dershowitz and J.-P. Jouannaud. Notations for rewriting. Bulletin EATCS, No. 43, pages 162–172, Feb 1991.Google Scholar
- 9.D. Kapur, P. Narendran, and H. Zhang. Automating inductionless induction using test sets. Journal of Symbolic Computation, 11:83–111, 1991.Google Scholar
- 10.E. Kounalis. Testing for inductive (co)-reducibility. In CAAP'90, Copenhagen, Denmark, volume 431 of LNCS, pages 221–238, 1990.Google Scholar
- 11.E. Kounalis. Testing for the ground (co)-reducibility property in term-rewriting systems. Theoretical Computer Science, Elsevier, 106:87–117, 1992.Google Scholar
- 12.G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. In 3rd CTRS, LNCS 656, pages 272–286, 1992.Google Scholar
- 14.S. Vágvölgyi and R. Gilleron. For a rewriting system it is decidable whether the set of irreducible ground terms is recognizable. Bulletin EATCS, No. 48, pages 197–200, 1992.Google Scholar