Knowledge Representation and Inference

Slides:



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

Artificial Intelligence 4. Knowledge Representation
Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.
Artificial Intelligence Inference in first-order logic Fall 2008 professor: Luigi Ceccaroni.
B. Ross Cosc 4f79 1 Frames Knowledge bases can be enhanced by using principles from frame knowledge representation (similar to object orientation) This.
Knowledge Representation
Knowledge Representation
Intelligent systems Lection 7 Frames, selection of knowledge representation, its combinations.
Chapter 4 Knowledge Representation Artificial Intelligence ดร. วิภาดา เวทย์ประสิทธิ์ ภาควิชาวิทยาการคอมพิวเตอร์ คณะ วิทยาศาสตร์ มหาวิทยาลัยสงขลานครินทร์
Knowledge Representation Chapter 4. 2 What is KR? R. Davis, H. Schrobe, P. Szolovits (1993): 1.A surrogate 2.A set of ontological commitments 3.A fragmentary.
1 Knowledge Representation We’ve discussed generic search techniques. Usually we start out with a generic technique and enhance it to take advantage of.
For Friday Read “lectures” 1-5 of Learn Prolog Now: prolog-now/
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
1 Lecture 34 Introduction to Knowledge Representation & Expert Systems Overview  Lecture Objective  Introduction to Knowledge Representation  Knowledge.
© 2002 Franz J. Kurfess Introduction 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Knowledge Representation I (Propositional Logic) CSE 473.
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.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
Review Topics Test 1. Background Topics Definitions of Artificial Intelligence & Turing Test Physical symbol system hypothesis vs connectionist approaches.
 Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
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.
Jess: A Rule-Based Programming Environment Reporter: Yu Lun Kuo Date: April 10, 2006 Expert System.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Devina DesaiF r a m e P r o b l e m What is a Frame Problem Environment for an agent is not static Identifying which things remain static in changing word.
The AI War LISP and Prolog Basic Concepts of Logic Programming
Introduction to Prolog. Outline What is Prolog? Prolog basics Prolog Demo Syntax: –Atoms and Variables –Complex Terms –Facts & Queries –Rules Examples.
KNOWLEDGE BASED SYSTEMS
Logic Programming (LP) expresses code using of a restricted form of symbolic logic. LP programs are declarative, rather than algorithmic. An LP program.
Logic Programming Tarik Booker. What will we cover?  Introduction  Definitions  Predicate Calculus  Prolog  Applications.
ISBN Chapter 16 Logic Programming Languages.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Artificial Intelligence Knowledge Representation Department of Computer Science & Enggineering V. R. Palekar.
Artificial Intelligence Knowledge Representation.
Knowledge Engineering. Sources of Knowledge - Books - Journals - Manuals - Reports - Films - Databases - Pictures - Audio and Video Tapes - Flow Diagram.
Definition and Technologies Knowledge Representation.
CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 26/Feb/2007.
16 April 2011 Alan, Edison, etc, Saturday.. Knowledge, Planning and Robotics 1.Knowledge 2.Types of knowledge 3.Representation of knowledge 4.Planning.
Summary for final exam Agent System..
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Artificial Intelligence 4. Knowledge Representation
Knowledge Representation
By P. S. Suryateja Asst. Professor, CSE Vishnu Institute of Technology
Announcements No office hours today!
Topics Covered since 1st midterm…
Chapter 9. Rules and Expert Systems
Propositional Logic Session 3
For Friday No reading Prolog handout 3 Chapter 9, exercises 9-11.
For Wednesday Read “lectures” 7-10 of Learn Prolog Now:
Using Rules with Ontologies in the Semantic Web
Knowledge-Based Systems Chapter 17.
Knowledge Representation
Rules, RIF and RuleML.
Artificial Intelligence (CS 370D)
Knowledge Representation
First Order Logic: Logical Inference
KNOWLEDGE REPRESENTATION
Back to “Serious” Topics…
Artificial Intelligence Chapter 17. Knowledge-Based Systems
2/24/2019.
Expert System Dr. Khoerul Anwar, S.T.,M.T STMIK Pradnya Paramita
CS 188: Artificial Intelligence
Artificial Intelligence
Subject : Artificial Intelligence
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
8/2/2019.
Chapter 14 February 26, 2004.
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Knowledge Representation and Inference CS 480/580 Fall 2009

Requirements for Knowledge Representation Languages Well-defined syntax and semantics General requirements: Representational adequacy Inferential adequacy Inferential efficiency Clear syntax and semantics Naturalness

Semantic Networks Originally developed in 1960s to represent the meaning of English words

Frames Frames are a variant of semantic networks Widely used in expert systems Semantic networks and frames are interchangeable Defaults and multiple inheritance Slots and procedures

Predicate Logic This is the most important knowledge representation Syntax: P V Q P ^ Q ¬Q P → Q P ↔ Q P ^ (Q → R); (Q V ¬R) → P

Predicate Logic (cont.) Notation: Begin with lower case letters for constants; Begin with a capital letter for variables; fatherof(allison, richard) Prolog uses , : and ;: OR More on Prolog …

Rule-based Systems If – then rules and facts Forward chaining system Conflict resolution Backward chaining system