Constraint satisfaction techniques for the generation phase in declarative modeling

Declarative modeling is an emergent research domain in computer-aided geometric design. To deal with the generation problems in declarative modeling, a recent approach consists in using constraint satisfaction techniques. After an introduction to constraint satisfaction and an overview of related works in declarative modeling, this chapter presents an object-oriented constraint solver. This generic tool is based on constraint propagation and domain reduction and supports heterogeneous parameters. It can be used in many generation systems. As an application, a declarative modeler for virtual 3D-environments planning is briefly presented.

[1]  Stéphane Donikian,et al.  A Declarative Design Method for 3D Scene Sketch Modeling , 1993, Comput. Graph. Forum.

[2]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  R. Dechter.  to Constraint Satisfaction , 1991 .

[5]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[6]  Peter van Beek,et al.  Conflict-Directed Backjumping Revisited , 2011, J. Artif. Intell. Res..

[7]  Yishai A. Feldman,et al.  Portability by automatic translation: a large-scale case study , 1999 .

[8]  Philippe Charman,et al.  A constraint-based approach for the generation of floor plans , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.

[9]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[10]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[11]  Winfried Graf,et al.  A bibliographical survey of constraint-based approaches to CAD, graphics, layout, visualization, and related topics , 1996, Knowl. Based Syst..

[12]  René Caubet,et al.  Dynamic and Hierarchical Constraints Solver with Continuous Variables , 1997 .

[13]  Christian Bessiere,et al.  Domain Filtering Consistencies , 2011, J. Artif. Intell. Res..

[14]  Ephane St,et al.  The Kernel of a Declarative Method for 3 DScene Sketch ModelingSt , 1992 .

[15]  Jean-Yves Martin,et al.  Working modes with a declarative modeler , 1997, Comput. Networks.

[16]  Bart Selman,et al.  Systematic Versus Stochastic Constraint Satisfaction , 1995, IJCAI.

[17]  Zsófia Ruttkay,et al.  Constraint satisfaction---a survey , 1998 .

[18]  Christian Bessiere,et al.  Using Constraint Metaknowledge to Reduce Arc Consistency Computation , 1999, Artif. Intell..

[19]  KumarVipin.  Algorithms for constraint-satisfaction problems , 1992 .

[20]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[21]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[22]  René Caubet,et al.  Modelling with constraints: a bibliographical survey , 1998, Proceedings. 1998 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics (Cat. No.98TB100246).

[23]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[24]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.