The competence of sub-optimal theories of structure mapping on hard analogies

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1997, Pages 232-237

  Veale, Tony ^a   Keane, Mark ^b  

^a DUBLIN CITY UNIVERSITY   (Ireland)

^b TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ANALOGICAL REASONING; HEURISTIC APPROACH; NP-HARDNESS; OPTIMAL SOLUTIONS; SUB-OPTIMAL PERFORMANCE;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS;

STRUCTURAL OPTIMIZATION;

EID: 84880682566     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. T. Akutsu. An (RNC) Algorithm for Finding a Largest Common Subtree of Two Trees, IEICE Transactions on Information and Systems, 75-D, pages 95-101, 1992.
2. R. Bakker, F. Dikker, F. Templeman, and P. Wognum. Diagnosing and Solving Over-determined constraint satisfaction problems, in the Proceedings of IJCAI'93, the thirteenth International Joint Conference on Artificial Intelligence. Morgan Kauffinan, 1993.
3. J. Brack and J. W. Goodman. On the Power of Neural Networks for Solving Hard Problems, Journal of Complexity 6, pages 129-135, 1990.
4. B. Falkenhainer, K. D. Foibus, and D. Gentner. Structure-Mapping Engine. Artificial Intelligence, 41, pages 1-63, 1989.
5. K. D. Foibus, R. Ferguson and D. Gentner. Incremental Structure-Mapping, in the Proceedings of the Sixteenth Annual Meeting of the Cognitive Science Society, Atlanta, Georgia. Hillsdale, NJ: Lawrence Erlbaum, 1994.
6. K. D. Foibus, personal communication, August 1996.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, NY, 1979.
8. K. J. Holyoak and P. Thagard. Analogical Mapping by Constraint Satisfaction, Cognitive Science 13, pp 295-355, 1989.
9. J. J. Hopfield and D. W. Tank. "Neural" Computation of Decisions in Optimization Problems. Biological Cybernetics 52, pp 141-152, 1985.
10. Keane, M. T. and M. Brayshaw. The Incremental Analogical Machine: A computational model of analogy. In D. Sleeman (Ed.), European Working Session on Learning. Pitman, 1988.
11. D. Mitchell, B. Selman and H. J. Levesque. Hard and Easy distributions of SAT problems, in the proceedings of AAAI'92, the 1992 conference of the American Association for Al, 1992.
12. R. Mohr, and T. Henderson. Arc and Path Consistency Revisited. Artificial Intelligence 25, pages 65-74, 1986.
13. D. Oblinger, and K. D. Foibus. Making SME Pragmatic and Greedy, in the Proc. of the Twelfth Annual Meeting of the Cognitive Science Society. Lawrence Erlbaum, 1990.
14. T. Veale, B. Smyth, D. O'Donoghue and M. T. Keane. Representational Myopia in Cognitive Mapping, in the Proc. of the AAAI workshop on Source of the Power in Cognitive Theories, Portland, 1996.
15. T. Veale, D. O'Donoghue and M. T. Keane. Computability as a Limiting Cognitive Constraint: Complexity Concerns in Metaphor Comprehension, Cognitive Linguistics: Cultural, Psychological and Typological Issues (forthcoming).