Results 261 to 270 of about 246,520 (298)
Some of the next articles are maybe not open access.
Planning with Specialized SAT Solvers
Proceedings of the AAAI Conference on Artificial Intelligence, 2011Logic, and declarative representation of knowledge in general, have long been a preferred framework for problem solving in AI. However, specific subareas of AI have been eager to abandon general-purpose knowledge representation in favor of methods that seem to address their computational core problems better.
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
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
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
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 +2 more sources
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 +4 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 +2 more sources
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 +2 more sources
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 +2 more sources