Results 21 to 30 of about 44,054 (190)
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
Percolation of satisfiability in finite dimensions [PDF]
, 2003 The satisfiability and optimization of finite-dimensional Boolean formulas are studied using percolation theory, rare region arguments, and boundary effects.
A. Alan Middleton +9 more
core +3 more sources
Discrete Applied Mathematics, 2012 31 pages, added the 4.419 upper-bound on the ...
Boufkhad, Yacine, Hugel, Thomas
openaire +4 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
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 +25 more
core +1 more source
Satisfying Everyday Mobility [PDF]
Mobilities, 2015 This paper engages with theoretical insights into understanding everyday travel (from the mobility turn and theories of social practice) in an analysis of everyday mobility using data from ethnographic research. The analysis of mobile performances draws attention to how travellers incorporate valued dispersed practices into mobility.
Cass, Noel, Faulconbridge, James
openaire +2 more sources
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
A Survey of Satisfiability Modulo Theory [PDF]
, 2016 Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories.
A Albarghouthi +37 more
core +2 more sources
Parameterized Modal Satisfiability
Algorithmica, 2010 We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature,
Achilleos, Antonis +2 more
openaire +4 more sources