Pages that link to "Item:Q689111"
From MaRDI portal
The following pages link to A fast algorithm for generating reduced ground rewriting systems from a set of ground equations (Q689111):
Displaying 20 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Symbol different term rewrite systems (Q492918) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- CHAP and rewrite components (Q766175) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- (Q3811749) (← links)
- Efficient ground completion (Q5055736) (← links)
- Fine-grained concurrent completion (Q5055848) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
