Matching, unification and complexity
ACM SIGSAM Bulletin
Communications of the ACM
Process algebra
Complexity of unification problems with associative-commutative operators
Journal of Automated Reasoning
A complete equational axiomatization for prefix iteration
Information Processing Letters
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Unification modulo ACI + 1 + 0
Fundamenta Informaticae
Term rewriting and all that
Automated deduction techniques for studying rough algebras
Fundamenta Informaticae
Decidability and complexity analysis by basic paramodulation
Information and Computation
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
On Narrowing, Refutation Proofs and Constraints
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Unification and Matching in Process Algebras
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We formulate a narrowing-based decision procedure for E-unifiability. Termination is obtained requiring a narrowing bound: a bound on the length of narrowing sequences. We study general conditions under which the method guarantees that E-unifiability is in NP. The procedure is also extended to narrowing modulo AC (associativity and commutativity). As an application of our method, we prove NPcompleteness of unifiability modulo bisimulation in process algebra with proper iteration, significantly extending a result in [8]. We also give (new) proofs, under a unified point of view, of NP-decidability of I, ACI, ACI1-unifiability and of unifiability in quasi-groups and central groupoids.