The Representation of Knowledge 1 Session 3

Slides:



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

Dr. David A Ferrucci -- Logic Programming and AI Lecture Notes Knowledge Structures Building the Perfect Object.
CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.
ICE1341 Programming Languages Spring 2005 Lecture #6 Lecture #6 In-Young Ko iko.AT. icu.ac.kr iko.AT. icu.ac.kr Information and Communications University.
Knowledge Representation
Chapter 3: Methods of Inference
Chapter 3: Methods of Inference Expert Systems: Principles and Programming, Fourth Edition.
Chapter 2: The Representation of Knowledge
Knowledge representation methods جلسه سوم. KR is AI bottleneck The most important ingredient in any expert system is knowledge. The power of expert systems.
Chapter 2 Syntax A language that is simple to parse for the compiler is also simple to parse for the human programmer. N. Wirth.
Chapter 3: Methods of Inference
Knowledge representation
Methods of Inference. 2 Objectives Learn the definitions of trees, lattices, and graphs Learn about state and problem spaces Learn about AND-OR trees.
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
Chapter 10: Compilers and Language Translation Invitation to Computer Science, Java Version, Third Edition.
Artificial Intelligence
Alternative representations: Semantic networks
CS Describing Syntax CS 3360 Spring 2012 Sec Adapted from Addison Wesley’s lecture notes (Copyright © 2004 Pearson Addison Wesley)
Artificial Intelligence Knowledge Representation.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
ISBN Chapter 3 Describing Semantics.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
1 / 48 Formal a Language Theory and Describing Semantics Principles of Programming Languages 4.
Chapter 2: The Representation of Knowledge
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?
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Syntax.
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.
Lecture 14. Recap Problem Solving GA Simple GA Examples of Mutation and Crossover Application Areas.
Methods of Inference 1 Session 5 Course: T0273 – EXPERT SYSTEMS Year: 2014.
Inexact Reasoning 2 Session 10
Artificial Intelligence 4. Knowledge Representation
Chapter 3 – Describing Syntax
Describing Syntax and Semantics
Knowledge Representation
Knowledge Representation Techniques
Chapter 3: Methods of Inference
Chapter 7. Propositional and Predicate Logic
Artificial Intelligence
Describing Syntax and Semantics
Methods of Inference 2 Session 6
Concepts of Programming Languages
Inexact Reasoning 2 Session 10
Inexact Reasoning 1 Session 9
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Chapter 3: Methods of Inference
Artificial Intelligence (CS 370D)
CS416 Compiler Design lec00-outline September 19, 2018
Compiler Design 4. Language Grammars
Introduction CI612 Compiler Design CI612 Compiler Design.
KNOWLEDGE REPRESENTATION
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Back to “Serious” Topics…
CS416 Compiler Design lec00-outline February 23, 2019
Chapter 7. Propositional and Predicate Logic
Chapter 3 Describing Syntax and Semantics.
Knowledge Representation
Semantic Nets and Frames
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
High-Level Programming Language
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Chapter 10: Compilers and Language Translation
Lec00-outline May 18, 2019 Compiler Design CS416 Compiler Design.
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Language translation Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Habib Ullah qamar Mscs(se)
Presentation transcript:

The Representation of Knowledge 1 Session 3 Course : T0273 – EXPERT SYSTEMS Year : 2014 The Representation of Knowledge 1 Session 3

Learning Outcomes LO 1 : Explain concepts of Expert Systems LO 2 : Describe the characteristics of Expert Systems After taking this course, students should be able to explain and discuss the representation of knowledge. T0273 - Expert Systems

Lecture Outline Introduction The Meaning of Knowledge Productions Semantic Nets Object-Attribute-Value Triples PROLOG and Semantic Nets Difficulties with Semantic Nets Schemata Graph Exercise T0273 - Expert Systems

Introduction Knowledge representation (KR) has long been considered central to AI because it is as significant a factor in determining the success of a system as the software that uses the knowledge. KR is of major importance in expert systems for two reasons: Expert systems are designed for a certain type of KR based on rules of logic called inferences. Expert systems affects the development, efficiency, speed, and maintenance of the system. T0273 - Expert Systems

The Meaning of Knowledge Knowledge is one of those words that everyone knows the meaning of, yet finds hard to define or even feel the same way about. Knowledge has many meanings depending on the mind of the beholder Knowledge can be further classified into procedural knowledge, declarative knowledge, and tacit knowledge. T0273 - Expert Systems

The Meaning of Knowledge Procedural Knowledge is often referred to as knowing how to do something. Example: knowing how to boil a pot of water Declarative Knowledge refers to knowing that something is true or false Example: “Don’t put your fingers in a pot of boiling water” Tacit Knowledge (unconscious knowledge) it cannot be expressed by language. Example: knowing how to move your hand. T0273 - Expert Systems

The Meaning of Knowledge Knowledge is of primary importance in expert systems. Knowledge + Inference = Expert Systems Inferencing is generally used for mechanical systems such as expert systems. Reasoning is the term used for human thinking. T0273 - Expert Systems

The Meaning of Knowledge T0273 - Expert Systems

Productions A number of different KR techniques have been devised. These include rules, semantic nets, frames, script, logic, conceptual graphs, and others. One formal notation for defining productions is the Backus-Naur-Form (BNF). Example: <sentence>::= <subject> <verb> <end-mark> angle brackets, <>, and ::= : symbols of the metalanguage term within angle brackets : nonterminal symbols <sentence> : start symbol T0273 - Expert Systems

