Term orderings for non-reachability of (conditional) rewriting
From MaRDI portal
Publication:2104512
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 1487842 (Why is no real title available?)
- scientific article; zbMATH DE number 1765702 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- 2D dependency pairs for proving operational termination of CTRSs
- Automatically Proving and Disproving Feasibility Conditions
- Automating the dependency pair method
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Disproving confluence of term rewriting systems by interpretation and ordering
- Functional and Logic Programming
- Matrix interpretations for proving termination of term rewriting
- Mechanizing and improving dependency pairs
- Multi-dimensional interpretations for termination of term rewriting
- Nagoya termination tool
- Orderings for term-rewriting systems
- Proving termination of programs automatically with AProVE
- Reachability Analysis for Termination and Confluence of Rewriting
- Reachability analysis over term rewriting systems
- Term Rewriting and All That
- Termination of term rewriting using dependency pairs
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- The termination hierarchy for term rewriting
- Tuple Interpretations for Higher-Order Complexity.
- Use of logical models for proving infeasibility in term rewriting
- mu-term: Verify Termination Properties Automatically (System Description)
Cited in
(8)- scientific article; zbMATH DE number 176122 (Why is no real title available?)
- Could orders be captured by term rewriting systems?
- Termination orderings for associative-commutative rewriting systems
- Weighted Path Orders Are Semantic Path Orders
- NaTT
- Rewriting with a nondeterministic choice operator
- Bi-rewriting, a term rewriting technique for monotonic order relations
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
Describes a project that uses
Uses Software
This page was built for publication: Term orderings for non-reachability of (conditional) rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104512)
