Name
Abstract | ||
|---|---|---|
Anti-unification has often be used as a tool for analogy making. But while first-order anti-unification is too simple for many applications, general higher-order anti-unification is too complex and leads into theoretical difficulties. In this paper we present a restricted framework for higher-order substitutions and show that anti-unification is well-defined in this setting. A complexity measure for generalizations can be introduced in a quite natural way, which allows for selecting preferred generalizations. An algorithm for computing such generalizations is presented and the utility of complexity for anti-unifying sets of terms is discussed by an extended example. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-76928-6_29 | Australian Conference on Artificial Intelligence |
Keywords | Field | DocType |
complexity measure,general higher-order anti-unification,restricted framework,first-order anti-unification,restricted higher-order anti-unification,theoretical difficulty,preferred generalization,extended example,anti-unifying set,analogy making,higher-order substitution,higher order | Discrete mathematics,Anti-unification,Algebra,Generalization,Analogy,Information complexity,Mathematics | Conference |
Volume | ISSN | ISBN |
4830 | 0302-9743 | 3-540-76926-9 |
Citations | PageRank | References |
21 | 1.33 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulf Krumnack | 1 | 87 | 13.03 |
| Angela Schwering | 2 | 319 | 31.11 |
| Helmar Gust | 3 | 143 | 22.86 |
| Kai-uwe Kühnberger | 4 | 211 | 28.67 |