land degradation is a major danger which restricting different areas of iran. systematic description of the environmentfor detection of environmental changes and the human-related causes and responses is essential in land cover changestudy. use of land cover data allow detection of where certain changes occur, what type of change, as well as how theland is changing. existing systems for classif...

A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substituting the existential variables by the Boolean functions results in a true formula. We call a satisfying set of Boolean functions a model. In this paper, we investigate for various classes of quantified Boolean formul...

We introduce a new class of succinct games, called weighted boolean formula games. Here,each player has a set of boolean formulas he wants to get satisfied. The boolean formulas ofall players involve a ground set of boolean variables, and every player controls some of thesevariables. The payoff of a player is the weighted sum of the values of his boolean formulas. For theseg...

Stochastic Boolean Satisfiability (SSAT) is a powerful representation for the concise encoding of quantified decision problems with uncertainty. While it shares commonalities formula (QBF) satisfiability and has same PSPACE-complete complexity, SSAT solving tends to be more challenging as involves expensive model counting, a.k.a. Sharp-SAT. To date, solvers, especially those imposing no restric...

In this short paper, we describe QBF solvers from the latest QBFEval that were based on the SAT-to-SAT solver. We present the main ideas behind the solvers and discuss their strengths and weaknesses.

We present a simplified proof that Brent/Spira restructuring of Boolean formulas can be improved to allow a Boolean formula of size n to be transformed into an equivalent log depth formula of size O(nα) for arbitrary α > 1.

Algebraic immunity of Boolean functions is a very important concept in recently introduced algebraic attacks of stream cipher. For a n-variable Boolean function f , the algebraic immunity AIn(f) takes values in {0, 1, . . . , d2 e}. For every k in this range, denote Bn,k the set of all n-variable Boolean functions with algebraic immunity k, and we know that Bn,k is always non-empty. According t...

Counting the models of Boolean formulae is known to be intractable but pops up often in diverse areas. We focus in a restricted version of the problem. In particular, our results are based on matrix operators and Hadamard product for counting models of Boolean formulae consisting of chains and embedded cycles. We obtain an efficient algorithm such that the input is a Boolean formula Σ in 2-CNF ...

This paper presents constant propagation and common factors rewriting methods for boolean formula preprocessing. Formula rewriting performs symbolic simplification, and attempts to reconstitute hidden structure in the model that was lost by the conversion to a boolean formula. We show examples of fault trees whose assessment becomes feasible only after this kind of preprocessing.