Results 21 to 30 of about 1,567 (182)

Testing Quantum Satisfiability. [PDF]

Commun Math Phys
Abstract Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA $$_1$$ 1 -complete for
Montanaro A, Shao C, Verdon D, Verdon D.
europepmc   +7 more sources

A satisfying result [PDF]

Communications of the ACM, 2021
Formulating a decades-old geometric conjecture as a satisfiability problem opened the door to its final resolution.
openaire   +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ń, Mirosław Kurkowski, Sylwia Stachowiak   +2 more
doaj   +1 more source

Satisfiability and Evolution [PDF]

2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
We show that, if truth assignments on $n$ variables reproduce through recombination so that satisfaction of a particular Boolean function confers a small evolutionary advantage, then a polynomially large population over polynomially many generations (polynomial in $n$ and the inverse of the initial satisfaction probability) will end up almost certainly
Adi Livnat, Christos H. Papadimitriou, Aviad Rubinstein, Gregory Valiant, Andrew Wan   +4 more
openaire   +2 more sources

Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm

Mathematics, 2022
Real life logical rule is not always satisfiable in nature due to the redundant variable that represents the logical formulation. Thus, the intelligence system must be optimally governed to ensure the system can behave according to non-satisfiable ...
Vikneswari Someetheram, Muhammad Fadhil Marsani, Mohd Shareduwan Mohd Kasihmuddin, Nur Ezlin Zamri, Siti Syatirah Muhammad Sidik, Siti Zulaikha Mohd Jamaludin, Mohd. Asyraf Mansor   +6 more
doaj   +1 more source

Expected number of locally maximal solutions for random Boolean CSPs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou, Hervé Daudé, Olivier Dubois   +2 more
doaj   +1 more source

Estimating satisfiability

Discrete Applied Mathematics, 2012
31 pages, added the 4.419 upper-bound on the ...
Boufkhad, Yacine, Hugel, Thomas
openaire   +4 more sources

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ė, Stanislovas Norgėla   +1 more
doaj   +1 more source