A first order four-valued logic, called DDT, is presented in the paper as an extension of Belnap’s logic using a weak negation and establishing an appropriate semantic for the predicate calculus. The logic uses a simple algebraic structure, that is the smallest non trivial interlaced bilattice on the four truth values, thus resulting in a boolean algebra on the set of truth values. The logic is...

Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...

The advent of increasingly dense and fast Very Large Scale Integrated (VLSI) circuits allows for the design of larger and more sophisticated digital logic circuits. Efficient logic representations are necessary for the synthesis, testing and verification of these circuits. This thesis introduces a new logic representation, called the Free Boolean Diagram (FBD). This representation can be manipu...

Abstract We present here some Boolean connexive logics (BCLs) that are intended to be counterparts of selected Epstein’s content relationship (CRLs). The main motivation for analyzing such is explain the notion connexivity by means relationship. article consists two parts. In first one, we focus on syntactic analysis axiomatic systems. starting point our considerations will smallest BCL and CRL...