Pages that link to "Item:Q593789"
From MaRDI portal
The following pages link to Orderings for term-rewriting systems (Q593789):
Displayed 50 items.
- Complexity analysis of term-rewriting systems (Q1262761) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Simplification orderings: Putting them to the test (Q1311404) (← links)
- Rewriting systems of Coxeter groups (Q1321036) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Weights for total division orderings on strings (Q1346630) (← links)
- Abstract data type systems (Q1391729) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- A fully syntactic AC-RPO. (Q1400715) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- Superposition with completely built-in abelian groups (Q1432887) (← links)
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Richer types for \(Z\) (Q1816920) (← links)
- Proof of termination of the rewriting system SUBSET on CCL (Q1822494) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- A calculus for and termination of rippling (Q1915137) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- An improved general path order (Q1925013) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Minimal bad sequences are necessary for a uniform Kruskal theorem (Q2125990) (← links)
- Regaining cut admissibility in deduction modulo using abstract completion (Q2266989) (← links)
- Dependent choice as a termination principle (Q2309508) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- Normal forms for binary relations (Q2503327) (← links)
- The undecidability of iterated modal relativization (Q2574887) (← links)
- (Q2851054) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- The Logic of Public Announcements, Common Knowledge, and Private Suspicions (Q2971701) (← links)
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (Q3000635) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- (Q3327710) (← links)
- Theories of orders on the set of words (Q3374756) (← links)