Representation of Actions in Cyc and KM

Slides:



Advertisements
Similar presentations
Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
Advertisements

Kurt Hungerford CSCI The Knowledge Machine is a knowledge representation and reasoning system that allows users to store concepts and relationships.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CH-4 Ontologies, Querying and Data Integration. Introduction to RDF(S) RDF stands for Resource Description Framework. RDF is a standard for describing.
Copyright © 2002 Cycorp Introduction Fundamental Expression Types Top Level Collections Time and Dates Spatial Properties and Relations Event Types Information.
Rule-Based Deduction Systems
Knowledge Representation and Reasoning  Representação do Conhecimento e Raciocínio Computacional José Júlio Alferes and Carlos Viegas Damásio.
Knowledge Representation
Chapter 4 Knowledge Representation Artificial Intelligence ดร. วิภาดา เวทย์ประสิทธิ์ ภาควิชาวิทยาการคอมพิวเตอร์ คณะ วิทยาศาสตร์ มหาวิทยาลัยสงขลานครินทร์
1 Ontology Language Comparisons doug foxvog 16 September 2004.
Ontologies and the Semantic Web by Ian Horrocks presented by Thomas Packer 1.
© Franz Kurfess Knowledge-Based Systems CSC 480: Artificial Intelligence Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
TAPP-09 23/02/2009Giorgos Flouris1 On Explicit Provenance Management in RDF/S Graphs Institute of Computer Science Foundation for Research and Technology.
1. Motivation Knowledge in the Semantic Web must be shared and modularly organised. The semantics of the modular ERDF framework has been defined model.
RDF (Resource Description Framework) Why?. XML XML is a metalanguage that allows users to define markup XML separates content and structure from formatting.
1 Semantic Web Semantic Web DL Relationships with other Formalisms Habib Rostami.
1 Artificial Intelligence Applications Institute Centre for Intelligent Systems and their Applications Stuart Aitken Artificial Intelligence Applications.
Ontologies Reasoning Components Agents Simulations Belief Update, Planning and the Fluent Calculus Jacques Robin.
Clément Troprès - Damien Coppéré1 Semantic Web Based on: -The semantic web -Ontologies Come of Age.
INF 384 C, Spring 2009 Ontologies Knowledge representation to support computer reasoning.
Artificial Intelligence
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Semantic Web - an introduction By Daniel Wu (danielwujr)
Advanced topics in software engineering (Semantic web)
KM’s Inference Algorithm Peter Clark Knowledge Systems Boeing Math & Computing Technology.
Artificial Intelligence Chapter 18. Representing Commonsense Knowledge.
Safety-Critical Systems 5 Testing and V&V T
© D. Wong Ch. 2 Entity-Relationship Data Model (continue)  Data models  Entity-Relationship diagrams  Design Principles  Modeling of constraints.
EEL 5937 Ontologies EEL 5937 Multi Agent Systems Lecture 5, Jan 23 th, 2003 Lotzi Bölöni.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
1 Artificial Intelligence Applications Institute Centre for Intelligent Systems and their Applications Stuart Aitken Artificial Intelligence Applications.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
OilEd An Introduction to OilEd Sean Bechhofer. Topics we will discuss Basic OilEd use –Defining Classes, Properties and Individuals in an Ontology –This.
A View-based Methodology for Collaborative Ontology Engineering (VIMethCOE) Ernesto Jiménez Ruiz Rafael Berlanga Llavorí Temporal Knowledge Bases Group.
EEL 5937 Ontologies EEL 5937 Multi Agent Systems Lecture 5, Jan 23 th, 2003 Lotzi Bölöni.
KNOWLEDGE BASED SYSTEMS
Knowledge Representation
 Copyright 2005 Digital Enterprise Research Institute. All rights reserved. WSLA Language Specification
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12 RDF, OWL, Minimax.
Building Knowledge about Buildings Matt Young and Eyal Amir University of Illinois, Urbana-Champaign.
Of 29 lecture 15: description logic - introduction.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Artificial Intelligence Knowledge Representation.
Definition and Technologies Knowledge Representation.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
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 Logical Agents Chapter 7.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
Rule-based Reasoning in Semantic Text Analysis
Knowledge Representation Techniques
OKBC (Open Knowledge Base Connectivity) An API For Knowledge Servers
Service-Oriented Computing: Semantics, Processes, Agents
Unit - 3 OBJECT ORIENTED DESIGN PROCESS AND AXIOMS
Knowledge Representation Part II Description Logic & Introduction to Protégé Jan Pettersen Nytun.
ece 720 intelligent web: ontology and beyond
Knowledge Representation
Artificial Intelligence (CS 370D)
Survey of Knowledge Base Content
Aspect Validation: Connecting Aspects and Formal Methods
Object-Oriented Knowledge Representation
University of California
KNOWLEDGE REPRESENTATION
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Artificial Intelligence 2004 Non-Classical Logics
Deniz Beser A Fundamental Tradeoff in Knowledge Representation and Reasoning Hector J. Levesque and Ronald J. Brachman.
Representations & Reasoning Systems (RRS) (2.2)
University of Manchester
Presentation transcript:

