711 search results - page 114 / 143 » Amalgams of Constraint Satisfaction Problems |
135
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
147
Voted
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
176
click to vote
ECAI
1992
Springer
15 years 8 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
153
click to vote
IJCAI
2003
15 years 5 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
125
click to vote
AAAI
1997
15 years 5 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...