141,401 research outputs found
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints
Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care must be taken to encode them compactly and with good propagation properties. It has been shown that at-most-one (AMO) and exactly-one (EO) relations over subsets of the variables can be exploited in various encodings of PB constraints, improving their compactness and solving performance. In this paper we detect AMO and EO relations completely automatically and exploit them to improve SAT encodings that are based on Multi-Valued Decision Diagrams (MDDs). Our experiments show substantial reductions in encoding size and dramatic improvements in solving time thanks to automatic AMO and EO detection
Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas
The Boolean conjunctive normal form (CNF) satisfiability problem, called SAT for short, gets as input a CNF formula and has to decide whether this formula admits a satisfying truth assignment. As is well known, the remarkable result by S. Cook in 1971 established SAT as the first and genuine complete problem for the complexity class NP. In this thesis we consider SAT for a subclass of CNF, the so called Mixed Horn formula class (MHF). A formula F in MHF consists of a 2-CNF part P and a Horn part H. We propose that MHF has a central relevance in CNF because many prominent NP-complete problems, e.g. Feedback Vertex Set, Vertex Cover, Dominating Set and Hitting Set, can easily be encoded as MHF. Furthermore, we show that SAT remains NP-complete for some interesting subclasses of MHF. We also provide algorithms for some of these subclasses solving SAT in a better running time than O(2^0.5284n) which is the best bound for MHF so far. One of these subclasses consists of formulas, where the Horn part is negative monotone and the variable graph corresponding to the positive 2-CNF part P consists of disjoint triangles only. Regarding the other subclass consisting of certain k-uniform linear mixed Horn formulas, we provide an algorithm solving SAT in time O(k^(n/k)), for k>=4. Additionally, we consider mixed Horn formulas F in MHF for which holds: H is negative monotone, c=3. We also prove the NP-completeness of XSAT for CNF formulas which are l-regular meaning that every variable occurs exactly l times, where l>=3 is a fixed integer. On that basis, we can provide the NP-completeness of XSAT for the subclass of linear and l-regular formulas. This result is transferable to the monotone case. Moreover, we provide an algorithm solving XSAT for the subclass of monotone, linear and l-regular formulas faster than the so far best algorithm from J. M. Byskov et al. for CNF-XSAT with a running time of O(2^0.2325n). Using some connections to finite projective planes, we can also show that XSAT remains NP-complete for linear and l-regular formulas that in addition are l-uniform whenever l=q+1, where q is a prime power. Thus XSAT most likely is NP-complete for the other values of l>= 3, too. Apart from that, we are interested in exact linear formulas: Here each pair of distinct clauses has exactly one variable in common. We show that NAESAT is polynomial-time decidable restricted to exact linear formulas. Reinterpreting this result enables us to give a partial answer to a long-standing open question mentioned by T. Eiter: Classify the computational complexity of the symmetrical intersecting unsatisfiability problem (SIM-UNSAT). Then we show the NP-completeness of XSAT for monotone and exact linear formulas, which we can also establish for the subclass of formulas whose clauses have length at least k, k>=3. This is somehow surprising since both SAT and not-all-equal SAT are polynomial-time solvable for exact linear formulas. However, for k=3,4,5,6 we can show that XSAT is polynomial-time solvable for the k-uniform, monotone and exact linear formula class
Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances
This paper first analyzes the resolution complexity of two random CSP models
(i.e. Model RB/RD) for which we can establish the existence of phase
transitions and identify the threshold points exactly. By encoding CSPs into
CNF formulas, it is proved that almost all instances of Model RB/RD have no
tree-like resolution proofs of less than exponential size. Thus, we not only
introduce new families of CNF formulas hard for resolution, which is a central
task of Proof-Complexity theory, but also propose models with both many hard
instances and exact phase transitions. Then, the implications of such models
are addressed. It is shown both theoretically and experimentally that an
application of Model RB/RD might be in the generation of hard satisfiable
instances, which is not only of practical importance but also related to some
open problems in cryptography such as generating one-way functions.
Subsequently, a further theoretical support for the generation method is shown
by establishing exponential lower bounds on the complexity of solving random
satisfiable and forced satisfiable instances of RB/RD near the threshold.
Finally, conclusions are presented, as well as a detailed comparison of Model
RB/RD with the Hamiltonian cycle problem and random 3-SAT, which, respectively,
exhibit three different kinds of phase transition behavior in NP-complete
problems.Comment: 19 pages, corrected mistakes in Theorems 5 and
Solving Mahjong Solitaire boards with peeking
We first prove that solving Mahjong Solitaire boards with peeking is
NP-complete, even if one only allows isolated stacks of the forms /aab/ and
/abb/. We subsequently show that layouts of isolated stacks of heights one and
two can always be solved with peeking, and that doing so is in P, as well as
finding an optimal algorithm for such layouts without peeking.
Next, we describe a practical algorithm for solving Mahjong Solitaire boards
with peeking, which is simple and fast. The algorithm uses an effective pruning
criterion and a heuristic to find and prioritize critical groups. The ideas of
the algorithm can also be applied to solving Shisen-Sho with peeking.Comment: 10 page
Scaling of running time of quantum adiabatic algorithm for propositional satisfiability
We numerically study quantum adiabatic algorithm for the propositional
satisfiability. A new class of previously unknown hard instances is identified
among random problems. We numerically find that the running time for such
instances grows exponentially with their size. Worst case complexity of quantum
adiabatic algorithm therefore seems to be exponential.Comment: 7 page
- …