Knowledge Representation. Essential to artificial intelligence are methods of representing knowledge. A number of methods have been developed, including:

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

1 Knowledge Representation Introduction KR and Logic.
Artificial Intelligence 4. Knowledge Representation
Artificial Intelligence in the 21 st Century S. Lucci / D. Kopec Chapter 5: Logic in Artificial Intelligence 1.
Natural Language Processing Lecture 2: Semantics.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
Knowledge Representation
1 Knowledge Representation 6 6.0Issues in Knowledge Representation 6.1A Brief History of AI Representational Systems 6.2Conceptual Graphs: A Network Language.
Conceptual Dependency ATRANS – abstract transfer (give) PTRANS – physical transfer (move) PROPEL – application of force (push) MTRANS – mental transfer.
Knowledge Representation.  What is Knowledge Representation What is Knowledge Representation  Type of knowledge in AI Type of knowledge in AI  Declarative.
CPSC 322 Introduction to Artificial Intelligence November 5, 2004.
Representations One of the major distinctions between ordinary software and AI is the need to represent domain knowledge (or other forms of worldly knowledge)
Knowledge Representation Formalization of facts about the real world Used for reasoning Ad-hoc or systematic? Comprehensiveness Completeness Ease of use.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Inference Methods Propositional and Predicate Calculus.
Conceptual Dependency
CSC 550: Introduction to Artificial Intelligence
Knowledge Representation
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Introduction to Semantics To be able to reason about the meanings of utterances, we need to have ways of representing the meanings of utterances. A formal.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
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.
Knowledge Representation
Knowledge Representation
Review Topics Test 1. Background Topics Definitions of Artificial Intelligence & Turing Test Physical symbol system hypothesis vs connectionist approaches.
Artificial Intelligence Fall 2008 Frank Hadlock. Definitions of AI The study of representation and search through which intelligent activity can be enacted.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Knowledge Based Systems II Fall 2009 Frank Hadlock.
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
Representations One of the major distinctions between ordinary software and AI is the need to represent domain knowledge (or other forms of worldly knowledge)
Knowledge Representation Use of logic. Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally.
Early Work Masterman: 100 primitive concepts, 15,000 concepts Wilks: Natural Language system using semantic networks Shapiro: Propositional calculus based.
Pattern-directed inference systems
Lectures on Artificial Intelligence – CS435 Conceptual Graphs
Knowledge Representation. Key Issue in AI 1. Mapping between objects and relations in a problem domain and computational objects and relations in a program.
KNOWLEDGE REPRESENTATION 6 6.0Issues in Knowledge Representation 6.1A Brief History of AI Representational Systems 6.2Conceptual Graphs: A Network Language.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
Semantic Nets, Frames, World Representation CS – W February, 2004.
Artificial Intelligence and Knowledge Based Systems Fall 2009 Frank Hadlock.
CS6133 Software Specification and Verification
Mathematical Preliminaries
Knowledge Representation
Propositional Logic Predicate Logic
1 CS 385 Fall 2006 Chapter 7 Knowledge Representation 7.1.1, 7.1.5, 7.2.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Artificial Intelligence Knowledge Representation.
Knowledge Representation
Artificial Intelligence – CS364 Knowledge Representation Lectures on Artificial Intelligence – CS364 Conceptual Dependency 20 th September 2005 Dr Bogdan.
Definition and Technologies Knowledge Representation.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Knowledge Representation Techniques
From Micro-Worlds to Knowledge Representation : AI at an Impasse Hubert L. Dreyfus 15. Oct Presented by BoYun Eom.
Knowledge Representation
The function of knowledge representation scheme is
Artificial Intelligence (CS 370D)
Conceptual Dependency (CD)
Knowledge Representation
Strong Slot-and-Filler Structures
Strong Slot-and-Filler Structures
KNOWLEDGE REPRESENTATION
Back to “Serious” Topics…
Weak Slot-and-Filler Structures
Semantic Nets and Frames
Structured Knowledge Representation
Subject : Artificial Intelligence
Conceptual Dependency Theory
Habib Ullah qamar Mscs(se)
Knowledge Representation
Presentation transcript:

Knowledge Representation

Essential to artificial intelligence are methods of representing knowledge. A number of methods have been developed, including: –Logic : propositional and predicate logic –Semantic Networks –Conceptual Dependencies –Scripts –Frames

