1 Knowledge Based Systems (CM0377) Introductory lecture (Last revised 28th January 2002)

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Some Prolog Prolog is a logic programming language
Inference Rules Universal Instantiation Existential Generalization
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Rulebase Expert System and Uncertainty. Rule-based ES Rules as a knowledge representation technique Type of rules :- relation, recommendation, directive,
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
Converting formulas into a normal form Consider the following FOL formula stating that a brick is an object which is on another object which is not a pyramid,
Knowledge Representation CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
1 Knowledge Based Systems (CM0377) Lecture 8 (Last modified 5th March 2001)
CS 484 – Artificial Intelligence1 Announcements Choose Research Topic by today Project 1 is due Thursday, October 11 Midterm is Thursday, October 18 Book.
Inferences The Reasoning Power of Expert Systems.
Knowledge Representation and Reasoning (KR): A vibrant subfield of AI Jia You.
LING 388: Language and Computers Sandiway Fong Lecture 2: 8/24.
Intelligent systems Lecture 6 Rules, Semantic nets.
Cs774 (Prasad)L7Negation1 Negation by Failure
Propositional Calculus A propositional calculus formula is composed of atomic propositions, which area simply statements that are either true or false.
For Friday Read “lectures” 1-5 of Learn Prolog Now: prolog-now/
Artificial Intelligence Lecture No. 16
Chapter 12: Expert Systems Design Examples
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Section.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.5 [P]: Propositions and Inference Sections.
1 Reasoning in Uncertain Situations 8a 8.0Introduction 8.1Logic-Based Abductive Inference 8.2Abduction: Alternatives to Logic 8.3The Stochastic Approach.
Lecture of 11/13 Resolution theorem proving (end) Propositional Probabilistic Logic (start) Announcements: 1. Homework 4 socket closed; Due next week 2.
1 Pertemuan 6 RULE-BASED SYSTEMS Matakuliah: H0383/Sistem Berbasis Pengetahuan Tahun: 2005 Versi: 1/0.
1 Chapter 9 Rules and Expert Systems. 2 Chapter 9 Contents (1) l Rules for Knowledge Representation l Rule Based Production Systems l Forward Chaining.
ARTIFICIAL INTELLIGENCE TECHNIQUES Knowledge Processing 1.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
EXPERT SYSTEMS Part I.
Sepandar Sepehr McMaster University November 2008
NONMONOTONIC LOGIC AHMED SALMAN MALIK. OVERVIEW Monotonic Logic Nonmonotonic Logic Usage and Applications Comparison with other forms of logic Related.
1 Backward-Chaining Rule-Based Systems Elnaz Nouri December 2007.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
1 Knowledge Based Systems (CM0377) Lecture 12 (Last modified 2nd May 2002)
1 Knowledge Based Systems (CM0377) Lecture 13 (Last modified 2nd May 2002)
Knowledge based Humans use heuristics a great deal in their problem solving. Of course, if the heuristic does fail, it is necessary for the problem solver.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Chapter 9: Rules and Expert Systems Lora Streeter.
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
For Wednesday Read “lectures” 7-10 of Learn Prolog Now Chapter 9, exs 4 and 6. –6 must be in Horn clause form Prolog Handout 2.
Soft Computing Lecture 19 Part 2 Hybrid Intelligent Systems.
CSE 311 Foundations of Computing I Lecture 7 Logical Inference Autumn 2012 CSE
The AI War LISP and Prolog Basic Concepts of Logic Programming
Knowledge Processing 1. Aims of session  Introduce types of reasoning  Deterministic  Propositional logic  Predicate logic.
KNOWLEDGE BASED SYSTEMS
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
1 Knowledge Based Systems (CM0377) Lecture 10 (Last modified 19th March 2001)
Chapter 4: Inference Techniques
Propositions and Arguments. What is a proposition? A proposition is a predicative sentence that only contains a subject and a predicate S is P.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
For Friday No reading Prolog Handout 2. Homework.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
Types and Programming Languages Lecture 3 Simon Gay Department of Computing Science University of Glasgow 2006/07.
Common Sense Inference Let’s distinguish between: Mathematical inference about common sense situations Example: Formalize theory of behavior of liquids.
Artificial Intelligence: Applications
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Knowledge Representation Lecture 2 out of 5. Last Week Intelligence needs knowledge We need to represent this knowledge in a way a computer can process.
Knowledge Based Systems
CHAPTER 5 Handling Uncertainty BIC 3337 EXPERT SYSTEM.
Chapter 7. Propositional and Predicate Logic
Methods of Inference 2 Session 6
Chapter 9. Rules and Expert Systems
For Friday No reading Prolog handout 3 Chapter 9, exercises 9-11.
For Wednesday Read “lectures” 7-10 of Learn Prolog Now:
CSE 311 Foundations of Computing I
Induction and deduction are used together in research reasoning
Chapter 7. Propositional and Predicate Logic
Chapter 9. Rules and Expert Systems
Chapter 2: Prolog (Introduction and Basic Concepts)
Presentation transcript:

