Characterizing and proving operational termination of deterministic conditional term rewriting systems
From MaRDI portal
(Redirected from Publication:710679)
Recommendations
- Operational termination of conditional term rewriting systems
- Dependency pairs for proving termination properties of conditional term rewriting systems
- 2D dependency pairs for proving operational termination of CTRSs
- Extending the 2D dependency pair framework for conditional term rewriting systems
- Strong and weak operational termination of order-sorted rewrite theories
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 1405447 (Why is no real title available?)
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Computationally Equivalent Elimination of Conditions
- Context-Sensitive Dependency Pairs
- ELAN from a rewriting logic point of view
- From Outermost to Context-Sensitive Rewriting
- Frontiers of Combining Systems
- Improving Context-Sensitive Dependency Pairs
- Improving the context-sensitive dependency graph
- Local Termination
- Mechanizing and improving dependency pairs
- Operational termination of conditional term rewriting systems
- Operational termination of membership equational programs: the order-sorted way
- Proving operational termination of membership equational programs
- Proving termination of context-sensitive rewriting with MU-TERM
- Term Rewriting and Applications
- Termination of term rewriting using dependency pairs
- Termination proofs of well-moded logic programs via conditional rewrite systems
- Transformation for refining unraveled conditional term rewriting systems
- Transformations of Conditional Rewrite Systems Revisited
- Unravelings and ultra-properties
Cited in
(16)- Proving confluence in the confluence framework with confident
- Using well-founded relations for proving operational termination
- Termination criteria for DPO transformations with injective matches
- Complexity of conditional term rewriting
- Operational termination of conditional term rewriting systems
- 2D dependency pairs for proving operational termination of CTRSs
- Completion after program inversion of injective functions
- Dependency pairs for proving termination properties of conditional term rewriting systems
- An integrated framework for the diagnosis and correction of rule-based programs
- Determinization of conditional term rewriting systems
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- Applications and extensions of context-sensitive rewriting
- Strong and weak operational termination of order-sorted rewrite theories
- Twenty years of rewriting logic
- Transformations of Conditional Rewrite Systems Revisited
This page was built for publication: Characterizing and proving operational termination of deterministic conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710679)
