Results 11 to 20 of about 42,931 (182)
An Effective SAT Solver Utilizing ACO Based on Heterogenous Systems
IEEE Access, 2020 This paper presents new parallel strategies for preprocessing and solving the issue of Boolean Satisfaction (SAT) on Heterogeneous systems of multicore and many-core CPU and Graphics Processing Unit (GPU) using Open Multi-Processor (OpenMP) and NVIDIA ...
Hassan Youness +4 more
doaj +3 more sources
FPGA-Based Hardware/Software Co-Design of a Bio-Inspired SAT Solver
IEEE Access, 2020 For various kinds of Internet of Things (IoT) systems whose control rules can be expressed in a Satisfiability (SAT) problem, this work aims at realizing an IoT-oriented FPGA-based SAT solver leveraging a bio-inspired algorithm, AmoebaSAT, using a ...
Anh Hoang Ngoc Nguyen +2 more
doaj +3 more sources
The International SAT Solver Competitions [PDF]
AI Magazine, 2012 The International SAT Solver Competition is today an established series of competitive events aiming at objectively evaluating the progress in state‐of‐the‐art procedures for solving Boolean satisfiability (SAT) instances. Over the years, the competitions have significantly contributed to the fast progress in SAT solver technology that has made SAT a ...
Matti Järvisalo +3 more
openaire +5 more sources
Realization of c-Inference as a SAT Problem
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2022 Semantically based on Spohn’s ranking functions, c-representations are special ranking models obtained by assigning individual integer impacts to the conditionals in a knowledge base R and by defining the rank of each possible world as the sum of the ...
Christoph Beierle +2 more
doaj +1 more source
A Verified Implementation of the DPLL Algorithm in Dafny
Mathematics, 2022 We present a DPLL SAT solver, which we call TrueSAT, developed in the verification-enabled programming language Dafny. We have fully verified the functional correctness of our solver by constructing machine-checked proofs of its soundness, completeness ...
Cezar-Constantin Andrici +1 more
doaj +1 more source
A Flexible Proof Format for SAT Solver-Elaborator Communication [PDF]
Logical Methods in Computer Science, 2022 We introduce FRAT, a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to DRAT, the FRAT format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to LRAT.
Seulkee Baek +2 more
doaj +1 more source
Boosting the Performance of CDCL-Based SAT Solvers by Exploiting Backbones and Backdoors
Algorithms, 2022 Boolean structural measures were introduced to explain the high performance of conflict-driven clause-learning (CDCL) SAT solvers on industrial SAT instances.
Tasniem Al-Yahya +2 more
doaj +1 more source
Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions [PDF]
International Journal of Electronics and Telecommunications, 2023 In this article we present a procedure that allows to synthesize optimal circuit representing any reversible function within reasonable size limits. The procedure allows to choose either the NCT or the MCT gate set and specify any number of ancillary ...
Adam Jagielski
doaj +1 more source
Community structure in industrial SAT instances [PDF]
, 2019 Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances.
Ansótegui Gil, Carlos +4 more
core +4 more sources
Branching Heuristic Strategy Based on Learnt Clauses Deletion Strategy for SAT Solver [PDF]
Jisuanji kexue, 2021 For the SAT solver,most popular branch variable decision-making strategies are based on the variable activity evaluation of conflict.The unassigned variable with the maximum activity is selected as the decision variable,and the most recent conflict is ...
WANG Yi-jie, XU Yang, WU Guan-feng
doaj +1 more source