Pages that link to "Item:Q593789"
From MaRDI portal
The following pages link to Orderings for term-rewriting systems (Q593789):
Displaying 50 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- On multiset ordering (Q502679) (← links)
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Building exact computation sequences (Q579925) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Natural termination (Q673622) (← links)
- Proving semantical equivalence of data specifications (Q678825) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- Termination by completion (Q757069) (← links)
- Term rewriting: Some experimental results (Q757071) (← links)
- Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Semi-unification (Q808713) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- An effective proof of the well-foundedness of the multiset path ordering (Q857884) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Leanest quasi-orderings (Q876045) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- On the recursive decomposition ordering with lexicographical status and other related orderings (Q912609) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- Match-bounds revisited (Q1041044) (← links)
- A superposition oriented theorem prover (Q1060857) (← links)
- The undecidability of self-embedding for term rewriting systems (Q1061484) (← links)
- Algebra of communicating processes with abstraction (Q1067408) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- On recursive path ordering (Q1082075) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Parameter-preserving data type specifications (Q1089794) (← links)
- The undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← links)
- Termination of rewriting (Q1098624) (← links)
- Corrigendum to ``Termination of rewriting'' (Q1098625) (← links)
- Rewrite method for theorem proving in first order theory with equality (Q1098649) (← links)
- Path of subterms ordering and recursive decomposition ordering revisited (Q1099655) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- On termination of the direct sum of term-rewriting systems (Q1108785) (← links)
- A geometrical approach to multiset orderings (Q1119955) (← links)
- Using unavoidable set of trees to generalize Kruskal's theorem (Q1122597) (← links)
- A notation for lambda terms. A generalization of environments (Q1129257) (← links)
- Fuzzy term-rewriting system (Q1182011) (← links)
