Quiz 11-18-2008 Propositional Logic.

Slides:



Advertisements
Similar presentations
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Advertisements

Models and Propositional Logic In propositional logic, a model in general simply fixes the truth value – true or false – for every proposition symbol.
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.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Logic Use mathematical deduction to derive new knowledge.
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Resolution Theorem Proving
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Logic.
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Mar, 4, 2015 Slide credit: some slides adapted from Stuart.
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.
Resolution in Propositional and First-Order Logic.
Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.
Discussion #18 1/13 Discussion #18 Resolution with Propositional Calculus; Prenex Normal Form.
Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.
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.
CPSC 322, Lecture 21Slide 1 Bottom Up: Soundness and Completeness Computer Science cpsc322, Lecture 21 (Textbook Chpt 5.2) March, 5, 2010.
Knoweldge Representation & Reasoning
Knowledge Representation & Reasoning (Part 1) Propositional Logic chapter 5 Dr Souham Meshoul CAP492.
Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.
Quiz Th. March Propositional Logic Learning.
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
CSM6120 Introduction to Intelligent Systems Propositional and Predicate Logic.
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
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.
CPS 170: Artificial Intelligence Propositional Logic Instructor: Vincent Conitzer.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 19, 2012.
CHAPTERS 7, 8 Oliver Schulte Logical Inference: Through Proof to Truth.
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.
An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati
S P Vimal, Department of CSIS, BITS, Pilani
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
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.:
LDK R Logics for Data and Knowledge Representation Propositional Logic: Reasoning First version by Alessandro Agostini and Fausto Giunchiglia Second version.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
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.
First-Order Logic and Inductive Logic Programming.
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Oct, 30, 2015 Slide credit: some slides adapted from Stuart.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
Reasoning with Propositional Logic automated processing of a simple knowledge base CD.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
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.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
EA C461 Artificial Intelligence
EA C461 – Artificial Intelligence Logical Agent
Resolution in the Propositional Calculus
First-Order Logic and Inductive Logic Programming
Logical Inference: Through Proof to Truth
Problems on Logical Agents
Logics for Data and Knowledge Representation
Logic Use mathematical deduction to derive new knowledge.
Artificial Intelligence
Biointelligence Lab School of Computer Sci. & Eng.
Artificial Intelligence: Agents and Propositional Logic.
CS 416 Artificial Intelligence
Horn Clauses and Unification
Biointelligence Lab School of Computer Sci. & Eng.
Methods of Proof Chapter 7, second half.
Bottom Up: Soundness and Completeness
Quiz Nov Logic.
Artificial Intelligence Propositional Logic
RESOLUTION.
Quiz Nov Logic.
Analogy with Databases
Presentation transcript:

Quiz 11-18-2008 Propositional Logic

1. Let A,B,C be propositions, i. e 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 in this universe of 3 propostions? b) Define the Knowledge Base: . Convert this KB1 to CNF form (conjunctive normal form). c) In which worlds is KB1 true? (provide assignments to A,B,C, e.g. [T,T,T]). d) Consider the query B. In which worlds is B=T? (again provide assignments). e) Can we entail B from KB1? Prove your statement or give a counterexample. f) Consider the Knowledge Base: Prove that B is entailed by the KB2 using resolution. g) Is KB2 in Horn form? all question are worth 2 points

How many possible worlds are there in this universe of 3 propostions  8 b) Define the Knowledge Base: . Convert this KB1 to CNF form (conjunctive normal form).  c) In which worlds is KB1 true? (provide assignments to A,B,C, e.g. [T,T,T]).  {[T,T,T],[F,T,T],[F,F,T]} d) Consider the query B. In which worlds is B=T? (again provide assignments). {[T,T,T],[F,T,T],[T,T,F],[F,T,F]}. Also correct if they if they used included KB1=T AND B=T e) Can we entail B from KB1? Prove your statement or give a counterexample. No, e.g. [F,F,T] is True in the query but not in the KB f) Consider the Knowledge Base: Prove that B is entailed by the KB2 using resolution.  Add not(B) to the KB. Then A cancels with (not(A) and B) to give B which then cancels with not(B) to give the empty clause. There are no solutions, hence unsatisfyable, hence we proved entailment. Is KB2 in Horn form?  Yes, all clauses have at most 1 positive literal