Consider a family of boolean circuits C~, C2,..., C,,..., constructed by some uniform, effective procedure operating on input n. Such a procedure provides a concise representation of a family of parallel algorithms for computing boolean values. A formula of first-order logic may also be viewed as a concise representation of a family of parallel algorithms for evaluating boolean functions. The p...

Recently, special attention has been paid to artificial groundwater recharge in water resource management in arid and semi-arid regions. Water resources distribution in these regions is extremely uneven, both in spatial and temporal forms and groundwater is the only water resource and is a major constraint on economic and social development. Artificial groundwater recharge is considered an appr...

The automatic verification of computer programs is an important step in software engineering. In this regard temporal logics have been invented as an extension of modal logic which itself is an extension of propositional logic. Therefore, one may call them modal logic variants. The first part of this thesis will investigate the two temporal logics CTL and CTL? with respect to their model checki...

A long-standing goal of computer technology is to process and store digital information with the same device in order to implement new architectures. One way to accomplish this is to use nanomagnetic logic gates that can perform Boolean operations and then store the output data in the magnetization states of nanomagnets, thereby doubling as both logic and memory. Unfortunately, many of these na...

We present an updated and improved version of our syntactic analysis query toolkit, dep search, geared towards morphologically rich languages and large parsebanks. The query language supports complex searches on dependency graphs, including for example boolean logic and nested queries. Improvements we present here include better data indexing, especially better database backend and document met...

Multi-Domain Logic (MDL) is a generalization of signed logic, in which every variable has its own domain. This aspect increases the efficiency of direct solving of MDL satisfiability, because the solving process proceeds by reducing the size of the domains (contradiction appears as an empty domain). In contrast to the usual approach of translating signed logic satisfiability into boolean satisf...

The minimum number of NOT gates in a logic circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that ⌈log 2 (d(f)+ 1)⌉ NOT gates are necessary and sufficient to compute any Boolean function f (where d(f) is the maximum number of value changes from greater to smaller...

By a strong conceptual completeness (XC) statement for a logical doctrine we mean an assertion that says that any theory of the doctrine can be recovered from an appropriate structure formed by the models of the theory. The expression ‘logical doctrine’ is used here as in [9] to mean a specific selection of logical operations giving rise to a notion of theory, in the form of a structured catego...

Boolean comparison is a design verification technique in which two logic networks are compared for functional equivalence using analysis rather than simulation. Boolean comparison was used on the IBM 3081 project to establish that hardwareflowcharts and the detailed hardware logic design were functionally equivalent. Hardware flowcharts are a graphic form of a hardware description language whic...

In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system ...