Results 41 to 50 of about 12,229,216 (240)
Bounded Reachability for Temporal Logic over Constraint Systems [PDF]
, 2010 We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such logic can be ...
Bersani, Marcello M. +5 more
core +2 more sources
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]
Logical Methods in Computer ScienceWe introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
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
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics [PDF]
2009 24th Annual IEEE Symposium on Logic In Computer Science, 2009 Graded modal logic is the formal language obtained from ordinary modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as "It ...
Yevgeny Kazakov, Ian Pratt-Hartmann
semanticscholar +1 more source
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
On the Satisfiability of Local First-Order Logics with Data [PDF]
Logical Methods in Computer ScienceWe study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality.
Benedikt Bollig +2 more
doaj +1 more source
Canonical Models and the Complexity of Modal Team Logic [PDF]
Logical Methods in Computer Science, 2019 We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood.
Martin Lück
doaj +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
Random K-satisfiability problem: from an analytic solution to an efficient algorithm. [PDF]
Physical review. E, Statistical, nonlinear, and soft matter physics, 2002 We study the problem of satisfiability of randomly chosen clauses, each with K Boolean variables. Using the cavity method at zero temperature, we find the phase diagram for the K=3 case.
M. Mézard, R. Zecchina
semanticscholar +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