Results 31 to 40 of about 44,054 (190)
Threshold values of Random K-SAT from the cavity method [PDF]
, 2005 Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random $K$-satisfiability problem, generalizing the previous results to $K \ge 4$.
Achlioptas +33 more
core +3 more sources
Mathematics, 2022 Recently, new variants of non-systematic satisfiability logic were proposed to govern Discrete Hopfield Neural Network. This new variant of satisfiability logical rule will provide flexibility and enhance the diversity of the neuron states in the ...
Siti Syatirah Muhammad Sidik +5 more
doaj +1 more source
The Phase Diagram of 1-in-3 Satisfiability Problem [PDF]
, 2007 We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and probability of ...
Andrea Sportiello +12 more
core +2 more sources
An optimization approach for the satisfiability problem
Applied Computing and Informatics, 2015 We describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a
S. Noureddine
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
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
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
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
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