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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chalmers, D.J., French, R.M., Hofstadter, D.R.: High-level perception, representation, and analogy: A critique of artificial intelligence methodology. Journal of Experimental and Theoretical Artificial Intelligence 4(3), 185–211 (1992)
Forbus, K.D., Gentner, D., Markman, A.B., Ferguson, R.W.: Analogy just looks like high-level perception: why a domain-general approach to analogical mapping is right. Journal of Experimental & Theoretical Artificial Intelligence 10, 231–257 (1998)
Holyoak, K., Morrison, R. (eds.): The cambridge handbook on thinking and reasoning. Cambridge University Press, Cambridge (2005)
Oppenheimer: Analogy in science. American Psychologist 11, 127–135 (1956)
Gentner, D.: The mechanism of analogical learning. In: Vosniadou, S., Ortony, A. (eds.) Similarity and analogical reasoning, pp. 199–241. Cambridge University Press, Cambridge (1989)
Hofstadter, D.R., Mitchell, J.: The copycat project: A model of mental fluidity and analogy-making. In: Hofstadter, D.R., group, F.A.R. (eds.) Fluid Concepts and Creative Analogies. Basic Books, pp. 205–267 (1995)
Plotkin, G.D.: A note on inductive gneralization. Machine Intelligence 5, 153–163 (1970)
Gust, H., Kühnberger, K.U., Schmid, U.: Metaphors and heuristic-driven theory projection (hdtp). Theoretical Computer Science 354(1), 98–117 (2006)
Hasker, R.W.: The replay of program derivations. PhD thesis, Champaign, IL, USA (1995)
Pfenning, F.: Unification and anti-unification in the Calculus of Constructions. In: Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, The Netherlands, pp. 74–85 (1991)
Wagner, U.: Combinatorically restricted higher order anti-unification. An application to programming by analogy. Master’s thesis, Technische Universität Berlin (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumnack, U., Schwering, A., Gust, H., Kühnberger, KU. (2007). Restricted Higher-Order Anti-Unification for Analogy Making. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-76928-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76926-2
Online ISBN: 978-3-540-76928-6
eBook Packages: Computer ScienceComputer Science (R0)