The Dempster-Shafer theory of belief functions is an important approach to deal with uncertainty in AI. In the theory, belief functions are defined on Boolean algebras of events. In many applications of belief functions in real world problems, however, the objects that we manipulate is no more a Boolean algebra but a distributive lattice. In this paper, we extend the Dempster-Shafer theory to t...

In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in a Boolean circuit computing a Boolean function f is called the inversion complexity of f . In 1958, Markov determined the inversion complexity of every Boolean function and particularly proved that ⌈log 2 (n + 1)⌉ NO...

This paper considers Boolean formulae and their simulations by bounded width branching programs. It is shown that every balanced Boolean formula of size s can be simulated by a constant width (width 5) branching program of length s 1.81 l.... A lower bound for the translational cost from formulae to permutation branching programs is also presented. Key words, branching programs, Boolean formula...

We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as directed graphs, we further reveal a connection between Boolean matrix roots and graph isomorphism, which leads to a proof that for a certain subclass of Boolean matrices related to subdivision digraphs, root finding is of the same ...

In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each independence, and hence, generalized cumulants are equal to the usual cumulants in commutative, free and Boolean cases. The way we define (generalized) cumulants ...

Heribert Vollmer : Boolean functions and Post’s lattice with applications to complexity theory. A Boolean functions f can be obtained from a set B of Boolean functions by superposition, if f can be written as a nested composition of functions from B. In the 1940’s, Emil Post determined the complete list of all sets of Boolean functions closed under superposition, and for each of them, he constr...

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

The functor taking global elements of Boolean algebras in the topos ShB of sheaves on a complete Boolean algebra B is shown to preserve and reflect injectivity as well as completeness. This is then used to derive a result of Bell on the Boolean Ultrafilter Theorem in B-valued set theory and to prove that (i) the category of complete Boolean algebras and complete homomorphisms has no non-trivial...

We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boolean algebras of sets, this is a new generalization of Boole’s well-known variable elimination method for conjunctions of Boolean equality constraints. We also explain the connection of this new logical result with the evaluati...

We exhibit links between pseudo-Boolean optimization, graph theory and logic. We show the equivalence of maximizing a pseudo-Boolean function and finding a maximum weight stable set; symmetrically minimizing a pseudo-Boolean function is shown to be equivalent to solving a weighted satisfiability problem.