A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
From MaRDI portal
Publication:689111
DOI10.1006/JSCO.1993.1029zbMATH Open0804.68072OpenAlexW2037163667MaRDI QIDQ689111FDOQ689111
Authors: Wayne Snyder 
Publication date: 6 December 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1993.1029
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)
- Algorithms and reductions for rewriting problems. II.
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
- Deterministic bottom-up tree transducers and ground term rewrite systems
- On the complexity of recursive path orderings
- Intersection of finitely generated congruences over term algebra
- Congruential complements of ground term rewrite systems
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
- On deciding satisfiability by theorem proving with speculative inferences
- On ground tree transformations and congruences induced by tree automata.
- Deciding confluence of certain term rewriting systems in polynomial time
- CHAP and rewrite components
- Fine-grained concurrent completion
- Symbol different term rewrite systems
- Efficient ground completion
- Title not available (Why is that?)
- Term rewriting restricted to ground terms.
- Congruence closure of compressed terms in polynomial time
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols
- Restricted ground tree transducers
- Deciding the word problem for ground identities with commutative and 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)
