5 search results - page 1 / 1 » Pruning Rules for Constrained Optimisation for Conditional P... |
CP
2011
Springer
12 years 4 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of condition...
AAAI
2004
13 years 6 months ago
2004
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
AAAI
2006
13 years 6 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
AIR
2006
13 years 4 months ago
2006
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...