1264 search results - page 20 / 253 » The framework approach for constraint satisfaction |
119
click to vote
AMAI
1999
Springer
15 years 1 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
98
Voted
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
121
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
134
click to vote
FLAIRS
2007
15 years 4 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
114
Voted
AIPS
1994
15 years 3 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...