Quiz Nov 21 2005 Logic.

Slides:



Advertisements
Similar presentations
Inference in First-Order Logic
Advertisements

Some Prolog Prolog is a logic programming language
Inference Rules Universal Instantiation Existential Generalization
Models and Propositional Logic In propositional logic, a model in general simply fixes the truth value – true or false – for every proposition symbol.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 20
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Logic.
Quiz Propositional Logic. 1. Let A,B,C be propositions, i.e. they can take values False (F) or True (T). a) How many possible worlds are there.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2004.
ITCS 3153 Artificial Intelligence Lecture 11 Logical Agents Chapter 7 Lecture 11 Logical Agents Chapter 7.
3 Logic Translate the following four English sentences to first order logic (FOL). [4p] 1. Anyone passing his history exams and winning the lottery is.
Knowledge Representation I (Propositional Logic) CSE 473.
Methods of Proof Chapter 7, second half.
Knoweldge Representation & Reasoning
Inference in First-Order Logic
Artificial Intelligence
Quiz Th. March Propositional Logic Learning.
© Patrick Blackburn, Johan Bos & Kristina Striegnitz Horn clauses A literal is an atomic formula or its negation A clause is a disjunction of literals.
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 19, 2012.
Logical Agents Logic Propositional Logic Summary
Logic in AI CSE 573. © Daniel S. Weld 2 Logistics Monday? Reading Ch 8 Ch 9 thru p 278 Section 10.3 Projects Due 11/10 Teams and project plan due by this.
An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati
S P Vimal, Department of CSIS, BITS, Pilani
Logical Agents Chapter 7. Knowledge bases Knowledge base (KB): set of sentences in a formal language Inference: deriving new sentences from the KB. E.g.:
1 Logical Agents Chapter 7. 2 A simple knowledge-based agent The agent must be able to: –Represent states, actions, etc. –Incorporate new percepts –Update.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
1 Logical Inference Algorithms CS 171/271 (Chapter 7, continued) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 15 of 41 Friday 24 September.
1 The Wumpus Game StenchBreeze Stench Gold Breeze StenchBreeze Start  Breeze.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
Reasoning with Propositional Logic automated processing of a simple knowledge base CD.
Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part B Propositional Logic.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
UBC Department of Computer Science Undergraduate Events More
Inference in Propositional Logic (and Intro to SAT) CSE 473.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
CS 416 Artificial Intelligence Lecture 13 First-Order Logic Chapter 9 Lecture 13 First-Order Logic Chapter 9.
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
Logical Agents Chapter 7. Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence,
CS666 AI P. T. Chung Logic Logical Agents Chapter 7.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
EA C461 Artificial Intelligence
Inference in Propositional Logic (and Intro to SAT)
Effective Propositional Logic Search
Computer Science cpsc322, Lecture 20
EA C461 – Artificial Intelligence Logical Agent
Resolution in the Propositional Calculus
Logical Inference: Through Proof to Truth
Problems on Logical Agents
Logical Agents Chapter 7 Selected and slightly modified slides from
CSE 4705 Artificial Intelligence
Artificial Intelligence
!'!!. = pt >pt > \ ___,..___,..
CS 416 Artificial Intelligence
Automated Reasoning in Propositional Logic
Reasoning with the Propositional Calculus
Computer Science cpsc322, Lecture 20
Methods of Proof Chapter 7, second half.
Reasoning with the Propositional Calculus
Quiz Nov Logic.
KNOCKOUT.
Quiz Propositional Logic.
7 pt 7 pt 7 pt 7 pt 7 pt 14 pt 14 pt 14 pt 14 pt 14 pt 21 pt 21 pt
Presentation transcript:

Quiz Nov 21 2005 Logic

Consider the following Knowledge Base: 1) Use forward chaining to prove KB = F 2) Bring the knowledge base in conjunctive normal form. You may use: 3) Is the KB in Horn form? (explain your answer) 4) Proof by resolution that KB = D

Consider the following Knowledge Base: 1) [3pts] Use forward chaining to prove KB = F A and B and C and (A and B and C)  D implies D. D and C and (D and C)  E implies E E and EF implies F 2) [2pts] Bring the knowledge base in conjunctive normal form. 3) [2pts] Is the KB in Horn form? (explain your answer) Yes, all clauses have at most 1 positive literal. 4) [3pts] Proof by resolution that KB = D Proof that KB and not D is unsatisfiable Repeatedly remove literals from clauses: A and (not A and not B and not C and D) implies (not B and not C and D) B and (not B and not C and D) implies (not C and D) C and (not C and D) implies D D and (not D) unsatisfiable