Sciweavers

29 search results - page 2 / 6
» Constraint Symmetry for the Soft CSP
Sort
View
CPAIOR
2008
Springer
13 years 7 months ago
A Novel Approach For Detecting Symmetries in CSP Models
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
Christopher Mears, Maria J. García de la Ba...
AAAI
2006
13 years 6 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
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...
Robert T. Effinger, Brian C. Williams
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 5 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
CP
2003
Springer
13 years 10 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
ECAI
2004
Springer
13 years 10 months ago
Soft Constraints with Partially Ordered Preferences
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
Nic Wilson