one of the models that can be used to study the relationship between boolean random sets and explanatory variables is growth regression model which is defined by generalization of boolean model and permitting its grains distribution to be dependent on the values of explanatory variables. this model can be used in the study of behavior of boolean random sets when their coverage regions variation...

We study when a map between two subsets of a Boolean domain W can be extended to an automorphism of W . Under many hypotheses, if the underlying Boolean algebra is complete or if the sets are finite or Boolean domains, the necessary and sufficient condition is that it preserves the Boolean distance between every couple of points.

We investigate an extended model of spiking neural P systems incorporating astrocytes and their excitatory or inhibitory influence on axons between neurons. Using very restricted variants of extended spiking neural P systems with excitatory and inhibitory astrocytes we can easily model Boolean gates like NAND-gates as well as discrete amplifiers. Key–Words: Astrocytes, Boolean functions, spikin...

This paper presents the spectral method of recognition of an incompletely defined Boolean function. The main goal of analysis is fast estimation whether a given single output function can be extended to affine form. Furthermore, a simple extension algorithm is proposed for functions, for which the affine form is reachable. The algorithm is compared with other methods. Theoretical and experiment...

The predominance of multicore processors has increased the interest in developing parallel Boolean Satisfiability (SAT) solvers. As a result, more parallel SAT solvers are emerging. Even though parallel approaches are known to boost performance, parallel approaches developed for Boolean optimization are scarce. This paper proposes parallel search algorithms for Boolean optimization and introduc...

Deenitions of a reduct for a single object, decision class and all objects of decision table for the variable precision rough sets model are introduced. The deenitions have a property that the set of prime implicants of minimal disjunctive normal form of a discernibility function is equal to the set of reducts. Thus the problem of reducts maintenance in dynamically extended information systems ...