Rewriting
From MaRDI portal
Recommendations
Cited in
(47)- Problems in rewriting III
- Strict coherence of conditional rewriting modulo axioms
- A posthumous contribution by Larry Wos: excerpts from an unpublished column
- Set of support, demodulation, paramodulation: a historical perspective
- SCL(EQ): SCL for first-order logic with equality
- SCL(EQ): SCL for first-order logic with equality
- Term Rewriting and All That
- Rewriting-based repairing strategies for XML repositories
- Canonical ground Horn theories
- Deciding expressive description logics in the framework of resolution
- Modular termination and combinability for superposition modulo counter arithmetic
- Proving weak properties of rewriting
- Equational theorem proving modulo
- Strategic rewriting
- Narrowing based inductive proof search
- Interpolation systems for ground proofs in automated deduction: a survey
- Things to know when implementing KBO
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover
- Congruence closure modulo groups
- Selecting the selection
- Equational theorem proving for clauses over strings
- More problems in rewriting
- The disconnection tableau calculus
- Theory decision by decomposition
- scientific article; zbMATH DE number 177826 (Why is no real title available?)
- Efficient general AGH-unification
- Automated verification of selected equivalences for security protocols
- Dealing with explicit preferences and uncertainty in answer set programming
- Tableaux and hypersequents for justification logics
- An Iabelle/HOL formalization of narrowing and multiset narrowing for E-unifiability, reachability and infeasibility
- Computing ground congruence classes
- Making theory reasoning simpler
- On interpolation in automated theorem proving
- Timed term rewrite systems
- scientific article; zbMATH DE number 2043526 (Why is no real title available?)
- Abstract canonical presentations
- Efficient general unification for XOR with homomorphism
- Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).
- Rewrite-based decision procedures
- New Undecidability Results for Properties of Term Rewrite Systems
- Deciding knowledge in security protocols under some e-voting theories
- Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 4155899 (Why is no real title available?)
- Equational Theorem Proving for Clauses over Strings
This page was built for publication: Rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2751361)
