This report is a collection of six articles on model checking in the abstraction/refinement framework. This framework is used by various techniques for tackling the state-space explosion problem that is frequently encountered in model checking. The articles collected in this report are (in order of appearance): 1. Counterexample-guided abstraction refinement. Clarke, Grumberg, Jha, Lu, Veith[2]...

Mutation in DNA is the principal cause for differences among human beings, and Single Nucleotide Polymorphisms (SNPs) are the most common mutations. Hence, a fundamental task is to complete a map of haplotypes (which identify SNPs) in the human population. Associated with this effort, a key computational problem is the inference of haplotype data from genotype data, since in practice genotype d...

Analyzing the solution space structure and evolution of 3-satisfiability (3-SAT) problem is an important way to study difficulty solving satisfiability (SAT) problem. However, there no unified analysis model for spatial solutions under different constraint densities. The phase transition points regions based on metric models. 3-SAT obtained by planting strategy belief propagation. According dis...

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

Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm.

In this paper, we show how proper benchmarking, which matches day-to-day use of formal methods, allows us to assess direct improvements for SAT use for formal methods. Proper uses of our benchmark allowed us to prove that previous results on tuning SAT solver for Bounded Model Checking (BMC) were overly optimistic and that a simpler algorithm was in fact more efficient.

We describe two new probabilistic planning techniques|c-maxplan and zander|that generate contingent plans in probabilistic propositional domains. Both operate by transforming the planning problem into a stochastic satis ability problem and solving that problem instead. c-maxplan encodes the problem as an E-Majsat instance, while zander encodes the problem as an S-Sat instance. Although S-Sat pr...

Modern propositional satisfiability (or SAT) solvers are very powerful due to recent developments on the underlying data structures, the used heuristics to guide the search, the deduction techniques to infer knowledge, and the formula simplification techniques that are used during preand inprocessing. However, when all these techniques are put together, the soundness of the combined algorithm i...

The problem of Most Probable Explanation (MPE) arises in the scenario of probabilistic inference: finding an assignment to all variables that has the maximum likelihood given some evidence. We consider the more general CNF-based MPE problem, where each literal in a CNF-formula is associated with a weight. We describe reductions between MPE and weighted MAX-SAT, and show that both can be solved ...

Objective: With the rapid growth of picture archiving and communication systems (PACS) in the healthcare industry, this article describes the users’ satisfaction with PACS by employing functional PACS features and the two concepts of perceived ease-of-use (PEOU) and perceived usefulness (PU), based on the extended technology acceptance model (TAM). Methods: A cross-sectional survey was conducte...