Results 61 to 70 of about 42,931 (182)
Tarmo: A Framework for Parallelized Bounded Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo.
Siert Wieringa +2 more
doaj +1 more source
SAT-Based Decision Procedures for Automated Reasoning: a Unifying Perspective [PDF]
, 2002 Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-the-art solvers.
Armando, Alessandro +4 more
core +1 more source
Clausal Forms in MaxSAT and MinSAT
International Journal of Computational Intelligence Systems, 2022 We tackle the problem of reducing non-clausal MaxSAT and MinSAT to clausal MaxSAT and MinSAT. Our motivation is twofold: (i) the clausal form transformations used in SAT are unsound for MaxSAT and MinSAT, because they do not preserve the minimum or ...
Chu Min Li +3 more
doaj +1 more source
A New Rewarding Mechanism for Branching Heuristic in SAT Solvers
International Journal of Computational Intelligence Systems, 2019 Decision heuristic strategy can be viewed as one of the most central features of state-of-the-art conflict-driven clause-learning SAT solvers. Variable state independent decaying sum (VSIDS) still is the dominant branching heuristics because of its low ...
Wenjing Chang, Yang Xu, Shuwei Chen
doaj +1 more source
AvatarSAT: An Auto-tuning Boolean SAT Solver [PDF]
, 2009 We present AvatarSAT, a SAT solver that uses machine-learning classifiers to automatically tune the heuristics of an off-the-shelf SAT solver on a per-instance basis. The classifiers use features of both the input and conflict clauses to select parameter
Ganesh, Vijay +3 more
core
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
SciPost Physics, 2017 Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k ...
Marlon Azinović, Daniel Herr, Bettina Heim, Ethan Brown, Matthias Troyer
doaj +1 more source
Analysis of SET Reconvergence and Hardening in the Combinational Circuit Using a SAT-Based Method
IEEE Access, 2018 The reconvergence-phenomenon is common in modern circuit design. It occurs when the signal reconvenes at a certain point through multiple sensitized paths. It affects the soft error estimation and hardening. It is complicated to analyze the reconvergence-
Chang Liu, Long Zhang, Xu He, Yang Guo
doaj +1 more source
Complete synthesis of identity templates for quantum and reversible logic MCT circuits using SAT-solvers and proposal of suboptimality witness notion [PDF]
International Journal of Electronics and TelecommunicationsIn this study, we introduce a procedural generation technique for Identity Templates applicable to quantum and reversible logic circuits. These templates are recognized for their significant role in enhancing the efficiency of quantum and reversible ...
Adam Jagielski
doaj +1 more source
ManySAT: a Parallel SAT Solver
Journal on Satisfiability, Boolean Modeling and Computation, 2009 In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses a portfolio of complementary sequential algorithms obtained through careful variations of the standard ...
Hamadi, Youssef +2 more
openaire +2 more sources
FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA
IEEE AccessThe satisfiability (SAT) problem is a fundamental challenge in computing and has a broad range of applications. This problem is NP-complete, and many algorithmic and architectural improvements have aimed at accelerating the SAT solver.
Young-Kyu Choi, Changsoo Kim
doaj +1 more source