346 search results - page 32 / 70 » Solving quantified constraint satisfaction problems |
131
click to vote
PRICAI
1998
Springer
15 years 4 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
84
Voted
AAAI
2006
15 years 1 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...
KCAP
2005
ACM
15 years 6 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
95
Voted
FLAIRS
2006
15 years 1 months ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
90
Voted
AAECC
1999
Springer
15 years 5 days ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...