Tutorial - Propositional Logic

Slides:



Advertisements
Similar presentations
Resolution Proof System for First Order Logic
Advertisements

Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
We have seen that we can use Generalized Modus Ponens (GMP) combined with search to see if a fact is entailed from a Knowledge Base. Unfortunately, there.
Logic Use mathematical deduction to derive new knowledge.
Lab 2 - CA Chapter 1 Section 1.5
Propositional Logic Russell and Norvig: Chapter 6 Chapter 7, Sections 7.1—7.4 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/home.htm.
Logic Concepts Lecture Module 11.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
CSE (c) S. Tanimoto, 2008 Propositional Logic
Logic in Computer Science Transparency No Chapter 3 Propositional Logic 3.6. Propositional Resolution.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering A Hole in Goal Trees Notes for: D.W. Loveland and M. Stickel. “A Hole in Goal.
Knoweldge Representation & Reasoning
Chapter 3 Propositional Logic
Prop logic First order predicate logic (FOPC) Prob. Prop. logic Objects, relations Degree of belief First order Prob. logic Objects, relations.
SAT Solver Math Foundations of Computer Science. 2 Boolean Expressions  A Boolean expression is a Boolean function  Any Boolean function can be written.
Discrete Mathematics and Its Applications
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Propositional Equivalences
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
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.
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
Unification Algorithm Input: a finite set Σ of simple expressions Output: a mgu for Σ (if Σ is unifiable) 1. Set k = 0 and  0 = . 2. If Σ  k is a singleton,
Propositional Calculus – Methods of Proof Predicate Calculus Math Foundations of Computer Science.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
LECTURE LECTURE Propositional Logic Syntax 1 Source: MIT OpenCourseWare.
1 The Wumpus Game StenchBreeze Stench Gold Breeze StenchBreeze Start  Breeze.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9- Completeness proof; introducing knowledge representation.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Hamiltonian Cycles Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
Knowledge Repn. & Reasoning Lecture #9: Propositional Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2005.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 04 : Logic.
Chapter 1 Propositional Logic
Chapter 7. Propositional and Predicate Logic
Inference in Propositional Logic (and Intro to SAT)
Lecture 1 – Formal Logic.
Knowledge Representation and Reasoning
Propositional Logic Session 3
ARTIFICIAL INTELLIGENCE
Proposition & Predicates
Tutorial – First Order (Predicate) Logic
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Context-free Languages
CS201: Data Structures and Discrete Mathematics I
Logic Use mathematical deduction to derive new knowledge.
CS 270 Math Foundations of CS
Biointelligence Lab School of Computer Sci. & Eng.
Propositional Equivalences
Resolution And yet Another Example:
CS 220: Discrete Structures and their Applications
Propositional Logic.
Back to “Serious” Topics…
Conditional Logic Presentation Name Course Name
Automated Reasoning in Propositional Logic
MAT 3100 Introduction to Proof
Chapter 7. Propositional and Predicate Logic
Foundations of Discrete Mathematics
Scalability in Model Checking
ece 720 intelligent web: ontology and beyond
CS201: Data Structures and Discrete Mathematics I
Tutorial - 1 Course: CS60045 Pallab Dasgupta Professor,
Tutorial - 2 Course: CS60045 Pallab Dasgupta Professor,
Presentation transcript:

Tutorial - Propositional Logic Foundations of Computing Science Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

Questions 1. Express the following statements as propositional logic formulae. (a) Fido is always either sleeping or barking. (b) When Fido is hungry Fido barks, but Fido’s barking does not necessarily mean that Fido is hungry. 2. According to political experts “A person who is a radical(R) is elected (E) if (s)he is conservative (C), but otherwise is not elected. Which of the following are correct representations of this assertion and why? (R ∧ E ) ⇔ C R ⇒ (E ⇔ C) R ⇒ ((C ⇒ E) ∨ ¬E ) INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

Questions 3. Which of the following sentences are valid, unsatisfiable, or neither. Smoke ⇒ Smoke Smoke ⇒ Fire Smoke ∨ Fire ∨ ¬ Fire (Smoke ⇒ Fire) ⇒ (¬Smoke ⇒ ¬Fire) (Smoke ⇒ Fire) ⇒ (Smoke ∧ Heat ⇒ Fire) 4. Prove whether or not the following rule of inference is sound: (P ⇒ Q, ¬Q ) / ¬P 5. Convert the sentence A ⇔ (B ∨ E) to CNF, where your answer will be one or more “clauses”. Using the clauses obtained, and the clauses: (¬E ∨ D), (¬C ∨ ¬F ∨ ¬B), (¬E ∨ B ), (¬B ∨ F ), (¬B ∨ C), determine if ¬B is true using resolution refutation. Show the proof tree. INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

Questions 6. Consider the following hypotheses: If it rains, Joe brings his umbrella If Joe has an umbrella, he doesn’t get wet. If it doesn’t rain, Joe doesn’t get wet. Prove that Joe never gets wet. INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

Questions 7. Let the propositions have intuitive meanings as given here: Encode the following ideas as clauses or product of clauses: If test T is positive, then that person has blood type A or AB. If test S is positive, then that person has blood type B or AB. If a person has type A, then test T will be positive. If a person has type B, then test S will be positive. If a person has type AB, then both tests T and S will be positive. A person has type A, B, AB, or O blood. Props. Meaning a A person has blood type A. b A person has blood type B. c A person has blood type AB. o A person has blood type O. t Test T is positive on a person’s blood sample. s Test S is positive on a person’s blood sample. INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR