1252 search results - page 14 / 251 » Minimizing Learned Clauses |
IJCAI
1993
14 years 11 months ago
1993
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper we developed an Inductive Logic Programming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning mo...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
AAAI
2000
14 years 11 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...