This paper presents a constraint-based methodology for product design with advanced virtual reality technologies. A hierarchically structured and constraintbased data model is developed to support product design from features to parts and further to assemblies in a VR environment. Product design in the VR environment is performed in an intuitive manner through precise constraint-based manipulat...

Solving constraint satisfaction problems (CSP) efficiently depends on the solver configuration and the search strategy. However, it is difficult to customize the constraint solvers because they are not modular enough, and it is hard to create new search strategies by composition. To solve these problems, we propose spacetime programming, a paradigm based on lattices and synchronous process calc...

Pseudo-Boolean constraints are a special form of nite domain constraints where all variables are deened over the domain f0; 1g. To solve pseudo-Boolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare nite domain and pseudo-Boolean constraint techniques on a classical application of nite domain constraint programming, the warehouse location p...

Many and diverse combinatorial problems have been solved successfully using finite-domain constraint programming. However, to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction or optimisation problem. Since constraints provide a rich language, typically many alternative models exist. Formulating a good model therefore requires a...

Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final produc...