[BOOK][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
Constraint solving in uncertain and dynamic environments: A survey
G Verfaillie, N Jussien - Constraints, 2005 - Springer
This article follows a tutorial, given by the authors on dynamic constraint solving at CP 2003
(Ninth International Conference on Principles and Practice of Constraint Programming) in …
(Ninth International Conference on Principles and Practice of Constraint Programming) in …
Resolution methods for constraint satisfaction problem in remote sensing field: A survey of static and dynamic algorithms
Monitoring environmental evolutions, one of the most crucial axes on which sustainable
development is based, requires the knowledge of information on the observed geographical …
development is based, requires the knowledge of information on the observed geographical …
Configuration
U Junker - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter explains that configuration is the task of composing a
customized system out of generic components. This task is of universal concern as …
customized system out of generic components. This task is of universal concern as …
[PDF][PDF] Conditional constraint satisfaction: Logical foundations and complexity
Abstract Conditional Constraint Satisfaction Problems (CC-SPs) are generalizations of
classical CSPs that support conditional activation of variables and constraints. Despite the …
classical CSPs that support conditional activation of variables and constraints. Despite the …
Constraint-based modeling of discrete event dynamic systems
G Verfaillie, C Pralet, M Lemaître - Journal of Intelligent Manufacturing, 2010 - Springer
Numerous frameworks dedicated to the modeling of discrete event dynamic systems have
been proposed to deal with programming, simulation, validation, situation tracking, or …
been proposed to deal with programming, simulation, validation, situation tracking, or …
Modelling with option types in MiniZinc
Option types are a powerful abstraction that allows the concise modelling of combinatorial
problems where some decisions are relevant only if other decisions are made. They have a …
problems where some decisions are relevant only if other decisions are made. They have a …
Search heuristics for constraint-aided embodiment design
Embodiment design (ED) is an early phase of product development. ED problems consist of
finding solution principles that satisfy product requirements such as physics behaviors and …
finding solution principles that satisfy product requirements such as physics behaviors and …
Managing dynamic CSPs with preferences
M Mouhoub, A Sukpan - Applied Intelligence, 2012 - Springer
We present a new framework, managing Constraint Satisfaction Problems (CSPs) with
preferences in a dynamic environment. Unlike the existing CSP models managing one form …
preferences in a dynamic environment. Unlike the existing CSP models managing one form …
Conditional and composite temporal CSPs
M Mouhoub, A Sukpan - Applied Intelligence, 2012 - Springer
Abstract Constraint Satisfaction Problems (CSPs) have been widely used to solve
combinatorial problems. In order to deal with dynamic CSPs where the information …
combinatorial problems. In order to deal with dynamic CSPs where the information …