1300 search results - page 78 / 260 » Constraint satisfaction problems and global cardinality cons... |
80
Voted
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
137
click to vote
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
ENDM
2000
14 years 10 months ago
2000
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
CPAIOR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
85
Voted
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...