Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
An attack on a recursive authentication protocol. A cautionary tale
Information Processing Letters
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Unification Modulo ACUI Plus Distributivity Axioms
Journal of Automated Reasoning
Higher-Order and Symbolic Computation
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
Foundations of Security Analysis and Design V
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and 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
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Protocol analysis modulo combination of theories: a case study in Maude-NPA
STM'10 Proceedings of the 6th international conference on Security and trust management
Hi-index | 0.00 |
If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorithm. However, except for the hopelessly inefficient case of full narrowing, nothing seems to be known about effective narrowing strategies in the general modulo case beyond the quite depressing observation that basic narrowing is incomplete modulo AC. In this work we propose an effective strategy based on the idea of the E∪Ax-variants of a term that we call folding variant narrowing. This strategy is complete, both for computing E∪Ax-unifiers and for computing a minimal complete set of variants for any input term. And it is optimally variant terminating in the sense of terminating for an input term t iff t has a finite, complete set of variants. The applications of folding variant narrowing go beyond providing a complete E∪Ax - unification algorithm: computing the E∪Ax-variants of a term may be just as important as computing E∪Ax-unifiers in recent applications of folding variant narrowing such as termination methods modulo axioms, and checking confluence and coherence of rules modulo axioms.