Sciweavers

1252 search results - page 12 / 251
» Minimizing Learned Clauses
Sort
View
ECAI
2008
Springer
14 years 11 months ago
Vivifying Propositional Clausal Formulae
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our app...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
15 years 10 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
15 years 3 months ago
Optimization of Nested XQuery Expressions with Orderby Clauses
— XQuery, the defacto XML query language, is a functional language with operational semantics, which precludes the direct application of classical query optimization techniques. ...
Song Wang, Elke A. Rundensteiner, Murali Mani
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
15 years 4 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
15 years 6 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik