Abstract
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
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Bessière, E. Freuder, and J.C. Régin. Using constraint metaknowledge to reduce arc consistency computation. In Artificial Intelligence 107, p125–148, 1999.
C. Bessière and J.C. Régin. Refining the basic constraint propagation algorithm. In proceedings IJCAI’01, p309–315, Seattle WA, 2001.
C. Bessière, P. Meseguer, E. Freuder and J. Larrosa. On Forward Checking for Non-binary Constraint Satisfaction. In Principles and Practice of Constraint Programming - CP99. Alexandria, USA 1999. LNCS 1713, Springer-Verlag.
P-F Bonnefoi, D. Plemenos. Object Oriented Constraint Satisfaction for Hierarchical Declarative Scene Modeling. In proceedings of WSCG’99, Plzen, Czech Republic, 1999.
P-F Bonnefoi, D. Plemenos. Constraint satisfaction techniques for declarative scene modeling by hierarchical decomposition.. In proceedings of 3IA’2000, Limoges, France, 2000.
X. Chen, P. van Beek. Conflict-Directed Backjumping Revisited. In journal of AI Research 14, p53–81, March 2001.
P. Charman. A constraint-based approach for the generation of floor plans. In 6th IEEE International Conference Tools with Artificial Intelligence, November 1994.
C. Colin, E. Desmontils, J.Y. Martin, J.P. Mounier. Working Modes with a Declarative Modeler. Compugraphics’97, Villamoura, Portugal, GRASP, p 117–126, 1997.
L. Champciaux. Declarative Modeling: Speeding up the generation. In proceedings of CISST’97, Las Vegas, Nevada, p120–129, July 1997.
R. Debruyne and C. Bessière. Domain filtering consistencies. In journal of Artificial Intelligence Research, volume 14, p205–230, 2001.
S. Donikian, G. Hegron. The Kernel of a Declarative Method for 3D Scene Sketch Modeling. In proceedings GRAPHICON’92, Moscow, Russia, September 1992.
R. Dechter, A. Dechter. Belief maintenance in dynamic constraint networks. In proceedings of AAAI’88, St. Paul, MN, p337–342, 1988.
R. Dechter, F. Rossi, Constraint Satisfaction, Survey ECS, March, 2000.
E. Freuder, R. Dechter, B. Selman, M. Ginsberg, and E. Tsang, Systematic Versus Stochastic Constraint Satisfaction. Panel, IJCAI-95, p2027–2032, 1995.
D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
P. van Hentenrick, Y. Deville, and C.M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, p291–231, 1992.
J-K Hao, J. Pannier. Simulated annealing and Tabu search for constraint solving. In proceedings of AIM’98. Fort Lauderdale, Florida, USA, January 1998.
W. Hower, W. Graf. A bibliographical survey of constraint-based approaches to CAD, graphics, layout, visualization, and related topics. Knowledge-Based Systems, Vol. 9, No. 7, p449–464, 1996.
G. Kwaiter, V. Gaildrat, R. Caubet. Dynamic and Hierarchical Constraints Solver with Continuous Variables. In proceedings of Conference on LP and CP, Orleans 1997.
G. Kwaiter, V. Gaildrat, R. Caubet. Modeling with Constraints: A Bibliographical Survey. In proceedings of IV’98, London UK, July, 1998.
V. Kumar. Algorithms for Constraint Satisfaction Problems: A Survey by Vipin Kumar. AI Magazine Spring 2000.
O. Lhomme. Consistency techniques for numeric CSPs. In Proceedings of IJCAI-93, p232–238, 1993.
S. Liège, G. Hégron. An Incremental Declarative Modeling Applied to Urban Layout Design. In proceedings of WSCG’97, Plzen, Czech Republic, February 97.
A. K. Mackworth. Consistency in Networks of Relations. Artificial intelligence, Vol. 8 (1), p99–118, 1977.
P. and D. Martin. Declarative Generation of a Family of Polyhedra, In proceedings of GRAPHICON’ 93. St Petersbourg, September 1993.
D. Plemenos. Declarative Modeling by Hierarchical Decomposition. The Actual State of the MultiFormes Project, GRAPHICON’95, St Petersbourg, Russia, July 1995.
D.L. Waltz. Understanding line drawing of scenes with shadows. In The Psychology of Computer Vision, ed P. Winston, p19–91; 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Le Roux, O., Gaildrat, V., Caube, R. (2004). Constraint Satisfaction Techniques for the Generation Phase in Declarative Modeling. In: Sarfraz, M. (eds) Geometric Modeling: Techniques, Applications, Systems and Tools. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1689-5_11
Download citation
DOI: https://doi.org/10.1007/978-94-017-1689-5_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6518-6
Online ISBN: 978-94-017-1689-5
eBook Packages: Springer Book Archive