Results 21 to 30 of about 42,931 (182)
Model Abstraction for Discrete-Event Systems Using a SAT Solver
IEEE Access, 2023 Model abstraction for finite state automata is beneficial to reduce the complexity of discrete-event systems (DES), enhance the readability and facilitate the control synthesis and verification of DES.
Lihong Cheng, Lei Feng
doaj +1 more source
Applying aspiration in local search for satisfiability.
PLoS ONE, 2020 The Boolean Satisfiability problem (SAT) is a prototypical NP-complete problem, which has been widely studied due to its significant importance in both theory and applications.
Cong Peng, Zhongwei Xu, Meng Mei
doaj +1 more source
Incremental SAT Library Integration Using Abstract Stobjs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We describe an effort to soundly use off-the-shelf incremental SAT solvers within ACL2 by modeling the behavior of a SAT solver library as an abstract stobj. The interface allows ACL2 programs to use incremental SAT solvers, and the abstract stobj model
Sol Swords
doaj +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
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
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