Sciweavers

539 search results - page 13 / 108
» An Improved Upper Bound for SAT
Sort
View
SAT
2007
Springer
75views Hardware» more  SAT 2007»
14 years 1 months ago
Matched Formulas and Backdoor Sets
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched...
Stefan Szeider
MTV
2003
IEEE
154views Hardware» more  MTV 2003»
14 years 22 days ago
Tuning the VSIDS Decision Heuristic for Bounded Model Checking
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...
Ohad Shacham, Emmanuel Zarpas
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
CHARME
2005
Springer
130views Hardware» more  CHARME 2005»
14 years 1 months ago
Improvements to the Implementation of Interpolant-Based Model Checking
The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, ...
João P. Marques Silva
ECAI
2006
Springer
13 years 11 months ago
Improving Bound Propagation
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
Bozhena Bidyuk, Rina Dechter