Results 41 to 50 of about 62,255 (228)
Efficient Analog Circuits for Boolean Satisfiability [PDF]
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2016 Efficient solutions to nonpolynomial (NP)-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative ...
Xunzhao Yin +5 more
semanticscholar +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
Discrete Mutation Hopfield Neural Network in Propositional Satisfiability
Mathematics, 2019 The dynamic behaviours of an artificial neural network (ANN) system are strongly dependent on its network structure. Thus, the output of ANNs has long suffered from a lack of interpretability and variation.
Mohd Shareduwan Mohd Kasihmuddin +3 more
semanticscholar +1 more source
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 +1 more source
Constraint Expressions and Workflow Satisfiability [PDF]
, 2013 A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements and business rules may impose constraints on which users are permitted to perform those steps.
Crampton, Jason, Gutin, Gregory
core +1 more source
The complexity of linear-time temporal logic over the class of ordinals [PDF]
, 2010 We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem.
Alexander Rabinovich +8 more
core +1 more source
Satisfiability Checking for Mission-Time LTL
International Conference on Computer Aided Verification, 2019 Mission-time LTL (MLTL) is a bounded variant of MTL over naturals designed to generically specify requirements for mission-based system operation common to aircraft, spacecraft, vehicles, and robots.
Jianwen Li +2 more
semanticscholar +1 more source
Does a Satisfied Student Make a Satisfied Worker? [PDF]
SSRN Electronic Journal, 2017 We investigate the effect of satisfaction at higher education on job satisfaction using propensity score matching, the special regressor method and a unique European dataset for graduates. Acknowledging that perceptions of satisfaction at higher education are endogenous to job satisfaction, we present models available to the deal with this endogeneity.
Whelan, Adele, McGuinness, Séamus
openaire +3 more sources
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
Secure State Estimation for Cyber-Physical Systems Under Sensor Attacks: A Satisfiability Modulo Theory Approach [PDF]
IEEE Transactions on Automatic Control, 2014 Secure state estimation is the problem of estimating the state of a dynamical system from a set of noisy and adversarially corrupted measurements. Intrinsically a combinatorial problem, secure state estimation has been traditionally addressed either by ...
Yasser Shoukry +5 more
semanticscholar +1 more source