Early Work Masterman: 100 primitive concepts, 15,000 concepts Wilks: Natural Language system using semantic networks Shapiro: Propositional calculus based.

Slides:



Advertisements
Similar presentations
Artificial Intelligence 4. Knowledge Representation
Advertisements

Natural Language Processing Lecture 2: Semantics.
1 CS 388: Natural Language Processing Story Understanding Raymond J. Mooney University of Texas at Austin.
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. Essential to artificial intelligence are methods of representing knowledge. A number of methods have been developed, including:
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)
Dave Reed Knowledge representation  associationist knowledge semantic nets, conceptual dependencies  structured knowledge frames, scripts  alternative.
1 Pertemuan 14 Strong Slot-and-Filler Structures Matakuliah: T0264/Inteligensia Semu Tahun: Juli 2006 Versi: 2/1.
Knowledge Representation Formalization of facts about the real world Used for reasoning Ad-hoc or systematic? Comprehensiveness Completeness Ease of use.
Conceptual Dependency
CSC 550: Introduction to Artificial Intelligence
Knowledge Representation
Artificial Intelligence Lecture No. 12 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
1 Pertemuan 13 Strong Slot-and-Filler Structures Matakuliah: T0264/Inteligensia Semu Tahun: 2005 Versi: 1/0.
Knowledge Representation
Knowledge Representation
Knowledge Representation and Objects
Objects Objects are at the heart of the Object Oriented Paradigm What is an object?
Knowledge Representation
Review Topics Test 1. Background Topics Definitions of Artificial Intelligence & Turing Test Physical symbol system hypothesis vs connectionist approaches.
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.
Lectures on Artificial Intelligence – CS289 Conceptual Graphs
TM CG Notes Latest: Outline Big Picture architecture Topic Maps – CG – Notio Notes – Amine Notes – CharGer Notes – Prolog – Analogy –
Lectures 5,6 MACHINE LEARNING EXPERT SYSTEMS. Contents Machine learning Knowledge representation Expert systems.
Knowledge Based Systems II Fall 2009 Frank Hadlock.
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
Representations One of the major distinctions between ordinary software and AI is the need to represent domain knowledge (or other forms of worldly knowledge)
Lectures on Artificial Intelligence – CS435 Conceptual Graphs
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Knowledge Representation. Key Issue in AI 1. Mapping between objects and relations in a problem domain and computational objects and relations in a program.
Class Modeling. Basic Class Modeling Concepts Object Class Link Association Generalization Inheritance.
Artificial Intelligence Chapter 18. Representing Commonsense Knowledge.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Knowledge Representation Semantic Web - Fall 2005 Computer.
KNOWLEDGE REPRESENTATION 6 6.0Issues in Knowledge Representation 6.1A Brief History of AI Representational Systems 6.2Conceptual Graphs: A Network Language.
Semantic Nets, Frames, World Representation CS – W February, 2004.
Object-Oriented Modeling: Static Models. Object-Oriented Modeling Model the system as interacting objects Model the system as interacting objects Match.
Subsumption Architecture and Nouvelle AI Arpit Maheshwari Nihit Gupta Saransh Gupta Swapnil Srivastava.
Knowledge Representation
1 CS 385 Fall 2006 Chapter 7 Knowledge Representation 7.1.1, 7.1.5, 7.2.
Knowledge Representation & Game Theory Presented By: Saurabh Sohoney Adil Anis Sandalwala “Once acquired, knowledge must be organized for use” Guided By:
Artificial Intelligence Knowledge Representation.
Knowledge Representation
Knowledge Engineering. Sources of Knowledge - Books - Journals - Manuals - Reports - Films - Databases - Pictures - Audio and Video Tapes - Flow Diagram.
Artificial Intelligence – CS364 Knowledge Representation Lectures on Artificial Intelligence – CS364 Conceptual Dependency 20 th September 2005 Dr Bogdan.
Definition and Technologies Knowledge Representation.
16 April 2011 Alan, Edison, etc, Saturday.. Knowledge, Planning and Robotics 1.Knowledge 2.Types of knowledge 3.Representation of knowledge 4.Planning.
Artificial Intelligence 4. Knowledge Representation
Knowledge Representation Techniques
From Micro-Worlds to Knowledge Representation : AI at an Impasse Hubert L. Dreyfus 15. Oct Presented by BoYun Eom.
Conceptual Graphs(1) A CG is a finite, connected, bipartite graph.
Knowledge Representation
Knowledge Representation & Game Theory
Knowledge Representation
Artificial Intelligence (CS 370D)
Conceptual Dependency (CD)
Knowledge Representation
Strong Slot-and-Filler Structures
Conceptual Graphs Graph Structure
Strong Slot-and-Filler Structures
KNOWLEDGE REPRESENTATION
Weak Slot-and-Filler Structures
Semantic Nets and Frames
Structured Knowledge Representation
Subject : Artificial Intelligence
Conceptual Dependency Theory
Presentation transcript:

