background and objective: magnetic resonance imaging (mri) is the most sensitive technique to detect multiple sclerosis (ms) plaques in central nervous system. in some cases, the patients who were suspected to ms, whereas mri images are normal, but whether patients don’t have ms plaques or mri images are not enough optimized enough in order to show ms plaques? the aim of the current study is ev...

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

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

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

We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a probability parameter p; for p = 1, a k-gd-sat problem is a k-sat problem. We report on the phase transition between satisfiability and unsatisfiability for randomly generated instances of k-gd-sat. We provide theoretical analysis...

We show that there exists a natural encoding which transforms Min-SAT instances into Max-SAT instances. Unlike previous encodings, this natural encoding keeps the same variables, and the optimal assignment for the Min-SAT instance is identical to the optimal assignment of the corresponding Max-SAT instance. In addition to that the encoding can be generalized to the Min-SAT variants with clause ...

One of the most studied models SAT is random SAT. In this model, instances are composed from clauses chosen uniformly randomly and independently each other. This model may be unsatisfactory in that it fails to describe various features instances, arising real-world applications. Various modifications have been suggested define industrial Here, we focus mainly on aspect community structure. Name...

This study uses analysis of co-variance in order to determine which cognitive/learning (working memory, knowledge integration, epistemic belief of learning) or social/personality factors (test anxiety, performance-avoidance goals) might account for gender differences in SAT-V, SAT-M, and overall SAT scores. The results revealed that none of the cognitive/learning factors accounted for gender di...

Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.