Case-based reasoning, where cases are described in terms of problem-solution pairs case = $(x,y)$, amounts to propose a solution to a new problem on the basis of past experience made of stored cases. On the one hand, the building of the solution to a new problem may be viewed as a form of belief revision of the solution of a retrieved case (whose problem part is similar to the new problem) constrained by domain knowledge. On the other hand, an extrapolation mechanism based on analogical proportions has been proposed. It exploits triplets of cases ($case^a$ ,$case^b$ ,$case^c$) whose descriptions of problem parts $x^a$ , $x^b$ , $x^c$ form an analogical proportion with the new problem xtgt, in such a way that “xa is to xb as xc is to $x^{tgt}$”. Then, the analogical inference amounts to compute a solution $y^{tgt}$ of xtgt by solving (when possible) an equation expressing that “$y^a$ is to $y^b$ as $y^c$ is to $y^{tgt}$” (where $y^a$ , $y^b$ and $y^c$ are respectively the solution parts of $case^a$ ,$case^b$ ,$case^c$). The paper investigates how the belief revision view and analogical extrapolation relate. Besides that it constitutes an unexpected bridge between areas which ignore each other, it casts some light on the adaptation mechanism in case-based reasoning. The paper is illustrated by a running example