While reasoning with cases is usually done in a similarity-based manner, additional general knowledge is often represented in rules, constraints, or ontology definitions and is applied in a deductive reasoning process. This paper presents a new view on the combination of deductive and similarity-based reasoning, which is embedded in the CBR context. The basic idea is to view general knowledge and cases as a logical theory of a domain. Similarity-based reasoning is introduced as search for the most similar element in the deductive closure of the domain theory. We elaborate this approach and introduce several related search algorithms, which are analyzed in an experimental study. Further, we show how several previous approaches for using general knowledge in CBR can be mapped to our new view. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bergmann, R., & Mougouie, B. (2006). Finding similar deductive consequences - A new search-based framework for unified reasoning from cases and general knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4106 LNAI, pp. 271–285). Springer Verlag. https://doi.org/10.1007/11805816_21
Mendeley helps you to discover research relevant for your work.