Representing Knowledge with Logic Logic systems began with Propositional Calculus in which declarative statements with a truth value of true or false are represented by P,Q,R, etc and combined with logic operators Or, And, Not, If. A sentence such as “Bill must take CSC 2020” is represented by letter P and is true or false. Propositional Calculus was extended to Predicate Calculus by adding Predicates (relations), variables, and quantifiers (For All and There Exists). A sentence such as “Every CS major must take CSC 2020” is represented by “(For All X)( CSMajor(X)  MustTake( CSC2020 ))” Given some facts expressed in either Propositional or Predicate Calculus, new facts or knowledge is inferred by inference rules such as modus ponens or resolution. If the computer can find a path from given facts to a new theorem, the path corresponds to a proof and finding such a path constitutes an example of artificial intelligence

Propositional Logic A declarative statement such as “Bill is a CS student” has a truth value of T or F and is denoted by P (a truth variable) Propositions may be combined with logical operators and the composite statement has value as shown below. –P  Q is true if either P or Q are true and false if both are false –P  Q is true if both P and Q are true and false if either is false. –¬ P is true if P is false and false if P is true –P  Q is true if P and Q have the same truth value and false if their values differ –P  Q is false if P is true and Q is false and true otherwise. A tautology is always true. –P  Q  ¬ P  Q is a tautology. –P  (Q  R)  (P  Q)  (P  R) is a tautology.

Semantic Networks Models meaning of language: –Nodes correspond to word concepts –Arcs are labeled with a property name or relationship and link a node (word concept) with another (value of property). Quillian (1967) introduced semantic networks while others (Simmons -1973, Brachman-1979, Schank-1979) have extended the model.

Semantic Networks Standardization of Relationships Standardization of relationships for representing knowledge expressed in language focuses on case relations between verbs and nouns in sentence (Fillmore ’68, Simmons ’73) Prepositions or articles indicate relationship between verb and noun : –Agent : entity performing the action –Object : entity acted upon –Instrument : entity used in performing the action –Etc.

Conceptual Dependencies Set of Primitive Actions Standardization of relations led to axiomatic approach to build semantic model for representing meaning of language Four Primitive Concept Classes ACTS - ActionsPPs – Objects (Picture producers) AAs – Modifiers of actions (Action Aiders) PAs – Modifiers of objects (picture aiders) Each Action is assumed to reduce to one or more of the primitive ACTs ATRANS – transfer relationship (give) PTRANS – transfer physical location (go) PROPEL MOVE GRASP INGEST EXPEL MTRANS MBUILD CONC SPEAK ATTEND

Building Complex Conceptual Dependencies Conceptual Dependency SemanticsExample PP  ACT An actor acts John  PTRANS … John ran PP  PA Object has attribute John  height John is tall ACT  O PP Indicates object of action John  Propel  O cart John pushes the cart ACT  R  PP   PP Indicates the receipt And donor of An Action John  ATRANS  R  John   Mary John took the book from Mary

Scripts Scripts formalize stereotyped sequences of events. A script for a restaurant differs from one for a “fast food” model. The components of a script are –Entry conditions which must be true for script to be activated –Termination conditions which are true when script is terminated. –Props or object which support the script. The script for a restaurant would include table and cash register props. –Roles are the actions that individual participants must perform. The waiter takes orders, the customer eats and pays bill. –Scenes break the script into subsequences which Are sequential in occurerence Provide alternatives (if condition A then Scene1 elsce Scene2)

Frames Frames formalize stereotyped entities and actions. Frames have labeled slots with slot contents an object or action and slot labels are the role played by the slot filler in relation to the central entity of action. A frame is like a record that contains information relevant to stereotyped action or entity: –Frame Identification –Relationship to other frames (part-of, caused-by) –Slots Label indicating relationship to central slot Requirements for slot filler Procedural information to construct or manipulate slot contents Default Contents Slot contents

Frame Examples Case Frame representation of “Mary fixed the chair with glue” ActionFix AgentMary ObjectChair InstrumentGlue Timepast

Conceptual Graphs A Network Language A conceptual graph is a refinement of semantic networks. A conceptual graph is bipartite with one class of nodes representing word concepts and the other class of nodes representing relations. Arcs go from concept class nodes to relation class nodes and vise vesa.

Conceptual Graph Examples Flies is unary relation or predicate Color is a binary relation Parents is a ternary relation Mary gave john a book bird flies dogcolorbrown childparents mother father mary agent giveobject book recipientjohn