Combining generalization algorithms in regular collapse-free theories

Cites work

\({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance
A modular order-sorted equational generalization algorithm
Anti-unification and the theory of semirings
Anti-unification of unordered goals
Combination techniques for non-disjoint equational theories
Combined hierarchical matching: the regular case
Combining matching algorithms: The regular case
Combining symbolic constraint solvers on algebraic domains
E-generalization using grammars
Equational anti-unification over absorption theories
Higher-order term indexing using substitution trees
scientific article; zbMATH DE number 4049025 (Why is no real title available?)
scientific article; zbMATH DE number 4112560 (Why is no real title available?)
scientific article; zbMATH DE number 18623 (Why is no real title available?)
scientific article; zbMATH DE number 2090320 (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?)
Idempotent anti-unification
Inductive logic programming at 30
Non-disjoint combined unification and closure by equational paramodulation
On equational theories, unification, and (un)decidability
Substitution tree indexing
Syntacticness, cycle-syntacticness and shallow theories
Term Rewriting and All That
Unification in a combination of arbitrary disjoint equational theories
Unification in combinations of collapse-free regular theories
Unification in the union of disjoint equational theories: Combining decision procedures
Unification, weak unification, upper bound, lower bound, and generalization problems
Unital anti-unification: type and algorithms

This page was built for publication: Combining generalization algorithms in regular collapse-free theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296800)