The study was designed to investigate the cellular mechanisms underlying the differential fat expansion in different fat depots in wild type (WT) and ob/ob (OB) mice. At 6 weeks old, no differences in fat mass were found between SAT and VAT in WT mice, while O-SAT showed significantly higher weight than that of O-VAT. The average adipocyte size of SAT (~ 4133.47 μm2) was smaller than that of VA...

We give a categorical perspective on various product rules, including Brzozowski’s product rule ((st)a = sat + o(s)ta) and the familiar rule of calculus ((st)a = sat+ sta). It is already known that these product rules can be represented using distributive laws, e.g. via a suitable quotient of a GSOS law. In this paper, we cast these product rules into a general setting where we have two monads ...

Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core decision procedures for a wide range of combinatorial problems. Advances in SAT solving during the last 10–15 years have been spurred by yearly solver competitions. In this article, we report on the main SAT solver competition held in 2012, SAT Challenge 2012. Besides providing an overview of how...

The evolution of the gluon plasma produced with saturation initial conditions is calculated via Boltzmann transport theory for nuclear collisions at high energy. The saturation scale increases with A and √ s, and thus we find that the perturbative rescattering rate decreases relative to the initial longitudinal expansion rate of the plasma. The effective longitudinal pressure remains significan...

Let A(x) be the characteristic function of A. Consider the function Fk (x1, . . . , xk) = A(x1) · · ·A(xk). We show that if F A k can be computed with fewer than k queries to some set X then A ∈ P/poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming Σp3 6= Π p 3, there are functions comp...

Regular-SAT is a constraint programming language between CSP and SAT that—by combining many of the good properties of each paradigm—offers a good compromise between performance and expressive power. Its similarity to SAT allows us to define a uniform encoding formalism, to extend existing SAT algorithms to Regular-SAT without incurring excessive overhead in terms of computational cost, and to i...

Symmetry is a topic studied by both the Satisfiability (SAT) and the Constraint Programming (CP) community. However, few attempts at transferring results between both communities have been made. This paper makes the link by investigating how symmetries from Constraint Satisfaction Problems (CSPs) transfer to symmetries of their SAT encodings. We point out that important symmetry groups studied ...

This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences to the version of these solvers used in the SAT Challenge 2012. For further information we refer to the solver description [1] of the SAT Challenge 2012 or source code.

We use the notion of boundary points to study resolution proofs. Given a CNF formula F , an l(x)-boundary point is a complete assignment falsifying only clauses of F having the same literal l(x) of variable x. An l(x)-boundary point p mandates a resolution on variable x. Adding the resolvent of this resolution to F eliminates p as an l(x)-boundary point. Any resolution proof has to eventually e...

In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference rules. The three of them are special cases of Max-SAT resolution with which better lower bounds and more value pruning is achieved. Our experimental results on several domains show that the resulting algorithm can be orders of magnitude faster than state-of-theart Max-SAT solvers and the best Weighted...