The following pages link to (Q4385532):
Displaying 50 items.
- Decidability of reachability for disjoint union of term rewriting systems (Q1325846) (← links)
- Generalized sufficient conditions for modular termination of rewriting (Q1328180) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- On subsumption in distributed derivations (Q1337562) (← links)
- A complete equational axiomatization for prefix iteration (Q1342264) (← links)
- Simple termination is difficult (Q1343111) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Unification in sort theories and its applications (Q1380412) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Interaction nets and term-rewriting systems (Q1389438) (← links)
- Abstract data type systems (Q1391729) (← links)
- Proof systems for structured specifications with observability operators (Q1391730) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Developing developments (Q1392147) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- A linear logical framework (Q1400718) (← links)
- On the transition graphs of Turing machines. (Q1401268) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- Analysing the implicit complexity of programs. (Q1401939) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. (Q1401983) (← links)
- Constraint contextual rewriting. (Q1404984) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Superposition with completely built-in abelian groups (Q1432887) (← links)
- Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
- Pattern-matching algorithms based on term rewrite systems (Q1575262) (← links)
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Rational languages defined with a non-associative concatenation (Q1575941) (← links)
- MV-algebras, multiple bets and subjective states (Q1581899) (← links)
- Propositional compositions of partial predicates (Q1592086) (← links)
- Partial completion of equational theories (Q1592635) (← links)
- A unified language processing methodology (Q1603702) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- Linguistic\(\leftrightarrow \)rational agents' semantics (Q1688923) (← links)
- Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems (Q1707978) (← links)
