The following pages link to (Q4385532):
Displaying 50 items.
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Equational abstractions (Q944377) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Termination of rewriting (Q1098624) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Bubbles in modularity (Q1127335) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Semantics of order-sorted specifications (Q1185014) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- An improved general \(E\)-unification method (Q1201347) (← links)
- A field guide to equational logic (Q1201350) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- How to win a game with features (Q1271569) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Modular aspects of term graph rewriting (Q1275016) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- Orders, reduction graphs and spectra (Q1275630) (← links)
- Decidability and complexity analysis by basic paramodulation (Q1281494) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Constructing inverse semigroups from category actions (Q1295727) (← links)
- Regular path queries with constraints (Q1307690) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Automated proofs of equality problems in Overbeek's competition (Q1319385) (← links)
- Competing for the \(AC\)-unification race (Q1319390) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
