Cyc Seven Differences between Cyc and Frames Systems.

Slides:



Advertisements
Similar presentations
Simplified Common Logic A flexible framework for information interchange based on first-order logic.
Advertisements

Artificial Intelligence
Dr. David A Ferrucci -- Logic Programming and AI Lecture Notes Knowledge Structures Building the Perfect Object.
OWL - DL. DL System A knowledge base (KB) comprises two components, the TBox and the ABox The TBox introduces the terminology, i.e., the vocabulary of.
Copyright © 2002 Cycorp Introduction Fundamental Expression Types Top Level Collections Time and Dates Spatial Properties and Relations Event Types Information.
Multi-Contextual Knowledge Base and Inference Engine
The Foundations: Logic and Proofs
Semantics (Representing Meaning)
Knowledge Representation
Knowledge Representation
Knowledge Representation. Essential to artificial intelligence are methods of representing knowledge. A number of methods have been developed, including:
1 Ontology Language Comparisons doug foxvog 16 September 2004.
Knowledge Representation Praveen Paritosh CogSci 207: Fall 2003: Week 1 Thu, Sep 30, 2004.
First Order Predicate Logic to English Translation.
USCISIUSCISI Frequently Asked Questions Why Don’t Instances Get Recognized? Use of “:all” Use of “:for-all” Compiling Loom Code Combining Number Restrictions.
Knowledge Representation I Suppose I tell you the following... The Duck-Bill Platypus and the Echidna are the only two mammals that lay eggs. Only birds.
Propositional Calculus A propositional calculus formula is composed of atomic propositions, which area simply statements that are either true or false.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Overview of Cyc Tom O'Hara NMSU AI Seminar 18 February 2002.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Copyright © 2002 Cycorp Introduction Fundamental Expression Types Top Level Collections Time and Dates Spatial Properties and Relations Event Types Information.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
Copyright © 2002 Cycorp The Basics Arity Argument Types Second-Order Predicates More on Functions Predicates and Denotational Functions.
Copyright © 2002 Cycorp The Basics Arity Argument Types Second-Order Predicates More on Functions Predicates and Denotational Functions.
Propositional Logic Agenda: Other forms of inference in propositional logic Basics of First Order Logic (FOL) Vision Final Homework now posted on web site.
02 -1 Lecture 02 Agent Technology Topics –Introduction –Agent Reasoning –Agent Learning –Ontology Engineering –User Modeling –Mobile Agents –Multi-Agent.
CYC: The Common Sense Knowledge Base By: Jeremy Berman Alok Sahgal Dr. Reed CSC 550.
Ontology Mapping with Cyc doug foxvog 14 July 2004
Review Topics Test 1. Background Topics Definitions of Artificial Intelligence & Turing Test Physical symbol system hypothesis vs connectionist approaches.
QUIRK: QUestion Answering = Information Retrieval + Knowledge Cycorp IBM Presenter: Stefano Bertolo (Cycorp)
Artificial intelligence project
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
Building an Ontology of Semantic Web Techniques Utilizing RDF Schema and OWL 2.0 in Protégé 4.0 Presented by: Naveed Javed Nimat Umar Syed.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Namesys & Cyc. Namesys, Hans Reiser File system development File system is part of operating system File system puts information.
1.  Provides the ability to access individual assertions. e.g. in Predicate calculus we may say: P denotes “It rained on Tuesday” but in predicate calculus.
11 Artificial Intelligence CS 165A Thursday, November 1, 2007  First-order logic (Ch 8)  Inference in FOL (Ch 9) 1.
Srihari Sadagoparamanujam. Agenda IntroductionCharacteristicsCYC.
General Knowledge Ontological background for everything.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Artificial Intelligence Chapter 18. Representing Commonsense Knowledge.
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.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
More on Description Logic(s) Frederick Maier. Note Added 10/27/03 So, there are a few errors that will be obvious to some: So, there are a few errors.
9/30/98 Prof. Richard Fikes Inference In First Order Logic Computer Science Department Stanford University CS222 Fall 1998.
DL Overview Second Pass Ming Fang 06/19/2009. Outlines  Description Languages  Knowledge Representation in DL  Logical Inference in DL.
KNOWLEDGE BASED SYSTEMS
EEL 5937 Ontologies EEL 5937 Multi Agent Systems Lotzi Bölöni.
The Syntax of CycL. CycL is a formal language whose syntax derives from first-order predicate calculus (the language of formal logic) and from Lisp. In.
First-Order Logic Reading: C. 8 and C. 9 Pente specifications handed back at end of class.
Copy right 2004 Adam Pease permission to copy granted so long as slides and this notice are not altered Ontology Overview Introduction.
Cyc Jaehui Park Summarized by Jaehui Park, IDS Lab., Seoul National University Presented by Jaehui Park, IDS Lab., Seoul National University.
Artificial Intelligence Knowledge Representation.
KNOWLEDGE REPRESENTATION Ziyang Lin March 17, 2011.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
OKBC (Open Knowledge Base Connectivity) An API For Knowledge Servers
Karen Wickett School of Information University of Texas at Austin
Representation of Actions in Cyc and KM
Survey of Knowledge Base Content
Ontology.
Knowledge Representation and Inference
Ernest Davis Automating Commonsense Reasoning for Science
Deniz Beser A Fundamental Tradeoff in Knowledge Representation and Reasoning Hector J. Levesque and Ronald J. Brachman.
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Presentation transcript:

