Results 21 to 30 of about 18,245 (221)

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

Underestimation vs Overestimation in SAT-based Planning [PDF]

, 2013
Planning as satisfiability is one of the main approaches to finding parallel optimal solution plans for classical planning problems. Existing high performance SAT-based planners are able to exploit either forward or backward search strategy; starting ...
Chrpa, Lukáš, Vallati, Mauro, Crampton, Andrew   +2 more
core   +3 more sources

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

Tableaux and Sequent Calculi for CTL and ECTL: Satisfiability Test with Certifying Proofs and Models [PDF]

, 2022
Certifying proofs are automated deductive proofs obtained as outcomes of a formal verification of temporal properties, where model checking is one of the most prominent approaches. The satisfiability problem for the Computation Tree Logic (CTL) cannot be
Abuin, A., Lucio, P., Bolotov, A., Garcia-Closas, M., Lucio Carrasco, Francisca, Alex Abuin, Bolotov, Alexander, Hermo Huguet, Montserrat, Alexander Bolotov, Paqui Lucio, Abuin Yepes, Alex, Montserrat Hermo   +11 more
core   +1 more source

Proving Finite Satisfiability of Deductive Databases [PDF]

, 1987
It is shown how certain refutation methods can be extended into semi-decision procedures that are complete for both unsatisfiability and finite satisfiability. The proposed extension is justified by a new characterization of finite satisfiability. This
Bry, François, Manthey, Rainer, Börger, Egon   +2 more
core   +1 more source

Satisfiability of ATL with strategy contexts [PDF]

, 2013
Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over strategies ...
François Laroussinie, Laroussinie, François, Markey, Nicolas, Nicolas Markey   +3 more
core   +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

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

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

Estimating satisfiability

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