On the complexity of least general generalization with commutative functions
From MaRDI portal
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- A modular order-sorted equational generalization algorithm
- A new algorithm for computing least generalization of a set of atoms
- A note on the parallel complexity of anti-unification
- An Efficient Unification Algorithm
- Anti-unification of unordered goals
- Complexity of matching problems
- Faster Subtree Isomorphism
- Higher-order pattern generalization modulo equational theories
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3349328 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- Inductive Logic Programming
- Learning logic programs by explaining their failures
- Linear unification
- On the approximation of largest common subtrees and largest common point sets
- On the parameterized complexity of associative and commutative unification
- Order-sorted equational generalization algorithm revisited
- Unification, weak unification, upper bound, lower bound, and generalization problems
- Unification: a multidisciplinary survey
This page was built for publication: On the complexity of least general generalization with commutative functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446542)