Complexity of the unification algorithm for first-order expressions
From MaRDI portal
Cited in
(6)- Unification problem in equational theories
- Complete sets of unifiers and matchers in equational theories
- An efficient labelled nested multiset unification algorithm
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Using linear constraints for logic program termination analysis
- Average-case analysis of unification algorithms
This page was built for publication: Complexity of the unification algorithm for first-order expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1228213)