Results 11 to 20 of about 62,255 (228)
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite ...
Jakub Michaliszyn +2 more
doaj +1 more source
Journal of Algorithms, 2003 Summary: Let \(\Phi\) be a set of general boolean functions on \(n\) variables, such that each function depends on exactly \(k\) variables, and each variable can take a value from \([1,d]\). We say that \(\Phi\) is \(\varepsilon\)-far from satisfiable, if one must remove at least \(\varepsilon n^k\) functions in order to make the set of remaining ...
Alon, Noga, Shapira, Asaf
openaire +2 more sources
An Effective SAT Solver Utilizing ACO Based on Heterogenous Systems
IEEE Access, 2020 This paper presents new parallel strategies for preprocessing and solving the issue of Boolean Satisfaction (SAT) on Heterogeneous systems of multicore and many-core CPU and Graphics Processing Unit (GPU) using Open Multi-Processor (OpenMP) and NVIDIA ...
Hassan Youness +4 more
doaj +1 more source
Logical Methods in Computer Science, 2013 We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable.
Luc Segoufin, Balder ten Cate
doaj +1 more source
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
Fullness and Decidability in Continuous Propositional Logic
Mathematics, 2022 In this paper we consider general continuous propositional logics and prove some basic properties about them. First, we characterize full systems of continuous connectives of the form {¬,∸,f} where f is a unary connective.
Xuanzhi Ren
doaj +1 more source
Complete SAT based Cryptanalysis of RC5 Cipher
Journal of Information and Organizational Sciences, 2020 Keeping the proper security level of ciphers used in communication networks is today a very important problem. Cryptanalysts ensure a constant need for improvement complexity and ciphers' security by trying to break them.
Artur Soboń +2 more
doaj +1 more source
Normal form of formulas of pure hybrid logic
Lietuvos Matematikos Rinkinys, 2021 In this paper,we study a transformationof pure hybrid logic formulae,which do not have binding operator, into an equivalent normal form, which does not have any satisfiability operators in the scope of another satisfiability operator.
Daiva Aleknavičiūtė +1 more
doaj +1 more source
A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment [PDF]
, 2017 Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms.
Voigt, Marco
core +3 more sources