Abstract
Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R.
Cite
CITATION STYLE
APA
Comon, H., & Jacquemard, F. (1994). Ground reducibility and automata with disequality constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 151–162). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_138
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free