Results 1 to 10 of about 12,229,216 (240)
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 +4 more sources
Reasoning about Strategies: on the Satisfiability Problem [PDF]
Logical Methods in Computer Science, 2017 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.
Fabio Mogavero +3 more
doaj +3 more sources
Adversarial satisfiability problem [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2010 We study the adversarial satisfiability problem, where the adversary can choose whether the variables are negated in clauses or not, in order to make the resulting formula unsatisfiable. This problem belongs to a general class of adversarial optimization
Michele Castellana, L. Zdeborová
semanticscholar +5 more sources
Simplest random K-satisfiability problem [PDF]
Physical Review E, 2000 We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In statistical-mechanics language,
A. Barrat +21 more
core +5 more sources
Valued Workflow Satisfiability Problem [PDF]
Proceedings of the 20th ACM Symposium on Access Control Models and Technologies, 2015 A workflow is a collection of steps that must be executed in some specific order to achieve an objective. A computerised workflow management system may enforce authorisation policies and constraints, thereby restricting which users can perform particular
J. Crampton, G. Gutin, Daniel Karapetyan
semanticscholar +4 more sources
On the Satisfiability Problem for SPARQL Patterns [PDF]
Journal of Artificial Intelligence Research, 2014 The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of satisfiability in
Xiaowang Zhang +2 more
semanticscholar +3 more sources
Two-Variable Logic with Two Order Relations [PDF]
Logical Methods in Computer Science, 2012 It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.
Thomas Schwentick, Thomas Zeume
doaj +3 more sources
Satisfiability Problem in Interval FP-logic
Известия Иркутского государственного университета: Серия "Математика", 2023 The article investigates the interval modal logic, in which an action of the modal operator $\Diamond$ is limited by the boundaries of an interval. In addition, the language of modal logic is extended by the operator $D (\alpha, \beta)$, the truth of ...
N.A. Protsenko +2 more
doaj +2 more sources
Quantum Algorithm for Variant Maximum Satisfiability [PDF]
Entropy, 2022 In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that
Abdirahman Alasow +2 more
doaj +2 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +4 more sources