Results 231 to 240 of about 1,116 (265)
Some of the next articles are maybe not open access.
Parallel SAT Solver Selection and Scheduling
2012Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition.
Malitsky Y. +3 more
openaire +1 more source
Optimizing a Verified SAT Solver
2019In previous work, I verified a SAT solver with dedicated imperative data structures, including the two-watched-literal scheme. In this paper, I extend this formalization with four additional optimizations. The approach is still based on refining an abstract calculus to a deterministic program.
openaire +3 more sources
RegSTAB: A SAT Solver for Propositional Schemata
2010We describe the system RegStab (for regular schemata tableau) that solves the satisfiability problem for a class of propositional schemata. Our formalism extends propositional logic by considering indexed propositions (such as $P_1,P_{{\tt i}},P_{{\tt j}+1},\ldots$) and iterated connectives (e.g. $\bigvee_{i={\tt i}}^{\tt n} \phi$).
Vincent Aravantinos +2 more
openaire +1 more source
Attacking Bivium Using SAT Solvers
2008In this paper we present experimental results of an application of SAT solvers in current cryptography. Trivium is a very promising stream cipher candidate in the final phase of the eSTREAM project. We use the fastest industrial SAT solvers to attack a reduced version of Trivium - called Bivium.
Tobias Eibach +2 more
openaire +1 more source
A Parallel Pipelined SAT Solver for FPGA’s
2000Solving Boolean satisfiability problems in reconfigurable hardware is an area of great research interest. Originally, reconfigurable hardware was used to map each problem instance and thus exploit maximum parallelism in evaluation of variable assignments.
Mark Redekopp, Andreas Dandalis
openaire +1 more source
Improving Resource-Unaware SAT Solvers
2010The paper discusses cache utilization in state-of-the-art SAT solvers. The aim of the study is to show how a resource-unaware SAT solver can be improved by utilizing the cache sensibly. The analysis is performed on a CDCL-based SAT solver using a subset of the industrial SAT Competition 2009 benchmark.
Steffen Hölldobler +2 more
openaire +1 more source
A Stochastic Non-CNF SAT Solver
2006Stochastic local search techniques have been successful in solving propositional satisfiability (SAT) problems encoded in conjunctive normal form (CNF). Recently complete solvers have shown that there are advantages to tackling propositional satisfiability problems in a more expressive natural representation, since the conversion to CNF can lose ...
Rafiq Muhammad 0006, Peter J. Stuckey
openaire +1 more source
A Circuit-Level Amoeba-Inspired SAT Solver
IEEE Transactions on Circuits and Systems II: Express Briefs, 2020Naoki Takeuchi +2 more
exaly