Propositional Calculus – Methods of Proof Predicate Calculus Math Foundations of Computer Science.

Slides:



Advertisements
Similar presentations
Introduction to Theorem Proving
Advertisements

1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Logic Use mathematical deduction to derive new knowledge.
Logic Concepts Lecture Module 11.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
CS128 – Discrete Mathematics for Computer Science
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Logic 3 Tautological Implications and Tautological Equivalences
CSE (c) S. Tanimoto, 2008 Propositional Logic
Discussion #12 1/22 Discussion #12 Deduction, Proofs and Proof Techniques.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Inference and Resolution for Problem Solving
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Knoweldge Representation & Reasoning
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Propositional Calculus Math Foundations of Computer Science.
Adapted from Discrete Math
Methods of Proof & Proof Strategies
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 224 – Discrete Mathematics
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
CS1502 Formal Methods in Computer Science
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Logical Agents Logic Propositional Logic Summary
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
CSE 311 Foundations of Computing I Lecture 7 Logical Inference Autumn 2012 CSE
Propositional calculus
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Extra slides for Chapter 3: Propositional Calculus & Normal Forms Based on Prof. Lila Kari’s slides For CS2209A, 2009 By Dr. Charles Ling;
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Chapter 1: The Foundations: Logic and Proofs
What is Reasoning  Logical reasoning is the process of drawing conclusions from premises using rules of inference.  These inference rules are results.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
1 Section 6.2 Propositional Calculus Propositional calculus is the language of propositions (statements that are true or false). We represent propositions.
Outline Logic Propositional Logic Well formed formula Truth table
CSE 311 Foundations of Computing I Lecture 8 Proofs Autumn 2012 CSE
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Chapter 1 Logic and proofs
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
Advanced Algorithms Analysis and Design
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Discussion #10 Logical Equivalences
Proposition & Predicates
Propositional Calculus: Boolean Algebra and Simplification
Elementary Metamathematics
Propositional Equivalences
CSE 311 Foundations of Computing I
CS201: Data Structures and Discrete Mathematics I
Logic Use mathematical deduction to derive new knowledge.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Propositional Equivalences
CS 416 Artificial Intelligence
Computer Security: Art and Science, 2nd Edition
Foundations of Discrete Mathematics
RESOLUTION.
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Propositional Calculus – Methods of Proof Predicate Calculus Math Foundations of Computer Science

2 Propositional Calculus – Methods of Proof  Logic is useful in design theory  Also useful in reasoning about mathematical statements:  Case Analysis  Proof of the contrapositive  Proof by contradiction  Proof by reduction to truth

Law of Excluded Middle   Handy for Case Analysis:  Can now prove

Dual of the Excluded Middle  A proposition and its negative can’t be simultaneously true  Does this jive with the real world?  Do we have contradictions in mathematics?  Handy for proofs by Contradiction

Contrapositive  Example: Prove “If x is greater than 2 and prime, then x is odd”  The contrapositive is: “If x is even, then x <= 2 or x is composite”  Propositional logic fails at this point; we need to talk about the meaning of our terms

6 Contradiction  Rather than proving E, we assume NOT E, and look for a contradiction  Example (from previous slide)  We want to prove ab → c (cont.) ax > 2 bx is prime cx is odd

Contradiction - example  So, as assume a b and NOT c  Derive a contradiction

Equivalence by Truth (p ≡ 1) ≡ p  Use the tautologies to reduce the expression to 1  Probably most like the examples we’ve been looking at

9 Deduction  The use of logic in sequences of statements that constitute a complete proof  Start with certain hypotheses (“givens”)  Apply a sequence of inference rules  Results in a conclusion  Most familiar to you, from geometry

Deduction  Given expressions E 1, E 2, …, E k as hypotheses, we wish to draw conclusion E, another logical expression  Generally, none of these is a tautology  Show that E 1 ∩ E 2 ∩ … ∩ E k → E is a tautology

Deduction – guidelines  Any tautology may be a line in a proof  modus ponens – if E and E→F are lines, then F may be added as a line  If E and F are lines in a proof, then we may add the line E ∩ F  If E and E ≡ F are lines, the F can be added

Resolution – a handy inference rule  Based on this tautology:  Just another inference rule  But a common one  Often used in a deductive proof

Resolution  Applied to clauses (your hypotheses) (as in deduction)  Convert hypotheses into clauses (conjunctive normal form)  Write each clause as a line  Use resolution to write other lines

Simplifying clauses  Consider a clause as a set of literals  Given commutativity, associativity and idempotence of OR  Remove duplicate literals:

Simplifying clauses  Eliminate clauses that have contradictory literals  , by the annihilator law of OR  These clauses are equivalent to 1, and are not needed in a proof

Resolution - example  Given these 2 clauses:  Rearrange terms, and apply resolution  Remove duplicates

Put Expressions into Conjunctive Normal Form 1.Get rid of all operators but NOT, AND, and OR  NAND and NOR are easily replaced with AND and OR followed by a NOT 2.Apply DeMorgan’s laws to push negations down as far as they will go

Put Expressions into Conjunctive Normal Form 3.Apply distributive law for OR over AND  Push the ORs as low as they’ll go  E.g.  Replace the implication  Push that outer NOT down:

CNF – Example (cont.)  Push the first OR below the first AND  Regroup  Push that OR down over the inner AND  And now you have an expression in CNF

Resolution Proofs by Contradiction  A more common use  Start with both the hypotheses, and the negation of the conclusion  Try to drive a clause w/no literals  This clause has value 0