An efficient labelled nested multiset unification algorithm
From MaRDI portal
Publication:2152299
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- An Efficient Unification Algorithm
- An introduction to cP systems
- Complexity of matching problems
- Complexity of the unification algorithm for first-order expressions
- Complexity of unification problems with associative-commutative operators
- Computing with membranes
- scientific article; zbMATH DE number 4049047 (Why is no real title available?)
- scientific article; zbMATH DE number 3569825 (Why is no real title available?)
- scientific article; zbMATH DE number 1330135 (Why is no real title available?)
- scientific article; zbMATH DE number 1337735 (Why is no real title available?)
- scientific article; zbMATH DE number 3995082 (Why is no real title available?)
- scientific article; zbMATH DE number 3999263 (Why is no real title available?)
- On the sequential nature of unification
- Unification as a complexity measure for logic programming
- Unification theory
Cited in
(3)
This page was built for publication: An efficient labelled nested multiset unification algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152299)