18 search results - page 2 / 4 » Learning Domain-Specific Heuristics for Answer Set Solvers |
FLAIRS
2006
13 years 5 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...
ICTAI
2007
IEEE
13 years 10 months ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
LPNMR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
AAAI
2007
13 years 6 months ago
2007
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
DGO
2004
13 years 5 months ago
2004
Question answering (QA) on table data is a challenging information retrieval task. This paper describes a QA system for tables created with both machine learning and heuristic tab...