1667 search results - page 50 / 334 » Extended clause learning |
SAT
2005
Springer
14 years 2 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
ILP
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We consider the task of tagging Slovene words with morphosyntactic descriptions (MSDs). MSDs contain not only part-of-speech information but also attributes such as gende...
AAAI
2007
13 years 11 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
AUSAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...