Abstract
Empirical research supports the belief that structural commonalities between two domains are the main guidance for the construction of analogies. Restricted higher-order anti-unification has been shown suitable to find structural commonalties and generate mappings between domains in the symbolic analogy model Heuristic-Driven Theory Projection (HDTP). This paper will describe how to enforce and integrate restrictions on mappings between symbols from a many-to-many up to a one-to-one symbol correspondence. We will also discuss how sorts together with sortal ontologies can be incorporated into anti-unification within HDTP and thereby restrict possible mappings between domains.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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)
Falkenhainer, B., Forbus, K.D., Gentner, D.: The structure-mapping engine: Algorithm and examples. Artificial Intelligence 41(1), 1–63 (1989)
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)
Gentner, D.: Structure-mapping: A theoretical framework for analogy. Cognitive Science 7(2), 155–170 (1983)
Gentner, D.: The mechanism of analogical learning. In: Vosniadou, S., Ortony, A. (eds.) Similarity and Analogical Reasoning, pp. 199–241. Cambridge University Press, New York (1989)
Guhe, M., Pease, A., Smaill, A., Schmidt, M., Gust, H., Kühnberger, K.U., Krumnack, U.: Mathematical reasoning with higher-order anti-unification. In: Proceedings of the 32nd Annual Conference of the Cognitive Science Society, pp. 1992–1997. Cognitive Science Society, Austin (2010)
Gust, H., Krumnack, U., Kühnberger, K.U., Schwering, A.: Analogical reasoning: A core of cognition. Zeitschrift für Künstliche Intelligenz (KI), Themenheft KI und Kognition 1, 8–12 (2008)
Gust, H., Kühnberger, K.U., Schmid, U.: Metaphors and heuristic-driven theory projection (HDTP). Theoretical Computer Science 354(1), 98–117 (2006)
Indurkhya, B.: Metaphor and cognition. Kluver, Dodrecht (1992)
Krumnack, U., Schwering, A., Gust, H., Kühnberger, K.U.: Restricted higher-order anti-unification for analogy making. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 273–282. Springer, Heidelberg (2007)
McNeill, F., Bundy, A.: Dynamic, automatic, first-order ontology repair by diagnosis of failed plan execution. IJSWIS (International Journal on Semantic Web and Information Systems) special issue on Ontology Matching 3, 1–35 (2007)
Schmidt, M.: Restricted Higher-Order Anti-Unification for Heuristic-Driven Theory Projection, PICS (Publications of the Institute of Cognitive Science), vol. 31. University of Osnabrück, Osnabrück (2010)
Vosniadou, S., Ortony, A.: Similarity and analogical reasoning. Cambridge University Press, Cambridge (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, M., Gust, H., Kühnberger, KU., Krumnack, U. (2011). Refinements of Restricted Higher-Order Anti-Unification for Heuristic-Driven Theory Projection. In: Bach, J., Edelkamp, S. (eds) KI 2011: Advances in Artificial Intelligence. KI 2011. Lecture Notes in Computer Science(), vol 7006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24455-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-24455-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24454-4
Online ISBN: 978-3-642-24455-1
eBook Packages: Computer ScienceComputer Science (R0)