Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SAT
2009
Springer

favoriteEmaildiscussreport

79views Hardware» more SAT 2009»

Minimizing Learned Clauses

13 years 11 months ago

Minimizing Learned Clauses

Download fmv.jku.at

Minimizing learned clauses is an eﬀective technique to reduce memory usage and also speed up solving time. It has been implemented in MINISAT since 2005 and is now adopted by most modern SAT solvers in academia, even though it has not been described in the literature properly yet. With this paper we intend to close this gap and also provide a thorough experimental analysis of it’s eﬀectiveness for the ﬁrst time.

Niklas Sörensson, Armin Biere

Real-time Traffic

Eﬀective Technique | Hardware | Memory Usage | Modern Sat Solvers | SAT 2009 |

claim paper

Related Content

» Automated Learning of Rules Using Genetic Operators

» A Tractable Class of Abduction Problems

» Learning ShortTerm Weights for GSAT

» Analyzing Dependencies of Japanese Subordinate Clauses based on Statistics of Scope Embedd...

» Markov logic networks

» Combinatorial Problems for Horn Clauses

» Reducing Misclassification Costs

» PolynomialTime Recognition of Minimal Unsatisfiable Formulas with Fixed ClauseVariable Dif...

» A fast counterexample minimization approach with refutation analysis and incremental SAT

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	SAT
Authors	Niklas Sörensson, Armin Biere

Comments (0)