Results 51 to 60 of about 18,245 (221)
LTL satisfiability checking [PDF]
International Journal on Software Tools for Technology Transfer, 2007 We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-checking benchmarks to both explicit and symbolic model checkers. For symbolic model checking, we use CadenceSMV, NuSMV, and SAL-SMC.
Kristin Y. Rozier, Moshe Y. Vardi
openaire +3 more sources
The Complexity of Second-order HyperLTL [PDF]
Logical Methods in Computer ScienceWe determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic.
Hadar Frenkel +2 more
doaj +1 more source
Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation
Entropy, 2020 An effective recruitment evaluation plays an important role in the success of companies, industries and institutions. In order to obtain insight on the relationship between factors contributing to systematic recruitment, the artificial neural network and
Siti Zulaikha Mohd Jamaludin +4 more
doaj +1 more source
Incremental Maximum Satisfiability [PDF]
, 2022 Boolean satisfiability (SAT) solvers allow for incremental computations, which is key to efficient employment of SAT solvers iteratively for developing complex decision and optimization procedures, including maximum satisfiability (MaxSAT) solvers ...
Järvisalo, Matti +2 more
core +1 more source
Satisfiability of CTL* with Constraints [PDF]
, 2013 We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
Claudia Carapelle +2 more
openaire +3 more sources
Satisfiability Threshold of Random Propositional S5 Theories
AxiomsModal logic S5, which isan important knowledge representation and reasoning paradigm, has been successfully applied in various artificial-intelligence-related domains.
Zaihang Su +3 more
doaj +1 more source
The Complexity of Generalized Satisfiability for Linear Temporal Logic [PDF]
Logical Methods in Computer Science, 2009 In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used.
Michael Bauland +4 more
doaj +1 more source
Integration of Reconfigurable p‐Bit and 1R Crossbar Array for Memristive Probabilistic Computing
Advanced Science, EarlyView.A memristive probabilistic computing system is demonstrated by integrating stochastic p‐bits based on volatile memristors with a 1R crossbar array encoding interaction weights. The system performs weighted‐sum operations across the array and updates p‐bits iteratively.
Keunho Soh +7 more
wiley +1 more source
Algorithmic Problems for Computation Trees
LogicsIn this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems.
Mikhail Moshkov
doaj +1 more source
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
SciPost Physics, 2017 Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k ...
Marlon Azinović, Daniel Herr, Bettina Heim, Ethan Brown, Matthias Troyer
doaj +1 more source