نتایج جستجو برای: support methods boolean logic
تعداد نتایج: 2540641 فیلتر نتایج به سال:
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduction of memory occupation with respect to traditional ROBDDs by decomposing logic functions recursively into simpler and more sharable blocks. The representation is less sensitive to variable ordering, and because of t...
where (~xn) ∈ B and B is a Boolean algebra. Only finite Boolean algebras are considered. The Boolean logic presented is based on the abstract Boolean algebra given by Huntington’s [14] postulates and on a special canonical form for a Boolean function given by Archie Blake [2]. The theory of reasoning is divided into functional and general parts, both of which seek antecedents or consequents of ...
In this paper we propose a high-speed hybrid ThresholdBoolean logic style suitable for Boolean symmetric functions implementation. First, we present a depth-2 hybrid implementation scheme for arbitrary symmetric Boolean functions, based on differential Threshold logic gates as circuit style. Finally, we present the hybrid logic design of a counter. The simulation results, suggest that the hybri...
In last decades, the skillful planning of land resources has become a major issue for rural development. The development of cultivated areas becomes gradually impossible due to ever increasing population growth and urban development. Fuzzy logic is preferred to Boolean logic for land evaluation, because fuzzy techniques lead to estimate for land use suitability on a continuous scale and can the...
In several design methods for Pass-transistor Logic (PTL) circuits, Boolean functions are expressed as OBDDs in decomposed form and then the component OBDDs are directly mapped to PTL cells. The total size of OBDDs (number of nodes) corresponds to the circuit size. In this paper, we investigate a method for PTL synthesis based on exact minimization of Free BDDs (FBDDs). FBDDs are well-studied e...
Abstract: Noise-based logic, by utilizing its multidimensional logic hyperspace, has significant potential for low-power parallel operations in beyond-Moore-chips. However universal gates for Boolean logic thus far had to rely on either time averaging to distinguish signals from each other or, alternatively, on squeezed logic signals, where the logic-high was represented by a random process and...
Developments in solving equations over Boolean algebras and their applications are as old as George Boole’s monograph [1], while Shannon pioneered applications of Boolean logic to switching circuits. Boolean equations and their solutions are of central importance to many problems across Sciences such as Chemistry, Biology or Medicine while traditionally Boolean problems arise in domains such as...
Biological sequence alignment is one of the crucial tasks of computational bioinformatics, and provides base for other tasks of bioinformatics. In this paper, we discuss two different approaches to sequence matching – Boolean algebra and fuzzy logic. First method is a two-valued logic whereas the second is a multi-valued logic. Both the methods perform sequence matching by direct comparison met...
The famous double negation translation [16, 17] establishes an embedding of classical into intuitionistic logic. Curiously, the reverse direction has not been covered in literature. Utilizing a normal form for logic [20], we establish small model property propositional We use this direct encoding Kripke semantics and quantified Boolean formulae. Next, transfer developed techniques to first orde...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید