Although the sulfate/anion transporter (sat-1; SLC26A1) was isolated from a rat liver cDNA library by expression cloning, localization of sat-1 within the liver and its contribution to the transport of sulfate and organo sulfates have remained unresolved. In situ hybridization and immunohistochemical studies were undertaken to demonstrate the localization of sat-1 in liver tissue. RT-PCR studie...

background: brucellosis is a world-wide disease, which has a diverse clinical manifestation, and its diagnosis has to be proven by laboratory data. serum agglutination test (sat) is the most-widely used test for diagnosing brucellosis. the enzyme linked immunosorbent assay (elisa) can also determine specific antibody classes against brucella. it is a sensitive, simple and rapid test, which coul...

This special issue comprises six papers devoted to SAT solving and three papers devoted to MAXSAT solving. With two exception, the papers contain detailed information about some of the best solvers from the 5th SAT solver competition and from the 2nd MAX-SAT solver competition, which took place as side event of the 10th International Conference on Theory and Applications of Satisfiability Testi...

We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which ∆p2 is not equal to...

In a sample of undergraduate students, myopia was associated with higher Math and Total SAT score, and males had higher Math and Total SAT scores than females. The association between myopia and higher Math and Total SAT scores was significant only among males, and the gender differences in Math and Total SAT scores were significant only among allergic participants. There were also significant ...

This contribution contains a fast SAT solver for Isabelle written in Standard ML. By loading the theory DPT SAT Solver, the SAT solver installs itself (under the name “dptsat”) and certain Isabelle tools like Refute will start using it automatically. This is a port of the DPT (Decision Procedure Toolkit) SAT Solver written in OCaml. Theory DPT SAT Tests tests the solver on a few hundred problems.

Many real-world problems are nowadays encoded into SAT instances and efficiently solved by CDCL SAT solvers. However, some scenarios require distributed problem solving approaches. Privacy is often the main reason. This causes the distributed SAT problem. In this work, we analyze how this problem can be tacked in an efficient way, and present ABTSAT, a new version of the ABT algorithm adapted t...

In this paper we focus on Planning as Satisfiability (SAT). We build from the simple consideration that the values of fluents at a certain time point derive deterministically from the initial situation and the sequence of actions performed till that point. Thus, the choice of actions to perform is the only source of nondeterminism. This is a rather trivial consideration, but which has important...

Propositional Satisfiability (SAT) is a keystone in the history of computer science. SAT was the first problem shown to be NP-complete in 1971 by Stephen Cook [4]. Having passed more than 40 years from then, SAT is now a lively research field where theory and practice have a natural intermixing. In this talk, we overview the use of SAT in practical domains, where SAT is thought in a broad sense...

Recent advances in SAT solvers based on CNF have focused, in particular, on innovative techniques for Boolean constraint propagation (BCP), variable selection, and back-jumping with conflict-driven learning. These techniques have proved to be critical for the high performance of SAT solvers. A great effort by the SAT community has been made to present these SAT techniques clearly and neatly so ...