An algorithm for finding canonical sets of ground rewrite rules in polynomial time
From MaRDI portal
Publication:4033833
Recommendations
Cited in
(26)- On the complexity of recursive path orderings
- Completion of rewrite systems with membership constraints
- SCL(EQ): SCL for first-order logic with equality
- Intersection of finitely generated congruences over term algebra
- Canonical ground Horn theories
- Effective codescent morphisms in the varieties determined by convergent term rewriting systems.
- Congruential complements of ground term rewrite systems
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
- scientific article; zbMATH DE number 4014065 (Why is no real title available?)
- On deciding satisfiability by theorem proving with speculative inferences
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- Fine-grained concurrent completion
- scientific article; zbMATH DE number 3928345 (Why is no real title available?)
- scientific article; zbMATH DE number 3870642 (Why is no real title available?)
- Canonicity!
- Order-Sorted Rewriting and Congruence Closure
- Applying term rewriting methods to finite groups
- Efficient ground completion
- Term rewriting restricted to ground terms.
- scientific article; zbMATH DE number 4043234 (Why is no real title available?)
- scientific article; zbMATH DE number 4080962 (Why is no real title available?)
- Linear completion
- Congruence closure of compressed terms in polynomial time
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- Deciding the word problem for ground identities with commutative and extensional symbols
- Engineering DPLL(T) + Saturation
This page was built for publication: An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033833)
