1421 search results - page 2 / 285 » The First and Second Max-SAT Evaluations |
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an ...
JSAT
2010
13 years 5 days ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
ISMVL
2009
IEEE
14 years 17 hour ago
2009
IEEE
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
This paper presents the motivation, resources and results for the first Web People Search task, which was organized as part of the SemEval-2007 evaluation exercise. Also, we will ...