This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ents Example 2: “It is not sunny this afternoon and it is colder than yesterday.” “We will go swimming only if it is sunny.” “If we do not go swimming, then we will take a canoe trip.” “If we take a canoe trip, then we will be home by sunset.” ༉ Using the inference rules, construct a valid argument for the conclusion: “We will be home by sunset.” 1. Choose propositional variables: p: “It is sunny this afternoon.” q: “It is colder than yesterday.” r: “We will go swimming.” s: “We will take a canoe trip.” t: “We will be home by sunset.” 2. Translation into PL: Valid Arguments 3. Construct a Valid Arg: Handling Quan$ﬁed Statements ༉ Valid arguments for quantiﬁed statements are a sequence of statements. Each statement is either a premise or follows from previous statements by rules of inference which include: ༉ Rules of Inference for Propositional Logic ༉ Rules of Inference for Quantiﬁed Statements ༉ The rules of inference for quantiﬁed statements are introduced in the next several slides. Universal Instan$a$on (UI) Example: Our domain consists of all dogs and c: Fido is a dog. “All dogs are cuddly.” “Therefore, Fido is cuddly.” Universal Generaliza$on (UG) Example: “Fido is cuddly.” “Therefore, all dogs are cuddly.” Existen$al Instan$a$on (EI)...
View
Full
Document
This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.
 Spring '14
 M.Nojoumian
 Computer Science

Click to edit the document details