Early Work Masterman: 100 primitive concepts, 15,000 concepts Wilks: Natural Language system using semantic networks Shapiro: Propositional calculus based semantic network

Quillian's network Nodes correspond to word concepts with links to other concepts used to define it. Organized into planes, each plane a graph that defines a single meaning of a word. Links are associative and named, and may be multi- arcs (ors) Use to find relationships between pairs of words through graph search.

Schank's Conceptual Dependency Four primitive conceptualizations: ACT (actions), PP (objects – picture producers), AA (action modifiers or aiders), PA (picture modifiers or aiders) Fixed set of primitive actions: ATRANS, PTRANS, PROPEL, MOVE, GRASP, INGEST, EXPEL, INGEST, MTRANS, MBUILD, CONC, SPEAK, ATTEND.

Schank (cont'd) Different kind of links (multi-arcs): actor (agent), attribute, object, recipient, donor, direction, instrumental conceptualization, causality, state of change, possessor, part Claim is that all knowledge can be broken down into this primitive concepts. Used to create canonical forms of natural language expressions.

Simmon's Case Based Represent. Based on Filmore's case structure of verbs. Verbs are the main nodes Have actor, object, instrument, location, and time Captures deep structure of sentence

Scripts (Schank and Abelson) Used to incorporate real-world, common-sense default knowledge and to organize large amounts of information. Incorporates expected actions and elements. The actual situation may differ. Scripts have the following components: Entry conditions, Results, Props, Roles, and Scenes. Each element is represented by conceptual dep.

Easy Example Amy went out to lunch. She sat at a table and called a waitress, who brought her a menu. She ordered a sandwich.

Hard Example John visited his favorite restaurant on the way to the concert. he was pleased by the bill because he liked Mozart.

Frames (Minsky) Frames are structured entities with named slots and attached values. Values may be procedural (think objects). Frames are related to one another. Example slots: ID, relationship to other frames, description of requirements, procedural information, default information, new instance information. Frames support class inheritance.

Conceptual Graphs (Sowa) Two types of nodes: concepts and conceptual relations. Arcs are not labeled – a conceptual relation node appears between two concept nodes instead. Concept nodes may be concrete or abstract objects. Each graph represents a single proposition. A graph may be boxed and used as a node in another graph.

Conceptual Graphs (cont'd) Every concept is of a unique individual of a give type. Each concept box is labeled with a type label. (:) A concept could be a specific, but unnamed individual. (#) A name is different from the object (name conceptual relation) A concept may be an unspecified individual (*). There is a type hierarchy.

Conceptual Graphs: Rules The following rules may be used to modify graphs: An exact copy may be made (copy rule). A generic marker may be replaced by an individual marker (restrict). A type may be replaced by a subtype as long as the subtype is consistent with the referent (restrict). Two graphs may be joined by a common concept (join).

Propositional Concepts Graphs may be used to represent relations between propositions (causality, time, etc.) A propositional concept is indicated by a box around a conceptual graph and may be used as a node in another graph. Neg and conjunction are conceptual relations. Conceptual graphs have the same expressive power as the predicate calculus.

Subsumption Architecture (Brooks) The idea is that intelligence emerges from the interaction of architectures of simpler behaviors. Layered collection of task-handlers which interact with neighboring layers. Each task-handler perceives (input from a lower level), applies a simple set of condition-action production rules, and produces action-orient output (to a higher level).

Brooks (cont'd) No global state. Some feedback to lower levels. Example: Machine robot: Three levels – Explore, Wander, Avoid.