Results 41 to 50 of about 18,245 (221)
Satisfiability Games for Branching-Time Logics [PDF]
Logical Methods in Computer Science, 2013 The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational complexities are known: CTL* and CTL+ are complete for doubly exponential time,
Oliver Friedmann +2 more
doaj +1 more source
Strong Backdoors to Nested Satisfiability
, 2012 Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be decided in polynomial time. We show that, parameterized by the size of a smallest strong backdoor set to the base class of nested formulas, computing the ...
Szeider, Stefan, Gaspers, Serge
core +4 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
Journal of Complexity, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George F. Georgakopoulos +2 more
openaire +1 more source
Satisfiability modulo ODEs [PDF]
2013 Formal Methods in Computer-Aided Design, 2013 We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software. We develop delta-complete algorithms for SMT formulas that are purely existentially quantified, as well as exists-forall formulas whose universal quantification is restricted to ...
Sicun Gao, Soonho Kong, Edmund M. Clarke
openaire +3 more sources
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
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
International Journal of Apllied Mathematics, 2016 We define a satisfiability tree in the context of classical propositional logic. Satisfiability tree is a structure inspired by the Beth’s semantic tableau, later refined into its modern variant by Lis and Smullyan and by the notion that tableau is a tree-like representation of a formula.
openaire +3 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 +2 more
openaire +3 more sources