We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds a satisfying assignment, assuming one exists, with probability 1−e−α, in worst-case time O(kmn) and space O(2(1− 1 k ). This makes it the most space-efficient DNA k-SAT algorithm for k > 3 and k < n/ logα (i.e. the clau...

Wild-type (WT) NOD.H-2h4 mice develop spontaneous autoimmune thyroiditis (SAT) when given 0.05% NaI in their drinking water, whereas B cell-deficient NOD.H-2h4 mice are SAT resistant. To test the hypothesis that resistance of B cell-deficient mice to SAT was due to the activity of regulatory CD4+CD25+ T (T reg) cells activated if autoantigen was initially presented on non-B cells, CD25+ T reg c...

Current SAT solvers are powerful enough to be used as engines in real applications. Those applications made the success of a special kind of SAT solvers, namely Conflict Driven Clause Learning SAT solvers (CDClL for short), developed initially by Joao Marques Silva with GRASP [8], and popularized by the SAT solver Chaff [9]. Despite SAT being a NP-complete problem in theory, it might look tract...

The inverse satisfiability problem over a set of relations ? (Inv-SAT(?)) is the deciding whether relation R can be defined as models SAT(?) instance. Kavvadias and Sideri (1998) [15] obtained dichotomy between P co-NP-complete for finite containing two constant Boolean relations. However, arbitrary constraint languages complexity has been wide open, in this article we finally prove complete th...

In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conceptually simple combinatorial problem of substantial theoretical and practical interest; many application-relevant problems, including scheduling problems or most probable explanation finding in Bayes nets, can be encoded and s...

We have previously shown that prolonged high-saturated fat feeding (SAT) for 8 weeks after myocardial infarction (MI) improves ventricular function and prevents the metabolic remodeling commonly observed in heart failure. The current study was designed to delineate the interplay between markers of energy metabolism and indices of cardiac remodeling with 2 and 4 weeks of post-MI SAT in male Wist...

Die rasante technologische Entwicklung der letzten zwei Jahrzehnte ermöglicht heute die dauerhafte Speicherung riesiger Datenmengen durch den Computer. In fast allen Wissenschaften werden große Datenmengen gespeichert, die analysiert und verstanden werden müssen. Aber nicht nur in der Wissenschaft, sondern auch in kommerziellen Anwendungen und auch im alltäglichen Leben entstehen große Datenmen...

We describe LMHS, an open source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top of the main algorithm, LMHS offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers. We describe the main features of LMHS, and give emp...