To cite this version:Élise Vareilles, Michel Aldanondo, Aurélien Codet de Boisse, Thierry Coudert, Paul Gaborit, et al.. How to take into account general and contextual knowledge for interactive aiding design: Towards the coupling of CSP and CBR approaches. Engineering Applications of Artificial Intelligence, Elsevier, 2012Elsevier, , vol. 25, pp. 31 -47. 10.1016Elsevier, /j.engappai.2011 Any correspondence concerning this service should be sent to the repository administrator: staff-oatao@inp-toulouse.fr a b s t r a c tThe goal of this paper is to show how it is possible to support design decisions with two different tools relying on two kinds of knowledge: case-based reasoning operating with contextual knowledge embodied in past cases and constraint filtering that operates with general knowledge formalized using constraints. Our goals are, firstly to make an overview of existing works that analyses the various ways to associate these two kinds of aiding tools essentially in a sequential way. Secondly, we propose an approach that allows us to use them simultaneously in order to assist design decisions with these two kinds of knowledge. The paper is organized as follows. In the first section, we define the goal of the paper and recall the background of case-based reasoning and constraint filtering. In the second section, the industrial problem which led us to consider these two kinds of knowledge is presented. In the third section, an overview of the various possibilities of using these two aiding decision tools in a sequential way is drawn up. In the fourth section, we propose an approach that allows us to use both aiding decision tools in a simultaneous and iterative way according to the availability of knowledge. An example dealing with helicopter maintenance illustrates our proposals.

a b s t r a c tA particular data structure named a Quad Tree allows a better representation of solution space of binary continuous constraints Cðx 1 ; x 2 Þ, than classical continuous consistencies. The generation and integration of this data structure do not raise any particular problem for continuous constraints defined by only one mathematical formula [Sam, D., 1995. Constraint consistency techniques for continuous domains. Ph.D. Thesis, É cole Polytechnique Fé dé rale de Lausanne]. In this paper, we propose to extend the method of generating Quad Trees in order to take into account, in CSPs, binary continuous constraints defined by a piecewise constraint, i.e. a set of functions defined on intervals. The first section presents the industrial requirements which led us to take into account this type of constraint in CSP. The second section recalls the principles of the Quad Tree. The last section describes our contributions relevant to Quad Tree extensions dealing with piecewise constraints.