A novel algorithm for solving the Decision Boolean Satisfiability\n Problem without algebra [PDF]
, 2016 Carlos Barrón-Romero
openalex +1 more source
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
New Journal of PhysicsBoolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +1 more source
Progress in the Study of the Boolean Satisfiability Problem
International Journal of Computer Science and Information TechnologyThe Boolean Satisfiability problem (SAT) is a classical problem in computer science and artificial intelligence, and the most widely studied NP-complete problem. It aims to determine whether there exists an assignment of a value to a variable of a given Boolean formula that makes the formula true.
openaire +1 more source
Optimization of Boolean satisfiability solver by caching intermediate results
Труды Института системного программирования РАН, 2018 Recently, a number of dynamic analysis tools were developed that perform tainted data flow tracing and use algorithms for solving the CNF SAT problem for input data generation and path alteration.
S. Vartanov, D. Sidorov
doaj
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]
PLoS One, 2023 Ali GA +5 more
europepmc +1 more source
Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator [PDF]
, 2021 Domenico Cantone, Pietro Ursino
openalex +1 more source
SPPsolver: a SAT-based algorithm for solving any stable paths problem correctly
CybersecurityThe Stable Paths Problem (SPP) is a widely adopted model for analyzing the convergence of Border Gateway Protocol (BGP). Solving SPP correctly is of great significance for determining BGP convergence.
Wenwu Yan +5 more
doaj +1 more source
Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis
AlgorithmsThis 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 +3 more
doaj +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