Handbook of theoretical computer science (vol. B)
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Tight complexity bounds for term matching problems
Information and Computation
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
Automated complexity analysis based on ordered resolution
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial Time Termination and Constraint Satisfaction Tests
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Complexity of finitely presented algebras.
Complexity of finitely presented algebras.
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
A new decidability technique for ground term rewriting systems with applications
ACM Transactions on Computational Logic (TOCL)
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Hi-index | 0.89 |
In this paper we give polynomial-time reductions between a version of joinability for rewrite systems and the word problem for rewrite systems. We prove log-space hardness or completeness for P for several problems of ground rewrite systems. We show that matching (and unification) modulo ground equations is NP-hard even when variables are restricted to at most two occurrences in the pattern and the subject is just a constant. Finally, we give the first polynomial-time algorithms for matching modulo ground equations with linear pattern and for joinability problem with ground rewrite systems. The joinability result leads to polynomial time algorithms for: local confluence of ground rewrite systems, confluence of terminating ground rewrite systems, and completeness of ground rewrite systems. The results for matching modulo ground equations are optimal with respect to occurrences of variables.