Results 111 to 120 of about 12,229,216 (240)
Clustering of solutions in the random satisfiability problem
, 2005 Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other.
D. Achlioptas +8 more
core +1 more source
Syntactic separation of subset satisfiability problems
, 2019 Variants of the Exponential Time Hypothesis (ETH) have been used to derive lower bounds on the time complexity for certain problems, so that the hardness results match long-standing algorithmic results. In this paper, we consider a syntactically defined class of problems, and give conditions for when problems in this class require strongly exponential ...
Farach, Martin +2 more
openaire +3 more sources
(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints [PDF]
, 2013 We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints.
Ganesh, Vijay +3 more
core
The Boolean Satisfiability Problem
, 2020 The Boolean Satisfiability Problem is also the first problem proven to be NP-complete. A problem is NP-complete if it belongs to the set (or "class" if you prefer) of the hardest problems in NP-hardest in the sense that every problem ever exists in NP can be reduced to them. (Thus being able to solve a NP-complete problem is equivalent to being able to
openaire +1 more source
Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers
IEEE Transactions on Quantum EngineeringMany search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.
Vahideh Eshaghian +3 more
doaj +1 more source
MAX-SAT Problem using Hybrid Harmony Search Algorithm
Journal of Intelligent Systems, 2018 Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula.
Abu Doush Iyad +3 more
doaj +1 more source
, 2011 This paper is withdrawn by the author because a revision has been ...
openaire +2 more sources
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi [PDF]
Logical Methods in Computer ScienceThe coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based.
Daniel Hausmann, Lutz Schröder
doaj +1 more source
Satisfiability thresholds for regular occupation problems
Combinatorics, Probability and ComputingAbstractIn the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the rigorous and non-rigorous side, has led to major advances regarding both the theoretical as well as the ...
Konstantinos Panagiotou, Matija Pasch
openaire +4 more sources
Optimised ExpTime Tableaux for 𝒮ℋℐ𝒩 over Finite Residuated Lattices
Journal of Applied Mathematics, 2014 This study proposes to adopt a novel tableau reasoning algorithm for the description logic 𝒮ℋℐ𝒩 with semantics based on a finite residuated De Morgan lattice.
Jian Huang, Xinye Zhao, Jianxing Gong
doaj +1 more source