Confluent term rewriting systems with membership conditions
1st international workshop on Conditional Term Rewriting Systems
Redundancy criteria for constrained completion
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Completion of rewrite systems with membership constraints. Part I: deduction rules
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Completion of rewrite systems with membership constraints. Part II: constraint solving
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Term rewriting and all that
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
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
Incorporating decision procedures in implicit induction
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Argument Filtering Transformation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Completion of Rewrite Systems with Membership Constraints
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Confluence of Terminating Membership Conditional TRS
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Completion for Constrained Term Rewriting Systems
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Tyrolean termination tool: Techniques and features
Information and Computation
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Induction with Constrained Tree Automata
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Proving Termination of Integer Term Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Inductive decidability using implicit induction
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Orderings and constraints: theory and practice of proving termination
Rewriting Computation and Proof
| Hi-index | 0.00 |
In this paper, we propose methods for proving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are assumed to be sound for the interpretation. To this end, we extend the dependency pair framework for proving termination of unconstrained term rewriting systems to constrained term rewriting systems. Moreover, we extend the dependency pair framework so that dependency pair processors take a subgraph of the dependency graph as input and they output a finite set of graphs which can be obtained by eliminating nodes and/or edges from the input graph.