1252 search results - page 7 / 251 » Minimizing Learned Clauses |
ILP
2004
Springer
15 years 3 months ago
2004
Springer
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...
CSR
2007
Springer
15 years 3 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
174
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...