Advances in methods for solving Boolean satisfiability (SAT) for large problems have motivated recent attempts to recast physical design problems as Boolean SAT problems. One persistent criticism of these approaches is their inability to supply partial solutions, i.e, to satisfy most but not all of the constraints cast in the SAT style. In this paper we present a formulation for “subset satisfi...

Many e cient algorithms have been developed for satis ability testing. They complement rather than exclude each other by being e ective for particular problem instances. In this research, we give a Multi-SAT algorithm for the SAT problem. The Multi-SAT algorithm integrates several e cient SAT algorithms. It makes use of di erent algorithmic niches for satisability testing. Based on cost-e ectiv...

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

The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers that represent clusters of solutions. The SP-y algorithm generalizes SP to work on the maximum satisfiability (Max-SAT) problem, but the cover interpretation of SP does not generalize to SP-y. In this pap...

In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of di erent encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based approach to CSP solving, which we call Proteus, that does not rely purely on CSP solvers. Inste...

The satisfiability (SAT) problem is a fundamental problem in mathematical logic, inference, automated reasoning, VLSI engineering, and computing theory. In this paper, following CNF and D N F local search methods, we introduce the Universal SAT problem model, UniSAT, which transforms the discrete SAT problem on Boolean space (0, l}"' into an unconstrained global optimization problem on real spa...

Propositional Satisfiability (SAT) is a keystone in the history of computer science. SAT was the first problem shown to be NP-complete in 1971 by Stephen Cook [4]. Having passed more than 40 years from then, SAT is now a lively research field where theory and practice have a natural intermixing. In this talk, we overview the use of SAT in practical domains, where SAT is thought in a broad sense...

In this paper, we investigate whether hard combinatorial problems such as the Hamiltonian circuit problem HCP (an NP-complete problem from graph theory) can be practically solved by transformation to the propositional satissability problem (SAT) and application of fast universal SAT-algorithms like GSAT to the transformed problem instances. By using the eecient transformation method proposed by...

We present a variant of the Weighted Maximum Satisfiability Problem (Weighted Max-SAT), which is a modeling of the Semiring Constraint Satisfaction framework. We show how to encode a Semiring Constraint Satisfaction Problem (SCSP) into an instance of a propositional Weighted Max-SAT, and call the encoding Weighted Semiring Max-SAT (WS-Max-SAT). The clauses in our encoding are highly structured ...