The following pages link to Term Rewriting and All That (Q4702972):
Displayed 50 items.
- Confluence and termination of fuzzy relations (Q991880) (← links)
- Labelled splitting (Q1037396) (← links)
- Inductive proof search modulo (Q1037404) (← links)
- The lambda-context calculus (extended version) (Q1044184) (← links)
- Increasing interpretations (Q1044231) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Equational rules for rewriting logic (Q1608925) (← links)
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) (Q1633382) (← links)
- Geometric and combinatorial views on asynchronous computability (Q1657197) (← links)
- Introduction to ``Milestones in interactive theorem proving'' (Q1663212) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- Rewriting systems over similarity and generalized pseudometric spaces and their properties (Q1677217) (← links)
- Linguistic\(\leftrightarrow \)rational agents' semantics (Q1688923) (← links)
- Transparent rule based CAS to support formalization of knowledge (Q1701655) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- Taylor term does not imply any nontrivial linear one-equality Maltsev condition (Q1721745) (← links)
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems (Q1726351) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Intensional computation with higher-order functions (Q1733061) (← links)
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems (Q1736602) (← links)
- Combalgebraic structures on decorated cliques (Q1745105) (← links)
- Free operated monoids and rewriting systems (Q1756691) (← links)
- Constraint solving for proof planning (Q1774557) (← links)
- A theory of reversibility for Erlang (Q1785852) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- On rewriting rules in Mizar (Q1945908) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
- Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
- A superposition calculus for abductive reasoning (Q2013317) (← links)
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← links)
- Termination of the F5 algorithm (Q2017770) (← links)
- Duality of graded graphs through operads (Q2033471) (← links)
- A logic based approach to finding real singularities of implicit ordinary differential equations (Q2035628) (← links)
- Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes) (Q2051565) (← links)
- Equational theorem proving modulo (Q2055853) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- A local characterization of \(B_2\) regular crystals (Q2075286) (← links)
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)