Artificial Intelligence Chapter 18. Representing Commonsense Knowledge.

Slides:



Advertisements
Similar presentations
Expert System Seyed Hashem Davarpanah
Advertisements

Artificial Intelligence
Artificial Intelligence Chapter 13 The Propositional Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Biointelligence Lab School of Computer Sci. & Eng.
Artificial Intelligence Chapter 21 The Situation Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
Knowledge Representation
Knowledge Representation. Essential to artificial intelligence are methods of representing knowledge. A number of methods have been developed, including:
For Friday Finish chapter 10 No homework (get started on program 2)
Intelligent systems Lecture 6 Rules, Semantic nets.
Artificial Intelligence Chapter 19 Reasoning with Uncertain Information Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Knowledge Evolution Up to now we have not considered evolution of the knowledge In real situations knowledge evolves by: –completing it with new information.
Artificial Intelligence Chapter 17 Knowledge-Based Systems Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.
Frames and semantic networks, page 1 CSI 4106, Winter 2005 A brief look at semantic networks A semantic network is an irregular graph that has concepts.
Inequalities and Proof
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
For Friday Exam 1. For Monday No reading Take home portion of exam due.
Artificial Intelligence
Understanding PML Paulo Pinheiro da Silva. PML PML is a provenance language (a language used to encode provenance knowledge) that has been proudly derived.
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
For Wednesday Read chapter 13 Homework: –Chapter 10, exercise 5 (part 1 only, don’t redo) Progress for program 2 due.
Early Work Masterman: 100 primitive concepts, 15,000 concepts Wilks: Natural Language system using semantic networks Shapiro: Propositional calculus based.
Logical Agents Logic Propositional Logic Summary
Temporal Reasoning and Planning in Medicine Frame-Based Representations and Description Logics Yuval Shahar, M.D., Ph.D.
Big Ideas Differentiation Frames with Icons. 1. Number Uses, Classification, and Representation- Numbers can be used for different purposes, and numbers.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Structured Knowledge Chapter 7. 2 Logic Notations Does logic represent well knowledge in structures?
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Knowledge Representation Semantic Web - Fall 2005 Computer.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Machine Learning Chapter 5. Artificial IntelligenceChapter 52 Learning 1. Rote learning rote( โรท ) n. วิถีทาง, ทางเดิน, วิธีการตามปกติ, (by rote จากความทรงจำ.
Semantic Nets, Frames, World Representation CS – W February, 2004.
1 CS 2710, ISSP 2610 Chapter 12 Knowledge Representation.
Artificial Intelligence Chapter 15 The Predicate Calculus Artificial Intelligence Chapter 15 The Predicate Calculus Biointelligence Lab School of Computer.
Knowledge Representation
Some Thoughts to Consider 8 How difficult is it to get a group of people, or a group of companies, or a group of nations to agree on a particular ontology?
1 CS 385 Fall 2006 Chapter 7 Knowledge Representation 7.1.1, 7.1.5, 7.2.
For Wednesday Read chapter 13 No homework. Program 2 Any questions?
CSE (c) S. Tanimoto, 2008 ISA Hierarchies 1 ISA Hierarchies: A Basis for Knowledge Representation with Semantic Networks Outline: Introduction The.
Artificial Intelligence Chapter 23 Multiple Agents Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Reasoning Systems For Categories By Franklyn O. Reasoning Systems For Categories Categories are the primary building blocks of any large-scale knowledge.
Lecture 5 Frames. Associative networks, rules or logic do not provide the ability to group facts into associated clusters or to associate relevant procedural.
Definition and Technologies Knowledge Representation.
Artificial Intelligence Chapter 7 Agents That Plan Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
16 April 2011 Alan, Edison, etc, Saturday.. Knowledge, Planning and Robotics 1.Knowledge 2.Types of knowledge 3.Representation of knowledge 4.Planning.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
Artificial Intelligence & Knowledge Representation National Institute Of Science & Technology Sudeep Misra [1] Artificial Intelligence and Knowledge Representation.
Knowledge Representation Techniques
Artificial Intelligence
ARTIFICIAL INTELLIGENCE
Artificial Intelligence Chapter 17 Knowledge-Based Systems
Artificial Intelligence Chapter 17 Knowledge-Based Systems
Knowledge Representation
ARTIFICIAL INTELLIGENCE
Knowledge Representation
Knowledge Representation
ARTIFICIAL INTELLIGENCE
KNOWLEDGE REPRESENTATION
Artificial Intelligence Chapter 15. The Predicate Calculus
Weak Slot-and-Filler Structures
Artificial Intelligence Chapter 17. Knowledge-Based Systems
Expert System Dr. Khoerul Anwar, S.T.,M.T STMIK Pradnya Paramita
Knowledge Representation I (Propositional Logic)
Artificial Intelligence Chapter 21. The Situation Calculus
Semantic Nets and Frames
Artificial Intelligence Chapter 17 Knowledge-Based Systems
Subject : Artificial Intelligence
Deniz Beser A Fundamental Tradeoff in Knowledge Representation and Reasoning Hector J. Levesque and Ronald J. Brachman.
Presentation transcript:

Artificial Intelligence Chapter 18. Representing Commonsense Knowledge

(C) 2000, 2001 SNU CSE Biointelligence Lab2 Outline The Commonsense World Time Knowledge Representations by Networks Additional Readings and Discussion

(C) 2000, 2001 SNU CSE Biointelligence Lab The Commonsense World What Is Commonsense Knowledge?  Most people know the fact that a liquid fall out if the cup is turned upside down. But how can we represent it ?  Commonsense knowledge  If you drop an object, it will fall.  People don’t exist before they are born.  Fish live in water and will die if taken out.  People buy bread and milk in a grocery store.  People typically sleep at night.

(C) 2000, 2001 SNU CSE Biointelligence Lab Difficulties in Representing Commonsense Knowledge How many will be needed by a system capable of general human-level intelligence? No on knows for sure. No well-defined frontiers Knowledge about some topics may not be easily captured by declarative sentences.  Description of a human face Many sentences we might use for describing the world are only approximations.

(C) 2000, 2001 SNU CSE Biointelligence Lab The Importance of Commonsense Knowledge Machine with commonsense  The knowledge such a robot would have to have! Commonsense knowledge for expert systems  To recognize outside of the specific area, to predict more accurately. Commonsense for expanding the knowledge of an expert system To understanding natural language

(C) 2000, 2001 SNU CSE Biointelligence Lab Research Areas Currently not available system with commonsense but,  Object and materials : describing materials and their properties  Space : formalizing various notions about space  Physical properties : mass, temperature, volume, pressure, etc.  Physical Processes and events : modeling by differential equations v.s. qualitative physics without the need for exact calculation  Time : developing techniques for describing and reasoning about time

(C) 2000, 2001 SNU CSE Biointelligence Lab Time How are we to think about time?  Real line: extending both into infinite past and infinite future  Integer: countable from beginning with 0 at ‘big bang’ [James 1984, Allen 1983]  Time is something that events and processes occur in.  “Interval” : containers for events and processes. Predicate calculus used for describing interval  Occurs(E, I) : some event or process E, occupies the interval I.  Interval has starting and ending time points.

(C) 2000, 2001 SNU CSE Biointelligence Lab8 그림 18.1 Figure 18.1 Relation between Intervals

(C) 2000, 2001 SNU CSE Biointelligence Lab Knowledge Representation by Networks Taxonomic Knowledge The entities of both commonsense and expert domains can be arranged in hierarchical structures that organize and simplify reasoning. CYC system [Guha & Lenat 1990] Taxonomic hierarchies : encoded either in networks or data structure called frames. Example  “Snoopy is a laser printer, all laser printers are printers, all printers are machines.” Laser_printer(Snoopy) (  x)[Laser_printer(x)  Printer(x)] (  x)[Printer(x)  Office_machine(x)]

(C) 2000, 2001 SNU CSE Biointelligence Lab Semantic Networks Definition : graph structures that encode taxonomic knowledge of objects and their properties Two kinds of nodes  Nodes labeled by relation constants corresponding to either taxonomic categories or properties  Nodes labeled by object constants corresponding to objects in the domain Three kinds of arcs connecting nodes  Subset arcs (isa links)  Set membership arcs (instance links)  Function arcs

(C) 2000, 2001 SNU CSE Biointelligence Lab11 그림 18.2 Figure 18.2 A Semantic network

(C) 2000, 2001 SNU CSE Biointelligence Lab Nonmonotonic Reasoning in Semantic Networks Reasoning in ordinary logic is monotonic.  Because adding axioms to a logical system does not diminish the set of theorems that can be proved. We must retract the default inference if new contradictory knowledge arrives.  Default inference : barring knowledge to the contrary, we are willing to assume are true. Example of nonmonotonic reasoning : cancellation of inheritance.  By default, the energy source of office machines is electric wall outlet. But the energy source of a robot is a battery.

(C) 2000, 2001 SNU CSE Biointelligence Lab13 Figure 18.3 A Semantic Network for Default Reasoning  Adding another function arc  Contradiction from property inheritance can be resolved by the way in which information about the most specific categories takes precedence over less specific categories.

(C) 2000, 2001 SNU CSE Biointelligence Lab Frames Frame is a Data structure which has a name and a set of attribute- value pairs (slots).  The frame name corresponds to a node in a semantic network.  The attributes (slot names) correspond to the names of arcs associated with this node  The values (slot fillers)correspond to nodes at the other ends of these arcs. Semantic networks and frames do have difficulties in expressing certain kinds of knowledge  Disjunctions, negations, nontaxonomic knowledge Hybrid system : KRYPTON, CLASSIC  Use terminological logic (employing hierarchical structures to represnent entities, classes, and properties and logical expressions for other information).

(C) 2000, 2001 SNU CSE Biointelligence Lab15 Figure 18.5 A Frame

(C) 2000, 2001 SNU CSE Biointelligence Lab16 Additional Reading and Discussion [Davis 1990, Hobbs & Moore 1985]  More commonsense representation and reasoning methods [Lenat & Guha 1990]  CYC [Sowa 1991]  Edited collection of papers [Ginsberg 1987]  Nonmonotonic reasoning [Gentner 1983]  Analogical reasoning