Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraint programming techniques are widely used to model and solve decision problems and many algorithms have been developed to solve automatically and efficiently families of CSPs; nevertheless, they do not help solve interactive decision support problems, like product configuration. In such problems, the user chooses the values of the variables, and the role of the system is not to solve the CSP, but to help the user in this task. Dynamic global consistency maintaining is one of the most useful functionalities that should be offered by such a CSP platform. Unfortunately, this task is intractable in the worst case. Since interactivity requires short response times, intractability must be circumvented some way. To this end, compilation methods have been proposed that transform the original problem into a data structure allowing a short response time. In this paper, we extend the work of Amilhastre et al. [1] and Vempaty [15] by the use of a new structure, tree-driven automata, that takes advantage of the structural characteristics of configuration problems (decomposition of the components into independent subcomponents). Tree-driven automata can be far more compact than classical automata while keeping their good properties, especially a tractable complexity for the maintenance of global consistency.

[1]  Daniel Sabin,et al.  Product Configuration Frameworks - A Survey , 1998, IEEE Intell. Syst..

[2]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[3]  Markus Stumptner,et al.  An Overview of Knowledge-Based Configuration , 1997, AI Commun..

[4]  Boi Faltings,et al.  Compiling constraint satisfaction problems , 1999, Artif. Intell..

[5]  T. Soininen,et al.  Dynamic Constraint Satisfaction in Configuration , 2003 .

[6]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

[7]  Eugene C. Freuder,et al.  Configuration as Composite Constraint Satisfaction , 1996 .

[8]  Markus Stumptner,et al.  An overview of knowledgedbased configuration , 1997 .

[9]  Nageshwara Rao Vempaty.  Solving Constraint Satisfaction Problems Using Finite State Automata , 1992, AAAI.

[10]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[11]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[12]  V. N. Rao,et al.  Solving constraint satisfaction problems using finite state automata , 1992, AAAI 1992.

[13]  Pierre Marquis,et al.  A Perspective on Knowledge Compilation , 2001, IJCAI.

[14]  Jerome Amilhastre.  Représentation par automate d'ensemble de solutions de problèmes de satisfaction de contraintes , 1999 .

[15]  Bernard Pargamin.  Extending Cluster Tree Compilation with non-Boolean variables in Product Configuration : a Tractable Approach to Preference-based Configuration , .

[16]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[17]  Rainer Weigel,et al.  Interactive Configuration using Constraint Satisfaction Techniques , 1996, AAAI 1996.

[18]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..