Results 311 to 320 of about 3,677,634 (349)
Some of the next articles are maybe not open access.
On the parallelization of SAT solvers
2015 Tenth International Conference on Computer Engineering & Systems (ICCES), 2015This paper presents the main challenges, the hot topics, and the intriguing issues in the area of parallel SAT solving which provides possible directions for future research. It gives a detailed summary for the main features and technologies used in the most widely known and successful parallel SAT solvers and shows the strong points and the ...
Yasmeen Abd El Khalek +2 more
openaire +1 more source
Probabilistic Reasoning by SAT Solvers
2009In a series of papers we have shown that fundamental probabilistic reasoning problems can be encoded as hybrid probabilistic logic programs with probabilistic answer set semantics described in [24]. These probabilistic reasoning problems include, but not limited to, probabilistic planning [28], probabilistic planning with imperfect sensing actions [29],
openaire +1 more source
IEEE International Solid-State Circuits Conference
Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic design automation, and VLSI tests with practical examples, such
Chaeyun Shim, Jooyoung Bae, Bongjin Kim
semanticscholar +1 more source
Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic design automation, and VLSI tests with practical examples, such
Chaeyun Shim, Jooyoung Bae, Bongjin Kim
semanticscholar +1 more source
2007
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, we now have access to many sophisticated implementations of SAT solvers, sometimes boasting large amounts of code. Although low-level optimizations can help, we argue that the
openaire +1 more source
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, we now have access to many sophisticated implementations of SAT solvers, sometimes boasting large amounts of code. Although low-level optimizations can help, we argue that the
openaire +1 more source
Finding bugs efficiently with a SAT solver
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, 2007We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint solver to find specification violations. We improve the efficiency of this approach with a new encoding of the program that effectively slices it at the logical level with ...
Julian Dolby, Mandana Vaziri, Frank Tip
openaire +1 more source
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
Chaff: engineering an efficient SAT solver
Proceedings - Design Automation Conference, 2001Matthew W. Moskewicz +4 more
semanticscholar +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