Abstract
A growing number of researchers in Cognitive Science advocate the thesis that human cognitive capacities are constrained by computational tractability. If right, this thesis also can be expected to have far-reaching consequences for work in Artificial General Intelligence: Models and systems considered as basis for the development of general cognitive architectures with human-like performance would also have to comply with tractability constraints, making in-depth complexity theoretic analysis a necessary and important part of the standard research and development cycle already from a rather early stage. In this paper we present an application case study for such an analysis based on results from a parametrized complexity and approximation theoretic analysis of the Heuristic Driven Theory Projection (HDTP) analogy-making framework.
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
Wang, P., Goertzel, B.: Introduction: Aspects of Artificial General Intelligence. In: Goertzel, B., Wang, P. (eds.) Advances in Artificial General Intelligence - Proc. of the AGI Workshop 2006. Frontiers in Artificial Intelligence and Applications, vol. 157, pp. 1–16. IOS Press (2007)
van Rooij, I.: The tractable cognition thesis. Cognitive Science 32, 939–984 (2008)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Robere, R., Besold, T.R.: Complex Analogies: Remarks on the Complexity of HDTP. In: Thielscher, M., Zhang, D. (eds.) AI 2012. LNCS, vol. 7691, pp. 530–542. Springer, Heidelberg (2012)
Schwering, A., Kühnberger, K.U., Kokinov, B.: Analogies: Integrating multiple cognitive abilities - guest editorial. Journal of Cognitive Systems Research 10(3) (2009)
Hofstadter, D.: Epilogue: Analogy as the core of cognition. In: Gentner, D., Holyoak, K., Kokinov, B. (eds.) The Analogical Mind: Perspectives from Cognitive Science, pp. 499–538. MIT Press, Cambridge (2001)
Hofstadter, D., Mitchell, M.: The copycat project: a model of mental fluidity and analogy-making. In: Holyoak, K., Barnden, J. (eds.) Advances in Connectionist and Neural Computation Theory. Analogical Connections, vol. 2, pp. 31–112. Ablex, New York (1994)
Falkenhainer, B., Forbus, K., Gentner, D.: The structure-mapping engine: Algorithm and examples. Artificial Intelligence 41(1), 1–63 (1989)
Gentner, D., Forbus, K.: MAC/FAC: A Model of Similarity-based Retrieval. Cognitive Science 19, 141–205 (1991)
Gentner, D.: Structure-mapping: A theoretical framework for analogy. Cognitive Science 7(2), 155–170 (1983)
Gust, H., Kühnberger, K.U., Schmid, U.: Metaphors and Heuristic–Driven Theory Projection (HDTP). Theoretical Computer Science 354, 98–117 (2006)
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)
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. Journal of Cognitive Systems Research 12(3), 249–265 (2011)
Plotkin, G.D.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)
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)
Schmidt, M., Gust, H., Kühnberger, K.-U., Krumnack, U.: Refinements of restricted higher-order anti-unification for heuristic-driven theory projection. In: Bach, J., Edelkamp, S. (eds.) KI 2011. LNCS, vol. 7006, pp. 289–300. Springer, Heidelberg (2011)
Guhe, M., Pease, A., Smaill, A., Schmidt, M., Gust, H., Kühnberger, K.U., Krumnack, U.: Mathematical reasoning with higher-order anti-unifcation. In: Proc. of the 32nd Annual Conference of the Cognitive Science Society, pp. 1992–1997 (2010)
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.) Proc. of the Workshop on Reasoning About Other Minds (RAOM 2011). CEUR Workshop Proceedings, vol. 751, pp. 20–31. CEUR-WS.org (July 2011)
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. AAAI Technical Report of the AAAI Fall 2011 Symposium on Advances in Cognitive Systems, pp. 210–217 (2011)
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 (2012)
Vazirani, V.: Approximation Algorithms. Springer (2001)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic numbers. In: Proc. of the 38th ACM Symposium on Theory of Computing, pp. 681–690 (2006)
Tohill, J., Holyoak, K.: The impact of anxiety on analogical reasoning. Thinking & Reasoning 6(1), 27–40 (2000)
van Rooij, I., Wareham, T.: Intractability and approximation of optimization theories of cognition. Journal of Mathematical Psychology 56(4), 232–247 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besold, T.R., Robere, R. (2013). When Almost Is Not Even Close: Remarks on the Approximability of HDTP. In: Kühnberger, KU., Rudolph, S., Wang, P. (eds) Artificial General Intelligence. AGI 2013. Lecture Notes in Computer Science(), vol 7999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39521-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-39521-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39520-8
Online ISBN: 978-3-642-39521-5
eBook Packages: Computer ScienceComputer Science (R0)