MULTI-valued logic.

Slides:



Advertisements
Similar presentations
The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.
Advertisements

Test practice Multiplication. Multiplication 9x2.
Normal Programs with Cardinality Constraints C = L {a 1,..., a n, not b 1,..., not b m } U L lower bound, U upper bound (missing L: 0, missing U: n+m)
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
Symbolic Logic: Conjunction • , Negation ~, Disjunction v
Key Words for Inequalities
A Quick Look at Quantified Statements. Why are Quantified Statements Important? The logical structure of quantified statements provides a basis for the.
Universal Gates Sum of Products Products of Sum
1 Confidence Interval for a Mean. 2 Given A random sample of size n from a Normal population or a non Normal population where n is sufficiently large.
Software Testing and Quality Assurance
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
1.2 – Open Sentences and Graphs
Spawning Ground Survey Database Quality Assurance and Quality Control.
Information and Programs. Foundations of Computing Information –Binary numbers –Integers and Floating Point –Booleans (True, False) –Characters –Variables.
Do Now: Factor x2 – 196 4x2 + 38x x2 – 36 (x + 14)(x – 14)
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Algebra Properties of Real Numbers
BR 1/991 Two ways to think about logic signals Fixed logic convention –High voltage always means 1, TRUE, Asserted –Low voltage always means 0, FALSE,
1.4 Solving Equations ●A variable is a letter which represents an unknown number. Any letter can be used as a variable. ●An algebraic expression contains.
D. Multiple Alleles – Instead of having two forms of an allele, there are more than two for one gene. i. The best example for humans is blood. There 3.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
1. 3 x = x 3 2. K + 0 = K (3 + r) = (12 + 3) + r 4. 7 (3 + n) = n Name the Property Commutative of Multiplication Identity of Addition.
Decision-Theoretic Views on Switching Between Superiority and Non-Inferiority Testing. Peter Westfall Director, Center for Advanced Analytics and Business.
 When a conditional and its converse are both true, we combine them to make a biconditional.  Example:  Biconditional – An angle is right if and only.
Solving by Substitution Method or Elimination (Addition) Method
7-4: Triangle Inequality Theorem. Theorem 7-9 (Triangle Inequality Theorem): The sum of the measures of any two sides of a triangle is greater than the.
Karyotype Notes. A karyotype is a “ picture ” of a person ’ s chromosomes. Each person has 46 chromosomes, in 23 pairs. Pairs 1-22 are called Autosomes.
FORM VALIDATION (Java Script ). Required Fields A required field in a form is a field that MUST have at least some content before the form will be processed.
Properties Objective: To use the properties of numbers. Do Now 1.) = 3.) ( 2  1 )  4 = 2.) =4.) 2  ( 1  4 ) =
Sum of Arithmetic Sequences. Definitions Sequence Series.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Multiplication Find the missing value x __ = 32.
Comparative Relational Thinking
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Computer Architecture & Operations I
Computer Architecture & Operations I
Autosomal & Sex-Linked Pedigrees
Sex determination and Sex-linked traits
Logic Gates and Boolean Algebra
Logic Gates.
Computer Science 210 Computer Organization
Commutative and Associative Properties
Introduction to Programming for Mechanical Engineers (ME 319)
Comparative Relational Thinking
Karyotypes Objective: Learn and Identify characteristics of Karyotypes
For each pair of polynomials, find the least common multiple. Example For each pair of polynomials, find the least common multiple.
How do you compare and use the properties of real numbers?
Properties of Addition and Multiplication
Consider corner pt. feasible A, B, C, D, E, F A: (0,0), Z = 0
Factors, multiple, primes: Factors from prime factors
Prime, Composite, FACTORS, and Multiples
Fraction Investigation
Bits and Bytes Boolean algebra Expressing in C
Set includes rational numbers and irrational numbers.
Least Common Multiples
Elementary Statistics: Picturing The World
Computer Science 210 Computer Organization
PROOF BY CONTRADICTION
Factors, multiple, primes: Prime factors
Three Special Structures – Case, Do While, and Do Until
Algebra: Variables and Expressions
Inductive Reasoning and Conjecture, and Logic
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
XOR Function Logic Symbol  Description  Truth Table 
Algebra: Variables and Expressions
1C-1D, 1F Number Sets 7A-7C Sets and Interval Notation
A3 2.1d To Solve Compound Inequalities
Factors, multiple, primes: Multiples
1. What animal 2. Male or Female ? 4. Male or Female? Why? Why?
Variables.
Presentation transcript:

MULTI-valued logic

a | b a & b

a | b -– true if a or b true or missing a & b – true if a and b true or missing

assert ~mi(a) assert ~mi(b) gen byte c = a | b

gen byte c = a | b if ~mi(a) & ~mi(b)

a|b -- true if either a or b is true, regardless of what the other is a&b -- false if either a or b is false, regardless of what the other is

Three-valued logic or 1 . and 1 . a not a 1 .

Three-valued logic, Liberal protocol or 1 . and 1 . a not a 1 .

Three-valued logic, Draconian protocol or 1 . and 1 . a not a 1 .

1 | . 0 | . 1 & . 0 & .

a|b -- true if either a or b is true, regardless of what the other is a&b -- false if either a or b is false, regardless of what the other is

1 | . 0 | . 1 & . 0 & .

Draconian: .b Unknown: .u Liberal: .v

(1 | .u) & .v = 1 (1 | .u) & .u = .u (1 | .b) & .U = .b

Or And Not | 1 .u .v .b & 1 .u .v .b a ~a 1 .u .v .b

At least one child is female: f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 Every child is female: f1 & f2 & f3 & f4 & f5 & f6 & f7 & f8 At least one child is male: ~f1 | ~f2 | ~f3 | ~f4 | ~f5 | ~f6 | ~f7 | ~f8 Every child is male: ~f1 & ~f2 & ~f3 & ~f4 & ~f5 & ~f6 & ~f7 & ~f8

3 + . 7 + . 0 * . 12 / . sum(4, 17, 30, 12, .) mean(4, 17, 30, 12, .)

3 + .v = 3 3 + .b = .b Mean((4, 17, 30, 12, .u) = .u Mean((4, 17, 30, 12, .v) = 15.75 Mean((4, 17, 30, 12, .b) = .b

0 * .u = 0 12 / .u = .b

(12 + 3 + .v) * 2 = 30 (12 + 3 + .v) * .u = .u ((7 + .v) * 2 – 14) * .u = 0

.b .u Normal values .v

Multiplication Or And .b .u All other numbers .v .b 1 .u .v .b .u 1 .v

Sup n Sup n-1 … Sup 2 Sup 1 Normal values Inf 1 Inf 2 Inf k