We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the “glass-box” approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four ...

Abstract: Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have pro...

This paper suggests a new approach for modeling of Boolean neural networks on fieldprogrammable gate arrays (FPGAs) using UML. The presented Boolean neural networks (BNN) allow a decreasing of the required number of configurable logic blocks (CLB) for the realizing of Boolean neuron. The element of BNN, called Boolean neuron, may be mapped directly to lookup table (LUT) and configurable logic b...

In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean formula has at least one bounded assignment. This allows us to show that satisfying truthvalue assignments of formulas in USAT can be syntactically defined in the language of classical propositional logic. We also discuss a possi...

We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...

In this thesis, we develop a mixed SAT solver for differencelogic (DL) to carry out bounded model checking for timed systems. We defineDL as an extension of propositional Boolean logic with difference constraintsof the form (x-y¡c). We present algorithms to convert formulae in this logic tothe mixed conjunctive normal form, which is appropriate for solving purposes.We examin...

With the development of artificial intelligence, separation memory and processor in traditional von-Neumann architecture has led to bottleneck data transmission hindering energy efficient computing. The computing-in-memory (CIM) paradigm is expected solve problems wall power wall. In this work, we propose a time-domain (TD) computing scheme based on spin transfer torque magnetic random access (...

Finding solution values for unknowns in Boolean equations was a principal reasoning mode in the Algebra of Logic of the 19th century. Schröder investigated it as Auflösungsproblem (solution problem). It is closely related to the modern notion of Boolean unification. Today it is commonly presented in an algebraic setting, but seems potentially useful also in knowledge representation based on pre...