Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping

Many computational models in cognitive science and artificial intelligence face the problem of computational intractability when assumed to operate for unrestricted input domains. Tractability may be achieved by restricting the input domain, but some degree of generality is typically required to model human-like intelligence. Moreover, it is often non-obvious which restrictions will render a model tractable or not. We present an analytical tool that can be used to identify sources of intractability in a model’s input domain. For our illustration, we use Gentner’s Structure-Mapping Theory of analogy as a running example.

[1]  Jan Arne Telle,et al.  An Overview of Techniques for Designing Parameterized Algorithms , 2008, Comput. J..

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

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Dedre Gentner,et al.  Structure-Mapping: A Theoretical Framework for Analogy , 1983, Cogn. Sci..

[5]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

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

[7]  Iris van Rooij,et al.  Sources of complexity in subset choice , 2005 .

[8]  Tony Veale,et al.  Computability as a limiting cognitive constraint , 1999 .

[9]  Iris van Rooij,et al.  Approximating Solution Structure , 2007, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.

[10]  Mark T. Keane,et al.  Computability as a Limiting Cognitive Constraint:Complexity Concerns in Metaphor Comprehension about whichCognitive Linguists should be Aware , 1999 .

[11]  Iris van Rooij,et al.  Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities , 2008, Comput. J..

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

[13]  Iris van Rooij,et al.  The Incoherence of Heuristically Explaining Coherence , 2006 .

[14]  Michael R. Fellows,et al.  The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors , 2008, Comput. J..

[15]  Daniel Kahneman,et al.  Availability: A heuristic for judging frequency and probability , 1973 .

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

[17]  Kenneth D. Forbus,et al.  Structural Evaluation of Analogies : What Counts? , 1989 .

[18]  S. Phillips,et al.  Processing capacity defined by relational complexity: implications for comparative, developmental, and cognitive psychology. , 1998, The Behavioral and brain sciences.

[19]  Tony Veale,et al.  The Competence of Sub-Optimal Theories of STructure Mapping on Hard Analogies , 1997, IJCAI.