Knowledge Representation

Slides:



Advertisements
Similar presentations
Agenti Intelligenti Agenti Intelligenti Stefania Costantini Dip. Di Informatica, Univ. degli Studi di LAquila.
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
01 -1 Lecture 01 Artificial Intelligence Topics –Introduction –Knowledge representation –Knowledge reasoning –Machine learning –Applications.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
Agenti Intelligenti Agenti Intelligenti Stefania Costantini Dip. Di Informatica, Univ. degli Studi di L’Aquila.
ARTIFICIAL INTELLIGENCE TECHNIQUES Knowledge Processing 1.
1 Knowledge Representation and Reasoning. 2 Knowledge Representation & Reasoning How knowledge about the world can be represented How knowledge about.
Introduction to Logic for Artificial Intelligence Lecture 2 Erik Sandewall 2010.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
November 7, 2012Introduction to Artificial Intelligence Lecture 13: Neural Network Basics 1 Note about Resolution Refutation You have a set of hypotheses.
Introduction to Proofs
Spring 2003CMSC Discrete Structures1 Let’s get started with... Logic !
Discrete Mathematics CS 2610 August 24, Agenda Last class Introduction to predicates and quantifiers This class Nested quantifiers Proofs.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
October 17, 2012Introduction to Artificial Intelligence Lecture 11: Knowledge Representation and Reasoning I 1Semantics In propositional logic, we associate.
Knowledge Processing 1. Aims of session  Introduce types of reasoning  Deterministic  Propositional logic  Predicate logic.
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
2007 D iscrete The foundations C ounting theory N umber theory G raphs & trees structure s
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
Predicates and Quantifiers
March 8, 2016Introduction to Artificial Intelligence Lecture 13: Knowledge Representation & Reasoning II 1Resolution And yet Another Example: Resolving.
Knowledge Representation and Reasoning 2
Chapter 7. Propositional and Predicate Logic
Arguments with Quantified Statements
CSE 311 Foundations of Computing I
Maximum Expected Utility
Applied Discrete Mathematics Week 5: Mathematical Reasoning
ece 627 intelligent web: ontology and beyond
CSE 311: Foundations of Computing
Module #10: Proof Strategies
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Proving Existentials A proof of a statement of the form x P(x) is called an existence proof. If the proof demonstrates how to actually find or construct.
CSE 311 Foundations of Computing I
Quantified Propositions
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Mathematical Reasoning
Week #6 – 30 September / 2/4 October 2002 Prof. Marie desJardins
CSE 4705 Artificial Intelligence
CMSC Discrete Structures
Resolution And yet Another Example:
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
First Order Logic Rosen Lecture 3: Sept 11, 12.
Relational Proofs Computational Logic Lecture 8
Back to “Serious” Topics…
Inference Rules: Tautologies
1 Chapter An Introduction to Problem Solving
MA/CSSE 474 More Math Review Theory of Computation
Applied Discrete Mathematics Week 2: Proofs
Relational Proofs Computational Logic Lecture 7
1 Chapter An Introduction to Problem Solving
Introduction to Logic Lecture 1 What is Critical Reasoning?
Module #10: Proof Strategies
Chapter 7. Propositional and Predicate Logic
Direct Proof and Counterexample I
CSNB234 ARTIFICIAL INTELLIGENCE
September 9, 2004 Prof. Marie desJardins (for Prof. Matt Gaston)
Discrete Mathematics Lecture 4 Logic of Quantified Statements
CPSC 121: Models of Computation
CS201: Data Structures and Discrete Mathematics I
Mathematical Reasoning
Relational Proofs Computational Logic Lecture 7
Relational Proofs Computational Logic Lecture 7
The Foundations: Logic and Proofs
Inference Rules for Quantified Propositions
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Knowledge Representation a) There are no crazy UMB students. x (UMBStudent(x)  Crazy(x)) b) All computer scientists are either rich or crazy, but not both. x (CS(x)  [Rich(x)  Crazy(x)]  [Rich(x)  Crazy(x)] ) c) All UMB students except one are intelligent. x (UMBStudent(x)  Intelligent(x))  x,y (UMBStudent(x)  UMBStudent(y)  Identical(x, y)  Intelligent(x)  Intelligent(y)) d) Jerry and Betty have the same friends. x ([Friends(Betty, x)  Friends(Jerry, x)]  [Friends(Jerry, x)  Friends(Betty, x)]) e) No mouse is bigger than an elephant. x,y (Mouse(x)  Elephant(y)  BiggerThan(x, y)) October 18, 2018 Introduction to Artificial Intelligence Lecture 14: Knowledge Representation & Reasoning III

Rules of Inference x P(x) Universal instantiation __________  P(c) if cU Universal instantiation P(c) for an arbitrary cU ___________________  x P(x) Universal generalization x P(x) ______________________  P(c) for some element cU Existential instantiation P(c) for some element cU ____________________  x P(x) Existential generalization October 18, 2018 Introduction to Artificial Intelligence Lecture 14: Knowledge Representation & Reasoning III

Rules of Inference Example: Every UMB student is a genius. George is a UMB student. Therefore, George is a genius. U(x): “x is a UMB student.” G(x): “x is a genius.” October 18, 2018 Introduction to Artificial Intelligence Lecture 14: Knowledge Representation & Reasoning III

Rules of Inference The following steps are used in the argument: Step 1: x (U(x)  G(x)) Hypothesis Step 2: U(George)  G(George) Univ. instantiation using Step 1 Step 3: U(George) Hypothesis Step 4: G(George) Modus ponens using Steps 2 & 3 x P(x) __________  P(c) if cU Universal instantiation October 18, 2018 Introduction to Artificial Intelligence Lecture 14: Knowledge Representation & Reasoning III