Results 31 to 40 of about 62,255 (228)
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
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
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
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
SAT-based Explicit LTLf Satisfiability Checking [PDF]
AAAI Conference on Artificial Intelligence, 2018 We present a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced ...
Jianwen Li +4 more
semanticscholar +1 more source
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
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
Reasoning about Strategies: on the Satisfiability Problem [PDF]
Log. Methods Comput. Sci., 2016 Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games.
F. Mogavero +3 more
semanticscholar +1 more source
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
Journal of Formalized Reasoning, 2018 This paper presents a formally verified decision procedure for determinining the satisfiability of a system of univariate polynomial relations over the real line. The procedure combines a root counting function, based on Sturm’s theorem, with an interval
Anthony Joseph Narkawicz +2 more
doaj +1 more source