Results 21 to 30 of about 1,116 (265)
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
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
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 +3 more sources
BerkMin: A Fast and Robust Sat-Solver [PDF]
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eugene Goldberg, Yakov Novikov
openaire +2 more sources
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
Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract ...
Francois Hantry, Mohand-Said Hacid
doaj +1 more source
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking
International Journal of Interactive Multimedia and Artificial Intelligence, 2015 We present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method
Agnieszka M. Zbrzezny, Andrzej Zbrzezny
doaj +1 more source
The Uses of SAT Solvers in Vampire
EPiC Series in Computing, 2018 Reasoning in a saturation-based first-order theorem prover is generally expensive involving complex term-indexing data structures and inferences such as subsumption resolution whose (worst case) running time is exponential in the length of the clause.
Giles Reger, Martin Suda 0001
openaire +2 more sources
A Hybrid Learnt Clause Evaluation Algorithm for SAT Problem
International Journal of Computational Intelligence Systems, 2018 It is of great theoretical and practical significance to develop the efficient SAT solvers due to its important applications in hardware and software verifications and so on, and learnt clauses play the crucial role in state of the art SAT solvers.
Guanfeng Wu +3 more
doaj +1 more source