Results 31 to 40 of about 1,567 (182)
Subtropical Satisfiability [PDF]
, 2017 Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding constraints in SMT theory solvers is highly relevant. We propose a new incomplete but efficient and terminating method to identify satisfiable instances.
Pascal Fontaine +3 more
openaire +5 more sources
On Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
Моделирование и анализ информационных систем, 2018 The blockchain technology is based on the ”Proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant after the confirmation by a certain computer work.
Valeriy G. Durnev +3 more
doaj +1 more source
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj +1 more source
Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant
Physics Letters B, 2021 We apply Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers in the context of finding chiral heterotic string models with positive cosmological constant from Z2×Z2 orbifolds.
Alon E. Faraggi +3 more
doaj +1 more source
Dynamic Initial Weight Assignment for MaxSAT
Algorithms, 2021 The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable.
Abdelraouf Ishtaiwi, Qasem Abu Al-Haija
doaj +1 more source
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
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