Dynamic domain splitting for numeric csp.pdfVIP

Dynamic domain splitting for numeric CSPs Narendra Jussien and Olivier Lhomme Abstract In this pap er a new search technique over nu pro cess typically a dichotomic one Constraintsolving algo meric csps is presented dynamic domain splitting The usual rithms are then a searchtree exploration where at each no de search technique over numeric csps is a dichotomic search in is applied one of the ltering techniques ab ove When a no de terleaved with a consistency ltering which is called domain leads to a contradiction a chronological backtracking is p er splitting This pap er prop oses to replace chronological back formed tracking at the core of domain splitting by a non destructive What is prop osed in this pap er is yet another adaptation backtracking technique of a csp idea to numeric csps It do es not consist in another ltering technique but rather in a new search tree exploration Intro duction To the authors knowledge no work aiming at improving that searchtree exploration has b een done on numeric csps al Many industrial and engineering problems can b e seen as con though chronological backtracking could b e replaced by sev straint satisfaction problems csps A csp is dened by a set eral candidates For example of variables each with an asso ciated domain of p ossible values intel ligent backtracking algorithms aim at backtracking in and a set of constraints on the variables This pap er deals