Results 1 - 10 of 260

BerkMin: a fast and robust sat-solver

by Evgueni Goldberg, Yakov Novikov , 2002
"... We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time BerkMin introduces a new decision making procedure and a new method of clause database management. We experimentally compare ..."
Abstract - Cited by 284 (5 self) - Add to MetaCart
compare BerkMin with Chaff, the leader among SAT-solvers used in the EDA domain. Experiments show that our solver is more robust than Chaff. BerkMin solved all the instances we used in experiments including very large CNFs from a microprocessor verification benchmark suite. On the other hand, Chaff

Efficient Conflict Driven Learning in a Boolean Satisfiability Solver

by Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - In ICCAD , 2001
"... One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine th ..."
Abstract - Cited by 348 (8 self) - Add to MetaCart
-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Extensive experiments with real world examples show that the best performing new learning scheme has at least a 2X speedup compared with learning schemes employed in state-of-the-art SAT solvers.

ManySAT: a parallel SAT solver

by Youssef Hamadi, Lakhdar Sais - JOURNAL ON SATISFIABILITY, BOOLEAN MODELING AND COMPUTATION (JSAT) , 2009
"... In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses a portfolio of complementary sequential algorithms ..."
Abstract - Cited by 54 (14 self) - Add to MetaCart
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses a portfolio of complementary sequential

Bounded model checking of software using SMT solvers instead of SAT solvers

by Alessandro Armando, Jacopo Mantovani, Lorenzo Platania - SPIN. VOLUME 3925 OF LNCS , 2006
"... C Bounded Model Checking (CBMC) has proven to be a successful approach to automatic software analysis. The key idea is to (i) build a propositional formula whose models correspond to program traces (of bounded length) that violate some given property and (ii) use state-of-the-art SAT solvers to che ..."
Abstract - Cited by 63 (2 self) - Add to MetaCart
C Bounded Model Checking (CBMC) has proven to be a successful approach to automatic software analysis. The key idea is to (i) build a propositional formula whose models correspond to program traces (of bounded length) that violate some given property and (ii) use state-of-the-art SAT solvers

CafeSat: A Modern SAT Solver for Scala

by Régis Blanc , 2013
"... We present CafeSat, a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state-of-the-art techniques and heuristics. It uses two-watched literals for Boolean constraint propagation, conflict-driven learning along with clause deletion, a ..."
Abstract - Add to MetaCart
translating a high level algorithm written in a relatively idiomatic Scala style to a more C-like programming style. These experiments also illustrate the importance of modern techniques used by SAT solver. Finally, we evaluate CafeSat against the reference SAT solver on the JVM: Sat4j. 1

On SAT instance classes and a method for reliable performance experiments with SAT solvers

by Franc Brglez, Xiao Yu Li, Matthias F. Stallmann , 2004
"... ..."
Abstract - Cited by 18 (10 self) - Add to MetaCart
Abstract not found

Conflict-driven answer set solving

by Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub - in Proceedings IJCAI’07 , 2007
"... We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased ..."
Abstract - Cited by 201 (48 self) - Add to MetaCart
constraintbased framework for the different kinds of inferences in ASP. It also allows us to apply advanced techniques from the areas of CSP and SAT. We have implemented our approach in the new ASP solver clasp. Our experiments show that the approach is competitive with state-of-the-art ASP solvers. 1

Benchmarking SAT Solvers for Bounded Model Checking

by Emmanuel Zarpas - in SAT ’05: Proc. of the 8th International Conference on Theory and Applications of Satisfiability Testing, ser. LNCS , 2005
"... Abstract. Modern SAT solvers are highly dependent on heuristics. Therefore, benchmarking is of prime importance in evaluating the performances of different solvers. However, relevant benchmarking is not necessarily straightforward. We present our experiments using the IBM CNF Benchmark on several SA ..."
Abstract - Cited by 12 (1 self) - Add to MetaCart
Abstract. Modern SAT solvers are highly dependent on heuristics. Therefore, benchmarking is of prime importance in evaluating the performances of different solvers. However, relevant benchmarking is not necessarily straightforward. We present our experiments using the IBM CNF Benchmark on several

On solving the Partial MAX-SAT problem

by Zhaohui Fu, Sharad Malik - In International Conference on Theory and Applications of Satisfiability Testing (SAT’06), LNCS 4121 , 2006
"... Abstract. Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be required/preferable to use variations of the general SAT problem. In this paper, we consider one importan ..."
Abstract - Cited by 79 (1 self) - Add to MetaCart
of the solution. We discuss the relative strengths and thus applicability of the two solvers for different solution scenarios. Further, we show how both techniques benefit from the persistent learning techniques of incremental SAT. Experiments using practical instances of this problem show significant

MidL: a SAT(ID) solver

by Maarten Mariën, Johan Wittocx, Marc Denecker - In ASP’07 , 2007
"... Abstract. We introduce SAT(ID) and explain its relation both to SAT and to ASP. We then describe the SAT(ID) solver MidL. We outline its design and algorithms, and finally establish its performance by experiment. 1 ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
Abstract. We introduce SAT(ID) and explain its relation both to SAT and to ASP. We then describe the SAT(ID) solver MidL. We outline its design and algorithms, and finally establish its performance by experiment. 1
Results 1 - 10 of 260