In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT problems which become larger and larger. A SAT solver needs to solve the problems until it encounters a satisfiable SAT problem. Many state-of-the-art SAT solvers learn lemmas called conflict clauses to prune redundant sea...

The currently fastest known algorithm for k-SAT is PPSZ named after its inventors Paturi, Pudlák, Saks, and Zane [7]. Analyzing its running time is much easier for input formulas with a unique satisfying assignment. In this paper, we achieve three goals. First, we simplify Hertli’s 2011 analysis [1] for input formulas with multiple satisfying assignments. Second, we show a “translation result”:...

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of advantages over Boolean SAT. Most importantly, it produces more compact encodings that capture pro...

background: brucellosis is a febrile zoonotic infectionand has worldwide distribution among humans as well asanimals. although the seroprevalence of brucellosis in variousanimals has been described in iran, there is only one report onequine brucellosis in the region. objectives: this study wascarried out to determine the seroprevalence of brucellosis inracing clubs and private horse owners in t...

Introduction: The present study aimed to suggest an unsupervised method for the segmentation of visceral adipose tissue (VAT) and subcutaneous adipose tissue (SAT) in axial magnetic resonance (MR) images of the abdomen. Materials and Methods: A self-organizing map (SOM) neural network was designed to segment the adipose tissue from other tissues in the MR images. The segmentation of SAT and VA...

In this paper we deal with the SAT problem in many-valued logics wich is of relevant interest in many areas of Artificial Intelligence and Computer Science. Regarding tractability issues, several works have been previously published solving polynomially some clausal manyvalued SAT problems. Thus, our aims is to show that certain nonclausal many-valued SAT problems can be solved in polynomial ti...

In this paper, we are interested in the Maximum Satisfiability Problem (MAX-SAT) which is an optimization variant of the Boolean satisfiability problem (SAT). SAT is of a central importance in various areas of computer science, including theoretical computer science, algorithmic, artificial intelligence, hardware design and verification. Formally, given a set of m clauses C = {C1;C2 . . . Cm} i...