Representation of Actions in Cyc and KM RKF PI Meeting Thursday, October 18, 2001 Aarati Parmar FRG Stanford Pierluigi Miraglia Cycorp 9/19/2018 Formal Reasoning Group, Stanford University

Representation of Actions in Cyc & KM Cyc and KM (Component Library v1.0) are both logic-based ontologies with inheritance, and some non-monotonic reasoning. Compare on: Basic Temporal Formalism Action Ontology Reasoning about Change 9/19/2018 Formal Reasoning Group, Stanford University

Basic Temporal Formalism: States Basic unit of state is implemented as a microtheory/context in both: States are nested, so that facts from all super-states are visible One unique super-situation (BaseKB/*Global) housing timeless facts, visible to all situations. Cyc's holdsIn and ist-Asserted corresponds to KM's holds-in, in-situation BaseKb/ *Global s F s’ F 9/19/2018 Formal Reasoning Group, Stanford University

Basic Temporal Formalism: States KM uses situations of sitcalc (state space): Cyc has two temporal formalisms: 1. “Davidsonian” framework Action sentences are implicit existential assertions Instances of Events (subclass of Situation- Temporal) have spatio-temporal extent Slots and temporal relations (ActorSlots; startsAfterEndingOf) relate properties of actions 2. In development: Assertions modified by temporal and modal operators (possible-Historical (eats Fritz Caviar)) s F a s’ 9/19/2018 Formal Reasoning Group, Stanford University

Basic Temporal Formalism: Actions In both, actions are defined as events with a protagonist. KM actions connect situations. Has next-situation = result of sitcalc (can represent possible futures: Actions can be composed of subactions, etc. Future support for situation during the action. Cyc actions more process-like, (instances of Event have temporal extent.) 9/19/2018 Formal Reasoning Group, Stanford University

Formal Reasoning Group, Stanford University Action Ontology Action properties inherited in both Cyc and KM through hierarchy KM: uses slots and values for arbitrary properties more powerful than most frame-based languages as values can be evaluable expressions containing quantification and implication: precondition list for Move: (if (has-value (the source of Self)) then (forall (the object of Self)) (:triple It location (the source of Self))) 9/19/2018 Formal Reasoning Group, Stanford University

Formal Reasoning Group, Stanford University Action Ontology Cyc: properties formalized through Roles, ActorSlots other temporal relations employs "skolem functions" to relate objects to actions, e.g. (relationAllExists buyer Buying IntelligentAgent) how an action is done formalized through performanceLevel, rateofEvent also categorizes different temporal objects (AccomplishmentType (actions that have a completion point), etc.) 9/19/2018 Formal Reasoning Group, Stanford University

Reasoning about change: Preconditions To do progression (regression), preconditions, as well as the result of an action need to be formalized. KM uses STRIPS prec, add, delete lists to compute effects of actions. Cyc has an expressively rich set of preconditions, but they are not uniformly used (what predicate do we query to see if action a executable?). 9/19/2018 Formal Reasoning Group, Stanford University

Reasoning about change: Preconditions Cyc preconditions represented through a multitude of predicates: some ActorSlots are specific preconditions (inputs) preconditionFor-{PropSit, Events, Props, SitProp} (preSituation Event1 StaticSit2) a very weak kind of precondition necessary conditions necConditionFor- Event and necConditionFor-Scene 9/19/2018 Formal Reasoning Group, Stanford University

Reasoning about change: Results KM: STRIPS lists compute direct effect of actions a simple form of non-monotonic reasoning used to compute the inertial effects extra support for ramifications (non-inertial effects) 9/19/2018 Formal Reasoning Group, Stanford University

Reasoning about change: Results Cyc: (postSituation Event1 StaticSituation2) : closest thing to result causation between other/more general classes: eventOutcomes, causes-EventEvent, causes-SitProp, causes-ThingProp, causes-PropProp looser notion of salience: postEvents and inReactionTo, and functions STIB, STIF. Once again, a plethora of different levels of result used in Cyc, but no one used generally. 9/19/2018 Formal Reasoning Group, Stanford University

Formal Reasoning Group, Stanford University Conclusions Cyc has a rich ontology, but current formalism does not go the route of talking about the set of facts which change, like KM. KM is better qualified to infer the results of actions, for this reason, as well as the non- monotonicity built into the system. While Cyc can teach us much about actions and properties of them, KM can actually simulate these actions. 9/19/2018 Formal Reasoning Group, Stanford University

Formal Reasoning Group, Stanford University Bibliography Clark, P. and Porter, B. (1998). KM (v1.3): Users Manual. Knowledge-Based Systems Group, Univ. of Texas at Austin, Austin, Texas. Cyc. http://www.cyc.com. McCarthy, J. and Hayes, P. J. (1969). Some Philosophical Problems from the Standpoint of Artificial Intelligence. In Meltzer, B. and Michie, D., editors, Machine Intelligence 4, pages 463--502. Edinburgh University Press. 9/19/2018 Formal Reasoning Group, Stanford University