SARA
2009
Springer
13 years 9 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
SARA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
SARA
2009
Springer
13 years 11 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Real-world automated reasoning systems must contend with inconsistencies and the vast amount of information stored in relational databases. In this paper, we introduce compilation...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
SARA
2009
Springer
13 years 11 months ago
2009
Springer
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Tailoring solver-independent constraint instances to target solvers is an important component of automated constraint modelling. We augment the tailoring process by a set of enhan...