Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard

2006 ◽  
pp. 489-496
Author(s):  
Jesper Torp Kristensen ◽  
Peter Bro Miltersen
Keyword(s):  
Truth Tables

Security of Cyber-Physical Systems: A Generalized Algorithm for Intrusion Detection and Determining Security Robustness of Cyber Physical Systems using Logical Truth Tables

2013 ◽  
Vol 9 ◽  
Author(s):  
Curtis G. Northcutt
Keyword(s):  
Intrusion Detection ◽  
Cyber Security ◽  
Logical Truth ◽  
Cyber Physical Systems ◽  
Security Model ◽  
Security Measures ◽  
Physical Systems ◽  
Multiple Signal ◽  
Security Attack ◽  
Truth Tables

The recent proliferation of embedded cyber components in modern physical systems [1] has generated a variety of new security risks which threaten not only cyberspace, but our physical environment as well. Whereas earlier security threats resided primarily in cyberspace, the increasing marriage of digital technology with mechanical systems in cyber-physical systems (CPS), suggests the need for more advanced generalized CPS security measures. To address this problem, in this paper we consider the first step toward an improved security model: detecting the security attack. Using logical truth tables, we have developed a generalized algorithm for intrusion detection in CPS for systems which can be defined over discrete set of valued states. Additionally, a robustness algorithm is given which determines the level of security of a discrete-valued CPS against varying combinations of multiple signal alterations. These algorithms, when coupled with encryption keys which disallow multiple signal alteration, provide for a generalized security methodology for both cyber-security and cyber-physical systems.

On Validity and the Use of Truth Tables

1969 ◽  
Vol 69 (6) ◽  
pp. 553-560
Author(s):  
Lee E. Boyer
Keyword(s):  
Truth Tables

Network Boolean Equations and Truth Tables

1988 ◽  
Vol 29 (2) ◽  
pp. 42-47
Author(s):  
J K Reddy
Keyword(s):  
Truth Tables

scholarly journals Supporting Information "Quantum logic gates based on DNAtronics, RNAtronics and Proteintronics"

2021 ◽  
Author(s):  
Sheh-Yi Sheu ◽  
Hua-Yi Hsu ◽  
Dah-Yen Yang
Keyword(s):  
Quantum Logic ◽  
Potential Energy Surfaces ◽  
Logic Gates ◽  
Vacuum System ◽  
Transmission Spectra ◽  
Superposition State ◽  
Quantum Logic Gates ◽  
Energy Surfaces ◽  
Double Well Potential ◽  
Truth Tables

This Supporting Information includes the extended description of the superposition state of the asymmetric double-well system in vacuum system and in solution, truth tables for the residue pairs and their corresponding quantum logic gates, and figures for the double well potential energy surfaces and transmission spectra of the residue pairs. Corresponding Authors Email: [email protected] and [email protected]

Universal truth tables and normal forms

1998 ◽  
Vol 6 (2) ◽  
pp. 295-303 ◽  
Author(s):  
I.B. Turksen ◽  
A. Kandel ◽  
Yan-Qing Zhang
Keyword(s):  
Normal Forms ◽  
Universal Truth ◽  
Truth Tables

EPR OF METALLOPROTEINS; TRUTH TABLES REVISITED

1998 ◽  
pp. 346-360 ◽  
Author(s):  
JACK PEISACH
Keyword(s):  
Truth Tables

Many-valued logics, philosophical issues in

2018 ◽  
Author(s):  
Lloyd Humberstone
Keyword(s):  
Free Action ◽  
Borderline Case ◽  
Main Body ◽  
Plane Crash ◽  
Sentential Logic ◽  
The Status ◽  
The Individual ◽  
Element Matrix ◽  
Excluded Middle ◽  
Truth Tables

The first philosophically-motivated use of many-valued truth tables arose with Jan Łukasiewicz in the 1920s. What exercised Łukasiewicz was a worry that the principle of bivalence, ‘every statement is either true or false’, involves an undesirable commitment to fatalism. Should not statements about the future whose eventual truth or falsity depends on the actions of free agents be given some third status – ‘indeterminate’, say – as opposed to being (now) regarded as determinately true or determinately false? To implement this idea in the context of the language of sentential logic (with conjunction, disjunction, implication and negation), we need to show – if the usual style of treatment of such connectives in a bivalent setting is to be followed – how the status of a compound formula is determined by the status of its components. Łukasiewicz’s decision as to how the appropriate three-valued truth-functions should look is recorded in truth tables in which (determinate) truth and falsity are represented by ‘1’ and ‘3’ respectively, with ‘2’ for indeterminacy (see tables in the main body of the entry). Consider the formula A∨B (‘A or B’), for example, when A has the value 2 and B has the value 1. The value of A∨B is 1, reasonably enough, since if A’s eventual truth or falsity depends on how people freely act, but B is determinately true already, then A∨B is already true independently of such free action. There are no constraints as to which values may be assigned to propositional variables. The law of excluded middle is invalidated in the case of indeterminacy: if p is assigned the value 2, then p∨ ¬p also has the value 2. This reflects Łukasiewicz’s idea that such disjunctions as ‘Either I shall die in a plane crash on January 1, 2030 or I shall not die in a plane crash on January 1, 2030’ should not be counted as logical truths, on pain of incurring the fatalistic commitments already alluded to. Together with the choice of designated elements (which play the role in determining validity played by truth in the bivalent setting), Łukasiewicz’s tables constitute a (logical) matrix. An alternative three-element matrix, the 1-Kleene matrix, involves putting 2→2=2, leaving everything else unchanged. And a third such matrix, the 1,2-Kleene matrix, differs from this in taking as designated the set of values {1,2} rather than {1}. The 1-Kleene matrix has been proposed for the semantics of vagueness. In the case of a sentence applying a vague predicate, such as ‘young’, to an individual, the idea is that if the individual is a borderline case of the predicate (not definitely young, and not definitely not young, to use our example) then the value 2 is appropriate, while 1 and 3 are reserved for definite truths and falsehoods, respectively. Łukasiewicz also explored, as a technical curiosity, n-valued tables constructed on the same model, for higher values of n, as well as certain infinitely many-valued tables. Variations on this theme have included acknowledging as many values as there are real numbers, with similar applications to vagueness and approximation in mind.

Decision Trees, Truth Tables

1963 ◽  
Vol 27 (2) ◽  
pp. 120
Author(s):  
C. S. Muije ◽  
John G. Kemeny ◽  
Arthur Schleifer ◽  
J. Laurie Snell ◽  
Gerald L. Thompson
Keyword(s):  
Decision Trees ◽  
Truth Tables
Sign in / Sign up

Export Citation Format

Share Document