Results 31 to 40 of about 44,520 (208)

Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization

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, Nur Ezlin Zamri, Mohd Shareduwan Mohd Kasihmuddin, Habibah A. Wahab, Yueling Guo, Mohd. Asyraf Mansor   +5 more
doaj   +1 more source

SAT-based Explicit LTL Reasoning [PDF]

, 2015
We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving.
AR Bradley, C Courcoubetis, D Tabakov, EM Clarke, F Giunchiglia, F Somenzi, GJ Holzmann, J Marques-Silva, K Heljanko, KL McMillan, KL McMillan, KY Rozier, M Daniele, M D’Agostino, M Fisher, M Suda, MY Vardi, N Eén, R Cavada, R Gerth, S Malik, S Schwoon, T Larrabee, U Hustadt, V Schuppan, Z Manna   +25 more
core   +1 more source

Probabilistic satisfiability

Journal of Complexity, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou   +2 more
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

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, Achlioptas, Bauke, Ben-David, Braunstein, Braunstein, Cook, Cook, Dubois, Dubois, Franz, Friedgut, Frieze, Garey, Guerra, Gurevich, Hogg, Kirkpatrick, Kirousis, Kschischang, Levin, Monasson, Monasson, Monasson, Montanari, Montanari, Montanari, Mézard, Mézard, Mézard, Mézard, Mézard, Ricci-Tersenghi, Rivoire   +33 more
core   +3 more sources

"SATISFYING (OR NOT) THE EXAMINERS." [PDF]

The Lancet, 1895
n ...
openaire   +2 more sources

Satisfiability-unsatisfiability transition in the adversarial satisfiability problem [PDF]

Physical Review E, 2014
Adversarial satisfiability (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a Boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT, and therefore the nature of the critical region and the ...
Bardoscia, Marco, Nagaj, Daniel, Scardicchio, Antonello   +2 more
openaire   +3 more sources

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, Mohd Shareduwan Mohd Kasihmuddin, Ahmad Izani Md Ismail, Mohd. Asyraf Mansor, Md Faisal Md Basir   +4 more
doaj   +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

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

, 2019
We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an ...
A David, AP Sistla, D Walther, E Hemaspaandra, EA Emerson, EA Emerson, EM Clarke, EM Clarke, H Ditmarsch van, I Nishimura, Jan Plaza, JY Halpern, JY Halpern, M Huth, M Reynolds, M Rybakov, MC Nagle, MJ Fischer, P Blackburn, R Alur, R Fagin, S Demri, S Demri, S Schewe, V Goranko, V Goranko, V Goranko, V Švejdar, Valentin Goranko, W Hoek van der, Y Shoham   +30 more
core   +1 more source