Pumping, cleaning and symbolic constraints solving, Proc. Int. Conference on Algorithms, Languages and Programming, 1994. ,
DOI : 10.1007/3-540-58201-0_88
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.4958
Encompassment properties and automata with constraints, 5th International Conference on Rewriting Techniques and Applications, 1993. ,
DOI : 10.1007/3-540-56868-9_25
An effective method for handling initial algebras, Proc. 1st Workshop on Algebraic and Logic Programming, Gaussig, 1988. ,
DOI : 10.1007/3-540-50667-5_62
Ground reducibility and automata with disequality constraints, Proc. 11th Symp. on Theoretical Aspects of Computer Science, 1994. ,
DOI : 10.1007/3-540-57785-8_138
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7042
Automata for Reduction Properties Solving, Journal of Symbolic Computation, vol.20, issue.2, 1995. ,
DOI : 10.1006/jsco.1995.1048
Rewrite Systems, pp.243-309, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50011-1
Logic programs as types for logic programs, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.300-309, 1991. ,
DOI : 10.1109/LICS.1991.151654
Reductions in tree replacement systems, Theoretical Computer Science, vol.37, pp.123-150, 1985. ,
DOI : 10.1016/0304-3975(85)90089-1
URL : http://doi.org/10.1016/0304-3975(85)90089-1
Automatic proofs by induction in theories without constructors, Information and Computation, vol.82, issue.1, 1989. ,
DOI : 10.1016/0890-5401(89)90062-X
Sufficient-completeness, ground-reducibility and their complexity, Acta Informatica, vol.65, issue.4, pp.311-350, 1991. ,
DOI : 10.1007/BF01893885
On sufficient-completeness and related properties of term rewriting systems, Acta Informatica, vol.6, issue.5, pp.395-415, 1987. ,
DOI : 10.1007/BF00292110
Testing for the ground (co-)reducibility property in term-rewriting systems, Theoretical Computer Science, vol.106, issue.1, pp.87-117, 1992. ,
DOI : 10.1016/0304-3975(92)90279-O
Semantic confluence tests and completion methods, Information and Control, vol.65, issue.2-3, pp.182-215, 1985. ,
DOI : 10.1016/S0019-9958(85)80005-X
URL : http://doi.org/10.1016/s0019-9958(85)80005-x
Haskell overloading is DEXPTIME-complete, Information Processing Letters, vol.52, issue.2, pp.57-60, 1994. ,
DOI : 10.1016/0020-0190(94)00130-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.8086