Results 31 to 40 of about 3,379,264 (310)
BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting
AAAI Conference on Artificial Intelligence, 2019 Given a Boolean formula φ, the problem of model counting, also referred to as #SAT is to compute the number of solutions of φ. Model counting is a fundamental problem in artificial intelligence with a wide range of applications including probabilistic ...
M. Soos, Kuldeep S. Meel
semanticscholar +1 more source
Implementing Efficient All Solutions SAT Solvers [PDF]
ACM Journal of Experimental Algorithmics, 2016 All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem. AllSAT has been relatively unexplored compared to other variants despite its significance. We thus survey and discuss major techniques of AllSAT solvers. We accurately implemented them and conducted comprehensive experiments using a large number of instances ...
Toda, Takahisa, Soh, Takehide
openaire +3 more sources
Further accelerating the search of differential characteristics based on the SAT method
网络与信息安全学报, 2022 Sun et al.’s method of using Matsui’s bounding conditions to accelerate the search of differential characteristics was reviewed.Matsui’s boundary conditions and Sun et al.’s method of using Matsui’s bounding conditions to accelerate the search of ...
Zheng XU
doaj +3 more sources
Effective Problem Solving Using SAT Solvers [PDF]
, 2020 To appear in Proceedings of the Maple Conference ...
Bright, Curtis +3 more
openaire +2 more sources
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +2 more
doaj +1 more source
Improving WalkSAT for Random 3-SAT Problems [PDF]
Journal of Universal Computer Science, 2020 Stochastic local search (SLS) algorithms are well known for their ability to efficiently find models of random instances of the Boolean satisfiability (SAT) problems.
Huimin Fu, Yang Xu, Shuwei Chen, Jun Liu
doaj +3 more sources
SAT-based Explicit LTL Reasoning [PDF]
, 2015 We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving.
AR Bradley +25 more
core +1 more source
BerkMin: A Fast and Robust Sat-Solver [PDF]
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goldberg, Eugene, Novikov, Yakov
openaire +2 more sources
Using Sat solvers for synchronization issues in partial deterministic automata [PDF]
, 2019 We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver.
A Roman +32 more
core +1 more source
On the Predictability of Classical Propositional Logic
Information, 2013 In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction,
Poliana M. Reis, Marcelo Finger
doaj +1 more source