Results 51 to 60 of about 42,931 (182)
AIP Conference Proceedings, 2017 In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design.
Weiwei Gong, Xu Zhou
openaire +1 more source
2022 International Joint Conference on Neural Networks (IJCNN), 2022 Modern neural networks obtain information about the problem and calculate the output solely from the input values. We argue that it is not always optimal, and the network's performance can be significantly improved by augmenting it with a query mechanism that allows the network at run time to make several solution trials and get feedback on the loss ...
Ozolins, Emils +5 more
openaire +2 more sources
fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver
IEEE Access, 2022 Finite-state models are widely used in software engineering, especially in the development of control systems. In control applications, such models are often developed manually, which can make it difficult to keep them up to date.
Konstantin Chukharev, Daniil Chivilikhin
doaj +1 more source
Transactions on Cryptographic Hardware and Embedded Systems, 2018 In this paper, we introduce the Satisfiability Modulo Theory (SMT) attack on obfuscated circuits. The proposed attack is the superset of Satisfiability (SAT) attack, with many additional features.
Kimia Zamiri Azar +3 more
doaj +1 more source
Strengthening Crypto-1 Cipher Against Algebraic Attacks
Journal of ICT Research and Applications, 2015 In the last few years, several studies addressed the problem of data security in Mifare Classic. One of its weaknesses is the low random number quality. This causes SAT solver attacks to have lower complexity.
Farah Afianti, Ari M. Barmawi
doaj +1 more source
Introducing a Resolvable Network-Based SAT Solver Using Monotone CNF–DNF Dualization and Resolution
MathematicsThis paper is a theoretical contribution that introduces a new reasoning framework for SAT solving based on resolvable networks (RNs). RNs provide a graph-based representation of propositional satisfiability in which clauses are interpreted as directed ...
Gábor Kusper, Benedek Nagy
doaj +1 more source
Bit-Vector Model Counting using Statistical Estimation
, 2016 Approximate model counting for bit-vector SMT formulas (generalizing \#SAT) has many applications such as probabilistic inference and quantitative information-flow security, but it is computationally difficult.
A Cimatti +23 more
core +1 more source
Learn with SAT to Minimize Büchi Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that
Stephan Barth, Martin Hofmann
doaj +1 more source
Shared SAT Solvers and SAT Memory in Distributed Business Applications
, 2022 We propose a software architecture where SAT solvers act as a shared network resource for distributed business applications. There can be multiple parallel SAT solvers running either on dedicated hardware (a multi-processor system or a system with a specific GPU) or in the cloud.
openaire +2 more sources
Effective Partitioning Method With Predictable Hardness for CircuitSAT
IEEE AccessMany industrial verification problems are solved via reduction to CircuitSAT (curcuit satisfibiliaty). It is often the case that the resulting SAT instances are very hard and require the use of parallel computing to be solved in reasonable time.
Konstantin Chukharev +5 more
doaj +1 more source