Results 1  10
of
2,439
From Binary Logic Functions to Fuzzy Logic Functions
, 2013
"... Abstract It is known that any binary logic function (in binary logic) can be represented by at least one logic formula, however this is not always true for a ternary logic function (in ternary logic). A ternary logic function can be represented by at least one logic formula if and only if it satisf ..."
Abstract
 Add to MetaCart
Abstract It is known that any binary logic function (in binary logic) can be represented by at least one logic formula, however this is not always true for a ternary logic function (in ternary logic). A ternary logic function can be represented by at least one logic formula if and only
From Cognitive Binary Logic to Cognitive Intelligent Agents
 Intelligent Engineering Systems (INES), 2010 14th International Conference on
, 2010
"... AbstractThe relation between self awareness and intelligence is an open problem these days. Despite the fact that self awarness is usually related to Emotional Intelligence, this is not the case here. The problem described in this paper is how to model an agent which knows (Cognitive) Binary Logic ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Logic and which is also able to pass (without any mistake) a certain family of Turing Tests designed to verify its knowledge and its discourse about the modal states of truth corresponding to wellformed formulae within the language of Propositional Binary Logic.
Binary Logics, Orthologics and their Relations to Normal Modal Logics
 Advances in Modal Logic
"... this paper. The modal language ML consists of:(1) a set of propositional variables fq 1 ; q 2 ; : : :g, (2) a propositional constant ?, (3) conjunction ^, (4) negation :, (5) necessity 2, and (6) a pair of parentheses (; ). The set of formulas of this language is denoted by . The smallest normal mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
modal logic is denoted by K. For a set of formulas the smallest normal modal logic that contains is denoted by K. For a modal logic M, the class of all normal modal logics above M is denoted by Next(M)
A Binary Logic Path Technique for CMOS Circuit Design
"... Abstract: This paper describes a technique for CMOS VLSI circuit design based on the binary logic path concept for an arbitrary digital function. Paths of logic‘1 ’ are realized by PMOS elements while paths of logic‘0 ’ by NMOS elements. The circuit operation is achieved by the binary logic paths ..."
Abstract
 Add to MetaCart
Abstract: This paper describes a technique for CMOS VLSI circuit design based on the binary logic path concept for an arbitrary digital function. Paths of logic‘1 ’ are realized by PMOS elements while paths of logic‘0 ’ by NMOS elements. The circuit operation is achieved by the binary logic
Cognitive Binary Logic  The Natural Unified Formal Theory
 of Propositional Binary Logic, accepted in The 4th European Computing Conference (ECC 2010
"... ar ..."
15 Binary Logics, Orthologics and their Relations to Normal Modal Logics Yutaka Miyazaki
"... abstract. We study the relation between the class Ext(O) of orthologics and the class Next(KTB) of normal modal logics over KTB by means of embeddings of logics. First we introduce binary logics, which are generalizations of orthologics, as logics that are embeddable into some normal modal logics. W ..."
Abstract
 Add to MetaCart
abstract. We study the relation between the class Ext(O) of orthologics and the class Next(KTB) of normal modal logics over KTB by means of embeddings of logics. First we introduce binary logics, which are generalizations of orthologics, as logics that are embeddable into some normal modal logics
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Limits to Binary Logic Switch Scaling–A Gedanken Model
 Proc. of the IEEE
, 1934
"... In this paper we consider device scaling and speed limitations on irreversible von Neumann computing that are derived from the requirement of “least energy computation. ” We consider computational systems whose material realizations utilize electrons and energy barriers to represent and manipulate t ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
nanowires, etc. This paper addresses the question of the minimum size of any irreversible logic device that represents discrete binary logic states based on
DICTIONARY OPTIMIZATION IN FAULT ANALYSIS APPLYING BINARY LOGICAL MANIPULATION ALGORITHM
"... This paper presents fault dictionary optimization technique which uses binary logical manipulation algorithm. It uses brute force to find optimal testing conditions. Since the optimisation technique handles only numbers, it can be applied in all fault dictionary based techniques. Optimization method ..."
Abstract
 Add to MetaCart
This paper presents fault dictionary optimization technique which uses binary logical manipulation algorithm. It uses brute force to find optimal testing conditions. Since the optimisation technique handles only numbers, it can be applied in all fault dictionary based techniques. Optimization
Results 1  10
of
2,439