Case-Based Reasoning for Multi-Step Problems and Its Integration with Heuristic Search

Theusual case-basedreasoningapproachassumesthat foreachgivenprobleminstanceit is necessaryto retrieve fromscratcha similarcasefromthe casebase.Therefore, anindexedmemorystmctareor othermeansof facilitatingfast accessis typicallyneeded.Moreover,a complete solutionis usuallystoredtogetherwitheachcase,that can be adaptedto the givenproblem.Wedevelopeda different approachfor multi-stepproblems.It utilizes the informationaboutthe relevantcasefor the last step to quicklyfindtheappropriatecaseforthecurrentstepfrom onlyfewrelevantcasesthat are connected.Therefore,no specialindexingschemataare required.Instead,westore a valuefor eachcaseandsimilaritylinksto othercases, butnosolution.Forsituationsoutsidethe scopeof thecase baseweintegratedcase-basedreasoningin several wayswithheuristic search.Weperformedexperimentsin a gamedomain,that showedthe usefulnessof our approach.In particular,weachieveda statisticallysignificant improvementthroughcombinationof case-based reasoningwithsearchoverpuresearc...

• Type: Conference
• Year: 1994
• Where: EWCBR
• Authors: Christian Reiser, Hermann Kaindl
• Keywords: Automated Reasoning, EWCBR 1994, Improvementthroughcombinationof Case-based Reasoningwithsearchoverpuresearchor, Necessaryto Retrieve Fromscratcha, Theusual Case-basedreasoningapproachassumesthat Foreachgivenprobleminstanceit