1930 search results - page 5 / 386 » Learning to Solve QBF |
AAAI
2000
13 years 9 months ago
2000
We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an approach to develop prototype reasoning systems us...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Publication
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...