Cyc Seven Differences between Cyc and Frames Systems

Overview I.Cyc: an “ontology editor” and more II.CycL: more expressive than frames III.OE: “Editing the ontology” A.the traditional way B.through natural language

More than an “ontology editor” Knowlege Base (KB) –commonsense knowledge –not-so-commonsense knowledge Inference –Modus Ponens: P implies Q; P; hence, Q. –HL modules: specialized reasoners Natural Language Processing –parsing: English to CycL –generation: CycL to English

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

1. Constants not OOP objects Constants –entities: #$OsamaBinLaden, #$Texas –collections: #$Pizza, #$NaturalNumber –predicates: #$likesAsFriend, #$isa, #$genls –functions: #$GovernmentFn, #$MotherFn –quantifiers: #$forAll, #$thereExists The meaning of a constant: –The set of sentences in the KB involving it –NOT the set of its slot values

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

2. >binary predicates in Cyc #$behaviorCapable, for example –#$arity: 3 –#$arg1Isa: #$SomethingExisting –#$arg2Isa: #$Collection –#$arg2Genl: #$Situation-Temporal –#$arg3Isa: #$Role (#$behaviorCapable #$Bill #$Swimming #$performedBy)

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

3. Quantifiiers in Cyc (forAll ?X (implies (isa ?X Woman) (thereExists ?Y (and (isa ?Y Man) (loves ?Y ?X))))) not possible with frames

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

4. Modals in Cyc #$beliefs, for example: (#$beliefs #$Pierre (#$equals #$SexualArousal #$Pity)) (Cyc Assertion ) not possible with frames

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

5. Meta-Assertions in Cyc (#$salientAssertions #$Roland M (#$fanOf #$Roland #$KingCrimson-MusicGroup))) not possible with frames –b/c there is no assertion object to refer to

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

6. Self-Referentiality Assertions about Cyc(L), in Cyc(L) –#$arg1Isa, #$arg2Isa, #$arity –#$Relation, #$Quantifier, #$EL-Variable –#$SymmetricBinaryPredicate –#$InferenceRelatedBookkeepingPredicate –#$CycL –#$Cyc

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

7. Implicit inverses Inverses: for example –(#$mother ?kid ?mom) = kid’s mother is mom –(#$motherOf ?mom ?kid) = ditto –so #$motherOf and #$mother are inverses Can be implicitly represented in CycL In a frames system, you have to explicitly represent the inverse of every predicate, which is wasteful.

CycL vs. Frames 1.concepts not OOP objects 2.more-than-binary relations 3.quantifiers 4.modals 5.meta-assertions, order infinity (?) logic 6.self-referentiality 7.implicit representation of inverses

Now let’s play