Results 11 to 20 of about 44,520 (208)

Satisfiability Modulo ODEs [PDF]

2013 Formal Methods in Computer-Aided Design, 2013
We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software.
Clarke, Edmund, Gao, Sicun, Kong, Soonho
core   +4 more sources

LTLf satisfiability checking [PDF]

CoRR, 2014
We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe
He, Jifeng, Li, Jianwen, Pu, Geguang, Vardi, Moshe Y., Zhang, Lijun   +4 more
core   +2 more sources

Terminal Satisfiability in GSTE [PDF]

Journal of Applied Mathematics, 2014
Generalized symbolic trajectory evaluation (GSTE) is an extension of symbolic trajectory evaluation (STE) and a method of model checking. GSTE specifications are given as assertion graphs.
Yongsheng Xu, Guowu Yang, Zhengwei Chang, Desheng Zheng, Wensheng Guo   +4 more
doaj   +4 more sources

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

Testing satisfiability [PDF]

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 ...
Noga Alon, Asaf Shapira
openaire   +3 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

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

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

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

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