The structure-mapping engine: algorithm and examples
Artificial Intelligence
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Metaphors and heuristic-driven theory projection (HDTP)
Theoretical Computer Science - Algebraic methods in language processing
A heuristic program to solve geometric-analogy problems
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
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
Parameterized Complexity
When almost is not even close: remarks on the approximability of HDTP
AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
| Hi-index | 0.00 |
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.