A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
From MaRDI portal
(Redirected from Publication:689111)
Recommendations
- Efficient ground completion
- scientific article; zbMATH DE number 4080962
- Publication:4866585
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Algorithms and reductions for rewriting problems
- Rewriting systems on FP expressions to reduce the number of sequences yielded
- Reduction algorithms for solving large systems of logical equations
- A new decidability technique for ground term rewriting systems with applications
- scientific article; zbMATH DE number 4092759
- Congruential complements of ground term rewrite systems
Cited in
(20)- Restricted ground tree transducers
- Deciding the word problem for ground identities with commutative and extensional symbols
- Congruential complements of ground term rewrite systems
- Symbol different term rewrite systems
- Deterministic bottom-up tree transducers and ground term rewrite systems
- Intersection of finitely generated congruences over term algebra
- Term rewriting restricted to ground terms.
- CHAP and rewrite components
- On deciding satisfiability by theorem proving with speculative inferences
- Efficient ground completion
- Algorithms and reductions for rewriting problems. II.
- On the complexity of recursive path orderings
- On ground tree transformations and congruences induced by tree automata.
- Congruence closure of compressed terms in polynomial time
- Fine-grained concurrent completion
- Deciding confluence of certain term rewriting systems in polynomial time
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
- scientific article; zbMATH DE number 4080962 (Why is no real title available?)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
This page was built for publication: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689111)
