One current direction in AI research is to focus on combining different reasoning styles such as deduction, induction, abduction, analogical reasoning, non-monotonic reasoning, vague and uncertain reasoning. The philosopher Imre Lakatos produced one such theory of how people with different reasoning styles collaborate to develop mathematical ideas. Lakatos argued that mathematics is a quasi-empirical, flexible, fallible, human endeavour, involving negotiations, mistakes, vague concept definitions and disagreements, and he outlined a heuristic approach towards the subject. In this chapter we apply these heuristics to the AI domains of evolving requirement specifications, planning and constraint satisfaction problems. In drawing analogies between Lakatos’s theory and these three domains we identify areas of work which correspond to each heuristic, and suggest extensions and further ways in which Lakatos’s philosophy can inform AI problem solving. Thus, we show how we might begin to produce a philosophically-inspired AI theory of combined reasoning.
|Title of host publication||Thinking machines and the philosophy of computer science|
|Subtitle of host publication||concepts and principles|
|Place of Publication||Hershey|
|Publisher||Information Science Reference|
|Number of pages||25|
|Publication status||Published - 2010|
Pease, A., Ireland, A., Colton, S., Ramezani, R., Smaill, A., Llano, M. T., Grov, G., & Guhe, M. (2010). Applying Lakatos-style reasoning to AI problems. In J. Vallverdu (Ed.), Thinking machines and the philosophy of computer science: concepts and principles (pp. 149-173). Information Science Reference. http://www.igi-global.com/book/thinking-machines-philosophy-computer-science/40293