GRASP: A New Search Algorithm for Satisfiability

This paper introduces GRASP (Generic search Algorithm J3r the Satisfiabilily Problem), an integrated algorithmic J3amework 30r SAT that unifies several previously proposed searchpruning techniques and jcilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishingjature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack non-chronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by 'ecording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Einally, straighrward bookkeeping of the causali y chains leading up to conflicts a/lows GRASP to identij) assignments that are necessary jr a solution to be found. Experimental results obtained jom a large number of benchmarks, including many J3om the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely ejctive jr a large number of representative classes of SAT instances

Heterotrophy as a tool to overcome the long and costly autotrophic scale-up process for large scale production of microalgae

Industrial scale-up of microalgal cultures is often a protracted step prone to culture collapse and the occurrence of unwanted contaminants. To solve this problem, a two-stage scale-up process was developed - heterotrophically Chlorella vulgaris cells grown in fermenters (1st stage) were used to directly inoculate an outdoor industrial autotrophic microalgal production unit (2nd stage). A preliminary pilot-scale trial revealed that C. vulgaris cells grown heterotrophically adapted readily to outdoor autotrophic growth conditions (1-m3 photobioreactors) without any measurable difference as compared to conventional autotrophic inocula. Biomass concentration of 174.5 g L-1, the highest value ever reported for this microalga, was achieved in a 5-L fermenter during scale-up using the heterotrophic route. Inocula grown in 0.2- and 5-m3 industrial fermenters with mean productivity of 27.54 ± 5.07 and 31.86 ± 2.87 g L-1 d-1, respectively, were later used to seed several outdoor 100-m3 tubular photobioreactors. Overall, all photobioreactor cultures seeded from the heterotrophic route reached standard protein and chlorophyll contents of 52.18 ± 1.30% of DW and 23.98 ± 1.57 mg g-1 DW, respectively. In addition to providing reproducible, high-quality inocula, this two-stage approach led to a 5-fold and 12-fold decrease in scale-up time and occupancy area used for industrial scale-up, respectively.Agência financiadora project FERMALG 017608 Fundacao para a Ciencia e a Tecnologia (FCT) UID/Multi/04326/2019 project FERMALG (AVISO) 32/SI/2015info:eu-repo/semantics/publishedVersio

Heuristic Backtracking Algorithms for SAT

In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new challenging problem instances, many of which too hard for the current generation of SAT solvers. As a result, further improvements to SAT technology are expected to have key consequences in formal verification. The objective of this paper is to propose heuristic approaches to the backtrack step of backtrack search SAT solvers, with the goal of increasing the ability of the SAT solver to search different parts of the search space. The proposed heuristics to the backtrack step are inspired by the heuristics proposed in recent years for the branching step of SAT solvers, namely VSIDS and some of its improvements. The preliminary experimental results are promising, and motivate the integration of heuristic backtracking in state-of-the-art SAT solvers. 1

Boolean Satisfiability in Electronic Design Automation

Boolean Satisfiability (SAT) is often used as the underlying model for a significant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other fields of Computer Science and Engineering. In recent years, new and efficient algorithms for SAT have been developed, allowing much larger problem instances to be solved. SAT “packages” are currently expected to have an impact on EDA applications similar to that of BDD packages since their introduction more than a decade ago. This tutorial paper is aimed at introducing the EDA professional to the Boolean satisfiability problem. Specifically, we highlight the use of SAT models to formulate a number of EDA problems in such diverse areas as test pattern generation, circuit delay computation, logic optimization, combinational equivalence checking, bounded model checking and functional test vector generation, among others. In addition, we provide an overview of the algorithmic techniques commonly used for solving SAT, including those that have seen widespread use in specific EDA applications. We categorize these algorithmic techniques, indicating which have been shown to be best suited for which tasks

Abrasion of flat rotating shapes

We report on the erosion of flat linoleum "pebbles" under steady rotation in a slurry of abrasive grit. To quantify shape as a function of time, we develop a general method in which the pebble is photographed from multiple angles with respect to the grid of pixels in a digital camera. This reduces digitization noise, and allows the local curvature of the contour to be computed with a controllable degree of uncertainty. Several shape descriptors are then employed to follow the evolution of different initial shapes toward a circle, where abrasion halts. The results are in good quantitative agreement with a simple model, where we propose that points along the contour move radially inward in proportion to the product of the radius and the derivative of radius with respect to angle