Pages that link to "Item:Q4033833"
From MaRDI portal
The following pages link to An algorithm for finding canonical sets of ground rewrite rules in polynomial time (Q4033833):
Displaying 23 items.
- Effective codescent morphisms in the varieties determined by convergent term rewriting systems. (Q278228) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations (Q689111) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Proof lengths for equational completion (Q1917087) (← 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)
- Normalized rewriting: An alternative to rewriting modulo a set of equations (Q2563692) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- Canonicity! (Q3541714) (← links)
- Engineering DPLL(T) + Saturation (Q3541724) (← links)
- (Q3811749) (← links)
- Canonical Ground Horn Theories (Q4916071) (← 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)
- Completion of rewrite systems with membership constraints (Q5204334) (← links)
- Linear completion (Q5881280) (← links)
- SCL(EQ): SCL for first-order logic with equality (Q6111523) (← links)
