Results 151 to 160 of about 42,931 (182)

Planning with Specialized SAT Solvers

Proceedings of the AAAI Conference on Artificial Intelligence, 2011
Logic, 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

An Adaptive Parallel SAT Solver

2016
We present and evaluate AmPharoS, a new parallel SAT solver based on the divide and conquer paradigm. This solver, designed to work on a great number of cores, runs workers on sub-formulas restricted to cubes. In addition to classical clause sharing, it also exchange extra information associated to the cubes.
Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary   +3 more
openaire   +1 more source

Integrating Algebraic and SAT Solvers

2017
For solving systems of Boolean polynomials whose zeros are known to be contained in \(\mathbb {F}_2^n\), algebraic solvers such as the Boolean Border Basis Algorithm (BBBA) and SAT solvers use very different and possibly complementary methods to create new information.
Horáček, Jan, Burchard, Jan, Becker, Bernd, Kreuzer, Martin   +3 more
openaire   +2 more sources

Optimizing a Verified SAT Solver

2019
In 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

How do SAT-Solvers Operate?

2009
The purpose of this chapter is to explain how SAT-solvers operate (at least at the time of the writing of this book, late 2008). Two major families will be described in this section. The family of SAT-solvers used by the author are based on the Chaff Algorithm [182], culminating in MINISAT, a popular SAT-solver [104] [6].
openaire   +1 more source

Attacking Bivium Using SAT Solvers

2008
In 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, Enrico Pilz, Gunnar Völkel   +2 more
openaire   +1 more source

Zchaff2004: An Efficient SAT Solver

2005
The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, the problem has found many practical applications in recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances has enabled the ...
Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik   +2 more
openaire   +1 more source

SAT Solvers

2014
Joao Marques-Silva, Ines Lynce
openaire   +1 more source

Probabilistic Reasoning by SAT Solvers

2009
In 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

An efficient circuit-based SAT solver and its application in logic equivalence checking

Microelectronics Journal, 2023
Zhufei Chu
exaly