On Computing Minimum Unsatisfiable Cores

Certifying the correctness of a SAT solver is straightforward for satisfiable instances of SAT. Given

Probing-Based Preprocessing Techniques for Propositional Satisfiability

Preprocessing is an often used approach for solving hard instances of propositional satisfiability (SAT). Preprocessing can be used for reducing the number of variables and for drastically modifying the set of clauses, either by eliminating irrelevant clauses or by inferring new clauses. Over the years, a large number of formula manipulation techniques has been proposed, that in some situations have allowed solving instances not otherwise solvable with stateof -the-art SAT solvers. This paper proposes probing-based preprocessing, an integrated approach for preprocessing propositional formulas, that for the first time integrates in a single algorithm most of the existing formula manipulation techniques. Moreover, the new unified framework can be used to develop new techniques. Preliminary experimental results illustrate that probing-based preprocessing can be effectively used as a preprocessing tool in state-of-theart SAT solvers

Hidden Structure in Unsatisfiable Random 3-SAT: an Empirical Study

Recent advances in propositional satisfiability (SAT) include studying the hidden structure of unsatisfiable formulas, i.e. explaining why a given formula is unsatisfiable. Although theoretical work on the topic has been developed in the past, only recently two empirical successful approaches have been proposed: extracting unsatisfiable cores and identifying strong backdoors. An unsatisfiable core is a subset of clauses that defines a sub-formula that is also unsatisfiable, whereas a strong backdoor defines a subset of variables which assigned with all values allow concluding that the formula is unsatisfiable. The contribution of this paper is two-fold. First, we study the relation between the search complexity of unsatisfiable random 3-SAT formulas and the sizes of unsatisfiable cores and strong backdoors. For this purpose, we use an existing algorithm which uses an approximated approach for calculating these values. Second, we introduce a new algorithm that optimally reduces the size of unsatisfiable cores and strong backdoors, thus giving more accurate results. Experimental results indicate that the search complexity of unsatisfiable random 3-SAT formulas is related with the size of unsatisfiable cores and strong backdoors. 1

An Overview of Backtrack Search Satisfiability Algorithms

Propositional Satisfiability (SAT) is often used as the underlying model for a significan

Analysis of X-ray spectra emitted from laser-produced plasmas of uranium

In this paper, we used the multiconfiguration Dirac-Fock method to generate theoretical X-ray spectra for Co-, Ni-, Cu-, Zn-, Ga-, Ge-, As-, Se-, Br-, Kr-, and Rb-like uranium ions. Using the distribution of these ions in a laser-produced plasma, for different plasma temperatures, we generate theoretical spectra, which are compared to experimental data

A model for vortex formation in magnetic nanodots

We use Monte Carlo simulation to study the vortex nucleation on magnetic nanodots at low temperature. In our simulations, we have considered a simple microscopic two-dimensional anisotropic Heisenberg model with term to describe the anisotropy due to the presence of the nanodot edge. We have considered the thickness of the edge, which was not considered in previous works, introducing a term that controls the energy associated to the edge. Our results clearly show that the thickness of the edge has a considerable influence in the vortex nucleation on magnetic nanodots. We have obtained the hysteresis curve for several values of the surface anisotropy and skin depth parameter ($\xi$). The results are in excellent agreement with experimental data