19 search results - page 3 / 4 » Using Learnt Clauses in maxsat |
AAAI
2006
13 years 10 months ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
SAT
2009
Springer
14 years 3 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
WEBDB
2010
Springer
14 years 1 months ago
2010
Springer
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
WWW
2011
ACM
13 years 3 months ago
2011
ACM
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...