SARA
2009
Springer
13 years 11 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
