365 search results - page 20 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
98
Voted
AIPS
2009
15 years 1 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
88
Voted
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
SARA
2009
Springer
15 years 7 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...
106
Voted
AAAI
1994
15 years 1 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
100
Voted
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...