Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
Handbook of theoretical computer science (vol. B)
The semantics of equational logic programming as an instance of CLP
Logic programming languages
Incremental constraint satisfaction for equational logic programming
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
Modular proofs for completeness of hierarchical term rewriting systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Advanced topics in term rewriting
Advanced topics in term rewriting
On Modularity in Term Rewriting and Narrowing
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Multiparadigm Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
Higher-Order and Symbolic Computation
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Termination of narrowing revisited
Theoretical Computer Science
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination of Narrowing Using Dependency Pairs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
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
| Hi-index | 0.00 |
Basic narrowing is a restricted form of narrowing which constrains narrowing steps to a set of non-blocked (or basic) positions. Basic narrowing has a number of important applications including equational unification in canonical theories. Another application is analyzing termination of narrowing by checking the termination of basic narrowing, as done in pioneering work by Hullot. In this work, we study the modularity of termination of basic narrowing in hierarchical combinations of TRSs, including a generalization of proper extensions with shared subsystem. This provides new algorithmic criteria to prove termination of basic narrowing.