SATLIB is an online resource for SAT-related research established in June 1998. Its core components, a benchmark suite of SAT instances and a collection of SAT solvers, aim to facilitate empirical research on SAT by providing a uniform test-bed for SAT solvers along with freely available implementations of high-performing SAT algorithms. In this article, we give an overview of SATLIB; in partic...

We provide some evidence that Unique k-SAT is as hard to solve as general k-SAT, where k-SAT denotes the satisfiability problem for k-CNFs with at most k literals in each clause and Unique k-SAT is the promise version where the given formula has 0 or 1 solutions. Namely, defining for each k > 1, sk = inf{δ > 0 | ∃ a O(2)-time randomized algorithm for k-SAT} and, similarly, σk = inf{δ > 0 | ∃ a ...

Minimally invasive techniques to access subcutaneous adipose tissue for glucose monitoring are successfully applied in type1 diabetic and critically ill patients. During critical illness, the addition of a lactate sensor might enhance prognosis and early intervention. Our objective was to evaluate SAT as a site for lactate measurement in critically ill patients. In 40 patients after major cardi...

We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γth coefficient for generating function f(z), where λ and γ are growing at a fixed rate, we obtain a new upper bound 2 log 2−(k+1) log 2/2+ εk for this problem, which is below the best current known upper boun...

Propositional model counting (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the inherent complexity of the problem, approximate model counting, which counts the number of satisfying assignments to within given tolerance and confidence level, was proposed as a practical alternative to ...

Boolean Satisjiability (SAT) is often used as the underlying model for a signijicant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other jields of Computer Science and Engineering. In recent years, new and efJicient algorithms for SAT have been developed, allowing much larger problem instances to be solved. SAT " packages " are currently expected...

results we found 28 cases with positive results for b. melitensis by multiplex pcr technique which was significantly different from of sat (p<0.05). six samples were positive for b. abortus by pcr. conclusion the results of present study showed that multiplex pcr assay is a rapid and sensitive technique for diagnosis of brucellosis compared to sat. however it is more accurate when coupled with ...

Classifying remote sensing imageries to obtain reliable and accurate LandUse/Cover (LUC) information still remains a challenge that depends on many factors suchas complexity of landscape especially in arid region. The aim of this paper is to extractreliable LUC information from Land sat imageries of the Pishkouh watershed of centralarid region, Iran. The classical Maximum Likelihood Classifier ...

The majority of ensemble creation algorithms use the full set of available features for its task. Feature selection for ensemble creation has not been carried out except for some work on random feature selection. In this paper we focus our attention on genetic based feature selection for ensemble creation. Our approach uses a genetic algorithm to search over the entire feature space. Subsets of...

Logic locking is used to protect integrated circuits (ICs) from piracy and counterfeiting. An encrypted IC implements the correct function only when right key input. Many existing logic-locking methods are subject powerful satisfiability (SAT)-based attack. Recently, an Anti-SAT scheme has been developed. By adopting two complementary logic blocks that consist of AND/NAND trees, it makes number...