Sciweavers

101 search results - page 1 / 21
» A Case for Simple SAT Solvers
Sort
View
CP
2007
Springer
13 years 11 months ago
A Case for Simple SAT Solvers
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
Jinbo Huang
SAT
2010
Springer
152views Hardware» more  SAT 2010»
13 years 3 months ago
Simple but Hard Mixed Horn Formulas
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
Gayathri Namasivayam, Miroslaw Truszczynski
SAT
2007
Springer
121views Hardware» more  SAT 2007»
13 years 11 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras
SAT
2005
Springer
142views Hardware» more  SAT 2005»
13 years 11 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
JAIR
2008
120views more  JAIR 2008»
13 years 5 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras