Results 81 to 90 of about 42,931 (182)

Heuristic Backtracking Algorithms for SAT

, 2003
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new ...
Bhalla, A., Lynce, I., Marques-Silva, J., Sousa, J.   +3 more
core   +3 more sources

Efficient Quantum Answer Set Programming Solver Using Partial Diffusion and Entanglement

IEEE Access
The relation between answer set programming (ASP) and combinatorial problems, especially the satisfiability problem (SAT), has attracted significant interest in the academic literature.
Esraa Ebdelrehime, Ahmed Younes, Islam Elkabani   +2 more
doaj   +1 more source

Comparing Beliefs, Surveys and Random Walks

, 2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice.
Aurell, Erik, Gordon, Uri, Kirkpatrick, Scott   +2 more
core   +1 more source

Contrasat – A Contrarian SAT Solver

Journal on Satisfiability, Boolean Modeling and Computation, 2012
The SAT solver Contrasat is a small variation of the well-established Minisat solver. It was entered in the Minisat hack track of the 2011 SAT competition, and was judged to be first place in one category. This paper describes the code change and its motivation. The characterization as “contrarian” is explained. Experimental results are summarized.
openaire   +2 more sources

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. [PDF]

J Autom Reason, 2018
Blanchette JC, Fleury M, Lammich P, Weidenbach C.   +3 more
europepmc   +1 more source

Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis

Algorithms
This paper introduces a lightweight cryptographic hash algorithm, LWH-128, developed using a sponge-based construction and specifically adapted for operation under constrained computational and energy conditions typical of embedded systems and Internet ...
Kairat Sakan, Kunbolat Algazy, Nursulu Kapalova, Andrey Varennikov   +3 more
doaj   +1 more source

mSAT:An OCaml SAT Solver

, 2017
mSAT : a SAT solving library in OCaml. It solves the satisfibility of propositional clauses. It is Modular : the user provides the theory. And it produces formal proofs.
openaire   +1 more source

Augmenting an electronic Ising machine to effectively solve boolean satisfiability. [PDF]

Sci Rep, 2023
Sharma A, Burns M, Hahn A, Huang M.
europepmc   +1 more source