Searching for "Rewrite-Based Decision Procedures." – sorted by Relevance.
-
Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
- Cited by 14 (11 self) – Add To MetaCart
-
On variable-inactivity and polynomial T-satisfiability procedures
- . Lowering the complexity of rewrite-based T -satisfiability procedures. 1.1 Rewrite-based T -decision
- Add To MetaCart
-
Decidability Results For Categorical Notions Related To Monads By Rewriting Techniques
- -implemented the rewriting based decision procedures in the logic programming language Elf. This language is designed
- Add To MetaCart
-
Rewriting Methods for Word Problems
- Many rewrite-system decision procedures are known; perhaps the first such procedure for a word problem
- Cited by 2 (1 self) – Add To MetaCart
-
Equational Inference, Canonical Proofs, And Proof Orderings
- inference systems|to various rewrite-based theorem-proving methods, including re nements of the standard
- Cited by 23 (10 self) – Add To MetaCart
-
33 Examples of Termination
- the rst rewrite-based decision procedure, using these dozen rules to compute normal forms: xnx ! e x (xny
- Cited by 20 (0 self) – Add To MetaCart
-
Abstract canonical inference
- of formulæ that are “complete” in the sense that completion can provide a rewriting-based decision procedure
- Cited by 8 (5 self) – Add To MetaCart
-
The simple type theory of normalisation by evaluation
- , has so-far been considered to be the fact that the algorithm amounts to a non-rewriting-based decision
- Cited by 1 (0 self) – Add To MetaCart

