The structure-mapping engine: algorithm and examples
Artificial Intelligence
Approximation algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Metaphors and heuristic-driven theory projection (HDTP)
Theoretical Computer Science - Algebraic methods in language processing
Introduction: Aspects of Artificial General Intelligence
Proceedings of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006
Restricted higher-order anti-unification for analogy making
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Refinements of restricted higher-order anti-unification for heuristic-driven theory projection
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Editorial: Analogies - Integrating Cognitive Abilities
Cognitive Systems Research
Syntactic principles of heuristic-driven theory projection
Cognitive Systems Research
A computational account of conceptual blending in basic mathematics
Cognitive Systems Research
Complex analogies: remarks on the complexity of HDTP
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
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.