Productions The production rule: <sentence>  <subject> <verb> <end-mark> states that a sentence is composed of a subject, followed by a verb, followed by an end-mark The following rules complete the nonterminals by specifying their possible terminals. The bar means “or” in the metalanguage: <subject>  I | You | We <verb>  left |came <end-mark>  . | ? | ! T0273 - Expert Systems

Productions A grammar is a complete set of production rules that defines a language ambiguously. Example: <sentence>  <subject> <verb> <object> <end-mark> <object>  home | work | school A parse tree or derivation tree is a graphic representation of a sentence decomposed into all the terminals and nonterminals used to derive the sentence T0273 - Expert Systems

Semantics Nets Semantic network is a classic AI representation technique used for propositional information. Sometimes called a propositional net. The structure of a semantic net is shown graphically in terms of nodes and the arcs connecting them. Nodes are sometimes referred as objects and the arcs as links or edges. The links of a semantic net are used to express relationships. Nodes are generally used to represent physical objects, concepts, or situations. T0273 - Expert Systems

Semantics Nets T0273 - Expert Systems

A Semantic Net with IS-A and A-Kind-Of (AKO) Links Semantics Nets A Semantic Net with IS-A and A-Kind-Of (AKO) Links T0273 - Expert Systems

Object-Attribute-Value Triples An object-attribute-value triple (OAV), or triplet, can be used to characterize all the knowledge in a semantic net and was used in the expert system MYCIN for diagnosing infectious diseases. OAV triples are especially useful for representing facts and the patterns to match the facts in the antecedent of a rule. T0273 - Expert Systems

Object-Attribute-Value Triples An OAV Table Object Attribute Value apple grapes color type quantity red macintosh 100 seedless 500 T0273 - Expert Systems

PROLOG and Semantic Nets Semantic nets are easy to translate into PROLOG. Example: is_a (goodyear_blimp, blimp). is_a (spirit_of_st_louis, special). has_shape (blimp, ellipsoidal). has_shape (balloon, round). Each of statements above is a PROLOG predicate expression. T0273 - Expert Systems

PROLOG and Semantic Nets The following are some examples of PROLOG predicates. Comments are preceded by semicolons and ignored by the PROLOG engines: color (red). ; red is a color is a fact mother (pat, ann). ; pat is the mother of ann parents (jim, ann, tom) ; jim and ann are parents of tom surrogatemother (pat, tom) ; pat is surrogatemother of tom Predicates can also be expressed with relations such as the IS-A and HAS-A is_a (red, color). has_a (john, father). has_a (john, mother). has_a (john, parents). T0273 - Expert Systems

Difficulties with Semantic Nets The lack of link name standards. Combinatorial explosion of searching nodes, especially if the response to a query is negative. It would take a very long time to answer negative queries. Semantic nets are logically inadequate because they cannot define knowledge in the way that logic can. T0273 - Expert Systems

Schemata In AI, the term schema (plural schemas or schemata) is used to describe a more complex knowledge structure than the semantic net. For example, the acts of eating and drinking are pleasurable sensorimotor schemata that involve coordinating information from the senses with the required motor (muscle) movements to eat and drink. A conceptual schema is an abstraction in which specific objects are classified by their general properties. For example, if you see a small red, round object with a green stem under a sign that says Artificial Fruit, you will recognize it as an artificial apple. T0273 - Expert Systems

Graph A circuit (cycle) is a path through the graph beginning and ending with the same node. Acyclic graphs have no cycles. Connected graphs have links to all the nodes. Digraphs are graphs with directed links. Lattice is a directed acyclic graph. Bina Nusantara University

State and Problem Spaces A state space can be used to define an object’s behavior. Different states refer to characteristics that define the status of the object. A state space shows the transitions an object can make in going from one state to another. Bina Nusantara University

At any one time, the machine is in one particular state. Finite State Machine A FSM is a diagram describing the finite number of states of a machine. At any one time, the machine is in one particular state. The machine accepts input and progresses to the next state. FSMs are often used in compilers and validity checking programs. Bina Nusantara University

Using FSM to Solve Problem Characterizing ill-structured problems – one having uncertainties. Well-formed problems: Explicit problem, goal, and operations are known Deterministic – we are sure of the next state when an operator is applied to a state. The problem space is bounded. The states are discrete. Bina Nusantara University

State Diagram of Vending Machine Bina Nusantara University

Summary Knowledge representation is of major importance in expert systems. A number of different KR techniques have been devised. These include rules, semantic nets, frames, script, logic, conceptual graphs, and others. Semantic network is a classic AI representation technique used for propositional information. Semantic nets are easy to translate into PROLOG. There are some difficulties with semantic nets. Schemata is used to describe a more complex knowledge structure than the semantic net. T0273 - Expert Systems

Exercise Draw semantic net for computers using AKO and IS-A links. Consider the classes of microcomputer, mainframe, supercomputer, computing systems, dedicated, general purpose, board-level, computer-on-a-chip, single processor, and multiprocessor. Include specific instances. Draw a semantic net for computer communications using AKO and IS-A links. Consider the classes of local area net, wide area net, token ring, star, centralized, decentralized, distributed, modems, telecommunications, newsgroups, and electronic mail. Include specific instances. T0273 - Expert Systems

References Joseph Giarratano, Gary Riley. 2005. Expert Systems: Principles and Programming Chapter 2. Thomson Course Technology. Australia. ISBN:0-534-38447-1. Peter Jackson. 1998. Introduction to Expert Systems. Addison-Wesley. Harlow, England. ISBN:0201876868 http://www.codeproject.com/Articles/179375/Man- Marriage-and-Machine-Adventures-in-Artificial T0273 - Expert Systems