Complex Analogies: Remarks on the Complexity of HDTP

After an introduction to Heuristic-Driven Theory Projection (HDTP) as framework for computational analogy-making, and a compact primer on parametrized complexity theory, we provide a complexity analysis of the key mechanisms underlying HDTP, together with a short discussion of and reflection on the obtained results. Amongst others, we show that restricted higher-order anti-unification as currently used in HDTP is W[1]-hard (and thus NP-hard) already for quite simple cases. Also, we obtain W[2]-hardness, and NP-completeness, for the original mechanism used for reducing second-order to first-order anti-unifications in the basic version of the HDTP system.

[1]  Angela Schwering,et al.  Restricted Higher-Order Anti-Unification for Analogy Making , 2007, Australian Conference on Artificial Intelligence.

[2]  Mehmet A. Orgun,et al.  AI 2007: Advances in Artificial Intelligence, 20th Australian Joint Conference on Artificial Intelligence, Gold Coast, Australia, December 2-6, 2007, Proceedings , 2007, Australian Conference on Artificial Intelligence.

[3]  Ulf Krumnack,et al.  Theory Blending as a Framework for Creativity in Systems for General Intelligence , 2012 .

[4]  Kai-Uwe Kühnberger,et al.  A computational account of conceptual blending in basic mathematics , 2011, Cognitive Systems Research.

[5]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[6]  Petra Hendriks,et al.  Proceedings of the Workshop on Reasoning About Other Minds: Logical and Cognitive Perspectives (RAOM-2011) , 2011 .

[7]  Joel M. Hektner,et al.  Theoretical Foundations of ESM , 2007 .

[8]  Melanie Mitchell,et al.  The Copycat project: a model of mental fluidity and analogy-making , 1995 .

[9]  Ion Juvina,et al.  Proceedings of the 31st Annual Meeting of the Cognitive Science Society , 2009 .

[10]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[11]  Angela Schwering,et al.  Syntactic principles of heuristic-driven theory projection , 2009, Cognitive Systems Research.

[12]  Analogies : Integrating Multiple Cognitive Abilities Guest Editorial Why Analogy ? , 2022 .

[13]  Brian Falkenhainer,et al.  The Structure-Mapping Engine: Algorithm and Examples , 1989, Artif. Intell..

[14]  Angela Schwering,et al.  Analogies – Integrating Cognitive Abilities , 2009, Cognitive Systems Research.

[15]  Kai-Uwe Kühnberger,et al.  Metaphors and heuristic-driven theory projection (HDTP) , 2006, Theor. Comput. Sci..

[16]  Gordon Plotkin,et al.  A Note on Inductive Generalization , 2008 .

[17]  Ulf Krumnack,et al.  Refinements of Restricted Higher-Order Anti-Unification for Heuristic-Driven Theory Projection , 2011, KI.

[18]  Kai-Uwe Kühnberger,et al.  Towards a Domain-Independent Computational Framework for Theory Blending , 2011, AAAI Fall Symposium: Advances in Cognitive Systems.

[19]  W R Reitman,et al.  Argus: an information-processing model of thinking. , 1964, Behavioral science.

[20]  Thomas G. Evans,et al.  A heuristic program to solve geometric-analogy problems , 1964, AFIPS '64 (Spring).

[21]  Iris van Rooij,et al.  The Tractable Cognition Thesis , 2008, Cogn. Sci..

[22]  Kenneth D. Forbus,et al.  MAC/FAC: A Model of Similarity-Based Retrieval , 1995, Cogn. Sci..

[23]  H. Gust,et al.  Mathematical reasoning with higher-order anti-unifcation , 2010 .

[24]  Kai-Uwe Kühnberger,et al.  An Argument for an Analogical Perspective on Rationality & Decision-Making , 2011 .

[25]  F. R. A. Hopgood,et al.  Machine Intelligence 6 , 1972, The Mathematical Gazette.

[26]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[27]  D. Gentner.  Structure‐Mapping: A Theoretical Framework for Analogy* , 1983 .

[28]  F. R. A. Hopgood,et al.  Machine Intelligence 5 , 1971, The Mathematical Gazette.

[29]  Gabriel M. Kuper,et al.  Efficient parallel algorithms for anti-unification and relative complement , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[30]  Marco Cesati,et al.  Compendium of Parameterized Problems , 2006 .

[31]  Gordon Plotkin,et al.  A Further Note on Inductive Generalization , 2008 .