The paper introduces the notion of state for involutive bisemilattices, a variety which plays role algebraic counterpart paraconsistent weak Kleene logic and whose elements are represented as Plonka sum Boolean algebras. We investigate relations between states over an bisemilattice probability measures (Boolean) algebras in representation and, direct limit these Moreover, we study completition ...

We present a new approach to unbounded, fully symbolic model checking of timed automata that is based on an efficient translation of quantified separation logic to quantified Boolean logic. Our technique preserves the interpretation of clocks over the reals and can check any property in timed computation tree logic. The core operations of eliminating quantifiers over real variables and deciding...

In a previous paper (“Hexagonal Logic of the Field F8 as a Boolean Logic with Three Involutive Modalities”, in The road to Universal Logic), we proved that elements of P(8), i.e. functions of all finite arities on the Galois field F8, are compositions of logical functions of a given Boolean structure, plus three geometrical cross product operations. Here we prove that P(8) admits a purely logic...

Research on quantum computers has gained attention since they are able to solve certain tasks significantly faster than classical machines (in some cases, exponential speed-ups are possible). Since quantum computations typically contain large Boolean components, design automation techniques are required to realize the respective Boolean functions in quantum logic. They usually introduce a signi...

To support FPGA synthesis in the OAGear package, we have implemented the following new components: (i) a cut-based technology mapper for LUT-based FPGA with delay/area optimization options, (ii) an efficient SAT-based Boolean matcher (SAT-BM) for both single-output and multipleoutput Boolean functions, and (iii) an area-aware resynthesis algorithm using this SAT-BM. The SAT-BM incorporates the ...

We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To precisely capture this relationship, we introduce the notion of a preferred stable model of a logic program, and define a mapping that associates a normal logic program with a boolean equation system such that the solution to the equation system can be “read off” ...

Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct ✷φ intuitively expressing that “after every public announcement of a formula, formula φ is true.” The logic APAL is undecidable and it has an infinitary axiomatization. ...

In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko Väänänen by extending modal logic by a the dependence atom dep(·). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using...

The unique complementary switching behaviour of complementary resistive switches (CRSs) makes them very attractive for logic applications. The implementation of complete Boolean logic functions in a single CRS cell is certainly an extremely important step towards the commercialisation of related logic circuits, but it has not been accomplished to date. Here, we report two methods for the implem...