1 Knowledge Based Systems (CM0377) Introductory lecture (Last revised 28th January 2002)

2 What is knowledge? knowledge n. knowing; what is known (of person, thing, fact or subject); sum of what is known to mankind...; person’s range of information. (Pocket Oxford Dictionary, 7th edition)

3 KBS Information Databases? Reasoning Classical logic Other logics Logic programming Expert Systems Some areas of KBS

4 Wouldn’t it be nice if we could ask a computer questions? Who is Jim’s father? How should I fix my car? Is the moon made of cheese? Do demo of Prolog program here

5 Prolog: PROgramming in LOGic What kind of logic? How can logic programming be made efficient? What are the limitations of such a system?

6 Classical logic (First order predicate logic) “If someone male is a parent of someone else, he is that person’s father” father_of(X,Y):-male(X),parent(X,Y). “Every person has a mother or a creator” (Prolog can’t express this fully: later on, when we learn about Skolem variables, consider what options would be open to you)

7 Proving theorems Prolog proves theorems using resolution. 2 major questions about any theorem prover: –Is it sound? (Does it prove only theorems that are correct?) –Is it complete? (If a theorem is true can it be proved?)

8 Prolog is unsound and incomplete! Unsound in a special case (“occurs check”) Incomplete because of search strategy (depth first searching of search tree; may never find some solutions)

9 Closed World Assumption Consider male(X):- \+female(X). (“not”) “Negation as failure”

10 Expert Systems Rule-based systems (often diagnostic) JESS Forward chaining, e.g. IF it is too hot THEN switch off fire How to implement an inference engine? How to represent knowledge? How to handle uncertainty? e.g. IF it is cold THEN it may snow IF it is cold THEN it will snow (certainty 0.4)

11 Databases No time to cover these in any detail, but you may wish to reflect on the following: –Is Prolog a database? –How can you link Prolog to a DBMS? –Deductive databases: What can be efficiently expressed & deduced? How can search be optimised?

12 But humans don’t do classical logic! Tweety is a bird Normally birds fly Therefore Tweety flies Tweety is a bird Normally birds fly Tweety is an ostrich Ostriches don’t fly Therefore Tweety doesn’t fly Non-monotonic reasoning; specifically, default reasoning.

13 Abduction Default reasoning makes assumptions about what is false (e.g. that Tweety isn’t exceptional) Abduction makes assumptions about what is true too - explanation.

14 Abduction - example Everyone likes his or her children Andrew likes his students So if we know Andrew likes Peter 2 explanations: Peter is his child, or Peter is his student

15 Induction Tweety is a birdTweety has feathers Polly is a birdPolly has a beak Tweety fliesPolly flies Can we find some hypothesis explaining why Tweety and Polly fly? (Something flies if it’s a bird) This is induction, inferring general rules from specific observations.

16 Next time A tutorial introduction to Prolog.