Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer’s framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way. The polynomial representation of constraints gives rise to a relaxation o...

the water crisis is harmful effects on human life. also one of the most problems in the human society is water resources management. in this study, site selection of most suitable areas for artificial recharge using boolean model. criteria used to select the most suitable area for artificial recharge included: infiltration, slope, aquifer thickness, aquifer quality.  the layers were produced an...

Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a Boolean value. The automata-theoretic approach for reasoning about Boolean-valued systems has proven to be very useful and powerful. We develop an automata-theoretic framework for reasoning about multi-valued objects, and describ...

Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic ...

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended ∨-De Morgan law introduced in [20]. Then, using this result and the results of [20], we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) in the variety o...