Skip to main content

Complex Analogies: Remarks on the Complexity of HDTP

  • Conference paper
AI 2012: Advances in Artificial Intelligence (AI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7691))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Schwering, A., Kühnberger, K.U., Kokinov, B.: Analogies: Integrating multiple cognitive abilities - guest editorial. Journal of Cognitive Systems Research 10 (2009)

    Google Scholar 

  2. Reitman, W.R., Grove, R.B., Shoup, R.G.: Argus: An information-processing model of thinking. Behavioral Science 9, 270–281 (1964)

    Article  Google Scholar 

  3. Evans, T.G.: A heuristic program to solve geometric-analogy problems. In: Proceedings of the Spring Joint Computer Conference, AFIPS 1964, April 21-23, pp. 327–338. ACM, New York (Spring 1964)

    Google Scholar 

  4. Hofstadter, D., Mitchell, M.: The Copycat project: a model of mental fluidity and analogy-making. In: Advances in Connectionist and Neural Computation Theory. Analogical Connections, vol. 2, pp. 31–112. Ablex, New York (1994)

    Google Scholar 

  5. Falkenhainer, B., Forbus, K.D., Gentner, D.: The structure-mapping engine: Algorithm and examples. Artificial Intelligence 41, 1–63 (1989)

    Article  MATH  Google Scholar 

  6. Gentner, D., Forbus, K.D.: MAC/FAC: A Model of Similarity-based Retrieval. Cognitive Science 19, 141–205 (1991)

    Google Scholar 

  7. Gentner, D.: Structure-mapping: A theoretical framework for analogy. Cognitive Science 7, 155–170 (1983)

    Article  Google Scholar 

  8. Gust, H., Kühnberger, K.U., Schmid, U.: Metaphors and Heuristic–Driven Theory Projection (HDTP). Theoretical Computer Science 354, 98–117 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Schwering, A., Krumnack, U., Kühnberger, K.U., Gust, H.: Syntactic principles of Heuristic-Driven Theory Projection. Journal of Cognitive Systems Research 10(3), 251–269 (2009)

    Article  Google Scholar 

  10. Guhe, M., Pease, A., Smaill, A., Schmidt, M., Gust, H., Kühnberger, K.U., Krumnack, U.: Mathematical reasoning with higher-order anti-unifcation. In: Proceedings of the 32st Annual Conference of the Cognitive Science Society, pp. 1992–1997 (2010)

    Google Scholar 

  11. Guhe, M., Pease, A., Smaill, A., Martinez, M., Schmidt, M., Gust, H., Kühnberger, K.U., Krumnack, U.: A computational account of conceptual blending in basic mathematics. A computational account of conceptual blending in basic mathematics. Journal of Cognitive Systems Research 12(3), 249–265 (2011)

    Google Scholar 

  12. Plotkin, G.D.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)

    MathSciNet  Google Scholar 

  13. Plotkin, G.D.: A further note in inductive generalization. Machine Intelligence 6, 101–124 (1971)

    MathSciNet  MATH  Google Scholar 

  14. Krumnack, U., Schwering, A., Gust, H., Kühnberger, K.: 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)

    Chapter  Google Scholar 

  15. Schmidt, M., Gust, H., Kühnberger, K.U., Krumnack, U.: Refinements of restricted higher-order anit-unification for heuristic-driven theory projection. In: Proceedings 34th Annual German Conference on Artificial Intelligence, Springer (2011)

    Google Scholar 

  16. Schwering, A., Gust, H., Kühnberger, K.U.: Solving geometric analogies with the analogy model hdtp. In: Taaten, N.A., van Rijn, H. (eds.) Proceedings of the 31st Annual Meeting of the Cognitive Science Society, pp. 1780–1785. Cognitive Science Society, Austin (2009)

    Google Scholar 

  17. Besold, T.R., Gust, H., Krumnack, U., Abdel-Fattah, A., Schmidt, M., Kühnberger, K.U.: An argument for an analogical perspective on rationality & decision-making. In: van Eijck, J., Verbrugge, R. (eds.) Proceedings of the Workshop on Reasoning About Other Minds: Logical and Cognitive Perspectives (RAOM 2011). CEUR Workshop Proceedings, Groningen, The Netherlands, vol. 751, pp. 20–31 (2011) CEUR-WS.org

    Google Scholar 

  18. Martinez, M., Besold, T.R., Abdel-Fattah, A., Kühnberger, K.U., Gust, H., Schmidt, M., Krumnack, U.: Towards a Domain-Independent Computational Framework for Theory Blending. In: AAAI Technical Report of the AAAI Fall 2011 Symposium on Advances in Cognitive Systems, pp. 210–217 (2011)

    Google Scholar 

  19. Martinez, M., Besold, T.R., Abdel-Fattah, A., Gust, H., Schmidt, M., Krumnack, U., Kühnberger, K.U.: Theory Blending as a Framework for Creativity in Systems for General Intelligence. In: Wang, P., Goertzel, B. (eds.) Theoretical Foundations of AGI. Atlantis Press (in press, 2012)

    Google Scholar 

  20. Jörg Flum, M.G.: Parameterized Complexity Theory. Springer (2006)

    Google Scholar 

  21. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)

    Google Scholar 

  22. Kuper, G.M., McAloon, K.W., Palem, K.V., Perry, K.J.: Efficient parallel algorithms for anti-unification and relative complement (1988)

    Google Scholar 

  23. Cesati, M.: Compendium of parameterized problems, http://www.sprg.uniroma2.it/home/cesati/research/compendium/

  24. van Rooij, I.: The tractable cognition thesis. Cognitive Science 32, 939–984 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robere, R., Besold, T.R. (2012). Complex Analogies: Remarks on the Complexity of HDTP. In: Thielscher, M., Zhang, D. (eds) AI 2012: Advances in Artificial Intelligence. AI 2012. Lecture Notes in Computer Science(), vol 7691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35101-3_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35101-3_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35100-6

  • Online ISBN: 978-3-642-35101-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics