Can sat be solved in “moderately exponential” time, i.e., in time p(|F |) 2 for some polynomial p and some constant c < 1, where F is a CNF formula of size |F | over n variables? This challenging question is far from being resolved. In this paper, we relate the question of moderately exponential complexity of sat to the question of moderately exponential complexity of problems defined by existe...

We describe two new probabilistic planning techniques|c-maxplan and zander|that generate contingent plans in probabilistic propositional domains. Both operate by transforming the planning problem into a stochastic satis ability problem and solving that problem instead. c-maxplan encodes the problem as an E-Majsat instance, while zander encodes the problem as an S-Sat instance. Although S-Sat pr...

Schöning [Sch99] proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. His analysis showed that for 3-SAT, finding a satisfying assignment of any satisfiable formula F with n variables can be achieved in poly(n) · (4/3) (= poly(n) · (1.3333)) expected time, which is optimal up to now. In this paper, we improve this expected time bound by using a combination of a de...

In [?], Schöning proposed a simple yet efficient randomized algorithm for solving the kSAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) · (4/3) = O(1.3334) when given a formula F on n variables. This was the up to now best running time known for an algorithm solving 3-SAT. In this paper, we describe an algorithm which improves upon this time bound by comb...

In MaxSat, we are given a CNF formula F with n variables and m clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let r1, . . . , rm be the number of literals in the clauses of F . Then asat(F ) = ∑m i=1(1 − 2 −ri) is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independ...

normal 0 false false false en-us x-none ar-sa background: this study was aimed at assessing the accuracy of provocative tests in diagnosis of acute or chronic cervical radiculopathy (cr) based on an electrodiagnostic reference criterion. materials and methods: shoulder abduction test (sat), spurling test (st), upper limb tension test (ultt), and electromyography were done on 97 patients who ref...

Kelley, David E., F. Leland Thaete, Fred Troost, Trina Huwe, and Bret H. Goodpaster. Subdivisions of subcutaneous abdominal adipose tissue and insulin resistance. Am J Physiol Endocrinol Metab 278: E941–E948, 2000.—Whereas truncal (central) adiposity is strongly associated with the insulin resistant metabolic syndrome, it is uncertain whether this is accounted for principally by visceral adipos...

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of advantages over Boolean SAT. Most importantly, it produces more compact encodings that capture pro...