Improving basic narrowing techniques
on Rewriting techniques and applications
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Journal of Symbolic Computation
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
The semantics of equational logic programming as an instance of CLP
Logic programming languages
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Incremental constraint satisfaction for equational logic programming
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
Term rewriting and all that
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Termination of Logic Programs Using Semantic Unification
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Narrowing Directed by a Graph of Terms
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
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
Unification in a Combination of Arbitrary Disjoint Equational Theories
Proceedings of the 9th International Conference on Automated Deduction
Some Termination Criteria for Narrowing and E-Narrowing
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Decidable Matching for Convergent Systems (Preliminary Version)
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
Abstract diagnosis of functional programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination of Narrowing Using Dependency Pairs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
| Hi-index | 5.23 |
This paper describes several classes of term rewriting systems (TRS's), where narrowing has a finite search space and is still (strongly) complete as a mechanism for solving reachability goals. These classes do not assume confluence of the TRS. We also ascertain purely syntactic criteria that suffice to ensure the termination of narrowing, and include several subclasses of popular TRS's such as right-linear TRS's, almost orthogonal TRS's, topmost TRS's, and left-flat TRS's. Our results improve and/or generalize previous criteria in the literature regarding narrowing termination.