Frequent itemset mining is an essential part of data analysis and data mining. Recent works propose interesting SAT-based encodings for the problem of discovering frequent itemsets. Our aim in this work is to define strategies for adapting SAT solvers to such encodings in order to improve models enumeration. In this context, we deeply study the effects of restart, branching heuristics and claus...

Learning, re-starting and other techniques of modern SAT solvers have been shown efficient when solving SAT instances from industrial application. The ability to exploit the structure of these instances has been proposed as the responsible of such success. Here we study the modularity of some of these instances, used in the latest SAT competitions. Using a simple label propagation algorithm we ...

This paper presents versat, a formally verified SAT solver incorporating the essential features of modern SAT solvers, including clause learning, watched literals, optimized conflict analysis, non-chronological backtracking, and decision heuristics. Unlike previous related work on SAT-solver verification, our implementation uses efficient low-level data structures like mutable C arrays for clau...

We propose two heuristics, implicit learning and explicit learning, that utilize circuit topological information and signal correlations to derive conflict clauses that could efficiently prune the search space for solving circuit-based SAT problem instances. We implemented a circuit-SAT solver SC-C-SAT based on the proposed heuristics and the concepts used in other state-of-the-art SAT solvers....

This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It ...

Whereas truncal (central) adiposity is strongly associated with the insulin resistant metabolic syndrome, it is uncertain whether this is accounted for principally by visceral adiposity (VAT). Several recent studies find as strong or stronger association between subcutaneous abdominal adiposity (SAT) and insulin resistance. To reexamine the issue of truncal adipose tissue depots, we performed c...

The success of portfolio approaches in SAT solving relies on the observation that different SAT solving techniques perform better on different SAT instances. The Algorithm Selection Problem faces the problem of choosing, using a prediction model, the best algorithm from a predefined set, to solve a particular instance of a problem. Using Machine Learning techniques, this prediction is performed...

The last few years have seen significant advances in Boolean satisfiability (SAT) solving. This has lead to the successful deployment of SAT solvers in a wide range of problems in Engineering and Computer Science. In general, most SAT solvers are applied to Boolean decision problems that are expressed in conjunctive normal form (CNF). While this input format is applicable to some engineering ta...

Transmission of a plaque-purified SAT-2 foot-and-mouth disease virus (FMDV) occurred erratically from artificially infected African buffaloes in captivity to susceptible buffaloes and cattle in the same enclosure; in some instances transmission occurred only after contact between persistently infected carriers and susceptible animals lasting a number of months. Because the rate at which FMDV mu...

Isolates of groundnut rosette umbravirus (GRV) contain a satellite RNA (sat-RNA), about 900 nucleotides (nt) in length, different variants of which are responsible for the symptoms of different forms of rosette disease in groundnuts and, in the particular instance of sat-RNA YB3b, for the production of yellow blotch symptoms in Nicotiana benthamiana. Sat-RNA YB3b does not affect the accumulatio...