Given n Boolean variables x1, . . . , xn, a k-clause is a disjunction of k literals, where a literal is a variable or its negation. Suppose random k-clauses are generated one at a time and an online algorithm accepts or rejects each clause as it is generated. Our goal is to accept as many randomly generated k-clauses as possible with the condition that it must be possible to satisfy every claus...

Craig interpolation is a widespread method in verification, with important applications such as Predicate Abstraction, CounterExample Guided Abstraction Refinement and Lazy Abstraction With Interpolants. Most state-of-the-art model checking techniques based on interpolation require collections of interpolants to satisfy particular properties, to which we refer as “collectives”; they do not hold...

This paper consists of two conceptually related but independent parts. In the first part we initiate the study of k-SAT instances of bounded diameter. The diameter of an ordered CNF formula is defined as the maximum difference between the index of the first and the last occurrence of a variable. We investigate the relation between the diameter of a formula and the tree-width and the path-width ...

The objectives of this research are to further investigate the foundations for novel SMT and SAT-based bounded model checking (BMC) algorithms for real-time and multi-agent systems. A major part of the research will involve the development of SMT-based BMC methods for standard Kripke structures, extended Kripke structures, and for different kinds of interpreted systems for different kinds of te...

Bounded model checking (BMC) is an incremental refutation technique to search for counterexamples of increasing length. The existence of a counterexample of a fixed length is expressed by a first-order logic formula that is checked for satisfiability using a suitable solver. We apply communicating parallel solvers to check satisfiability of the BMC formulae. In contrast to other parallel solvin...

1

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...

Propositional satisfiability (SAT) was the first decision problem to be shown nondeterministic polynomial (NP) complete and has been the subject of remarkable theoretical work over the years. Moreover, SAT and extensions of SAT find many practical applications, including planning, software and hardware model checking, bioinformatics, equivalence check ing, test-pattern generation, software pack...

BACKGROUND AND OBJECTIVES Obesity is a risk factor for incident chronic kidney disease (CKD). Visceral (VAT) and subcutaneous adipose tissue (SAT) may confer differential metabolic risk profiles. The relations of VAT and SAT were analyzed with CKD as estimated by creatinine- and cystatin-based estimating equations. DESIGN, SETTING, PARTICIPANTS, & MEASUREMENTS Participants from the Framingham...

Sat-RNA is one of several replicating satellite RNAs which have been isolated from RNA encapsidated in cucumber mosaic virus (CMV) and which are totally dependent on CMV for replication. The 336 residue sequence of Sat-RNA obtained using the dideoxynucleotide chain termination and partial enzymic digestion procedures shows only a few short stretches (up to 11 residues) of sequence homology with...