The following pages link to Efficient ground completion (Q5055736):
Displaying 7 items.
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- On the duality of abduction and model generation in a framework for model generation with equality (Q1314425) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Logic with equality: Partisan corroboration and shifted pairing (Q1854299) (← links)
- (Q4993342) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
