Cyc Jaehui Park Summarized by Jaehui Park, IDS Lab., Seoul National University Presented by Jaehui Park, IDS Lab., Seoul National University.

Slides:



Advertisements
Similar presentations
First-Order Logic Chapter 8.
Advertisements

Multi-Contextual Knowledge Base and Inference Engine
The Logic of Quantified Statements
1 Ontology Language Comparisons doug foxvog 16 September 2004.
Knowledge Representation Praveen Paritosh CogSci 207: Fall 2003: Week 1 Thu, Sep 30, 2004.
Knowledge Representation Methods
Propositional Calculus A propositional calculus formula is composed of atomic propositions, which area simply statements that are either true or false.
Logic. Propositional Logic Logic as a Knowledge Representation Language A Logic is a formal language, with precisely defined syntax and semantics, which.
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.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
9/28/98 Prof. Richard Fikes First-Order Logic Knowledge Interchange Format (KIF) Computer Science Department Stanford University CS222 Fall 1998.
Logic Programming Languages. Objective To introduce the concepts of logic programming and logic programming languages To introduce a brief description.
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.
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.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Cyc Seven Differences between Cyc and Frames Systems.
Let remember from the previous lesson what is Knowledge representation
Predicate Calculus.
03 -1 Lecture 03 First-Order Predicate Logic Topics –Syntax –Formal Semantics –Denotational Semantics –Formal Inference –Resolution.
CYC: The Common Sense Knowledge Base By: Jeremy Berman Alok Sahgal Dr. Reed CSC 550.
Ontology Mapping with Cyc doug foxvog 14 July 2004
FIRST ORDER LOGIC Levent Tolga EREN.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Knowledge Interchange Format Michael Gruninger National Institute of Standards and Technology
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.
Query Answering Based on the Modal Correspondence Theory Evgeny Zolin University of Manchester Manchester, UK
Namesys & Cyc. Namesys, Hans Reiser File system development File system is part of operating system File system puts information.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Pattern-directed inference systems
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
First-Order Logic Introduction Syntax and Semantics Using First-Order Logic Summary.
CS6133 Software Specification and Verification
Artificial Intelligence First-Order Logic (FOL). Outline of this Chapter The need for FOL? What is a FOL? Syntax and semantics of FOL Using FOL.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
lamsweerde Chap.4: Formal Requirements Specification © 2009 John Wiley and Sons Fundamentals of RE Chapter 4 Requirements.
ece 627 intelligent web: ontology and beyond
First-Order Logic. Outline Why FOL? Syntax and semantics of FOL Using FOL Knowledge engineering in FOL.
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.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
PREDICATE CALCULS In Propositional Calculus, each atomic symbol denotes a proposition. But there is no way to access the components of an individual assertion.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Knowledge Representation using First-Order Logic
First Order Logic.
Propositional Calculus: Boolean Functions and Expressions
Predicates & Quantifiers
Propositional Calculus: Boolean Functions and Expressions
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Ontology.
Logics for Data and Knowledge Representation
Patrick McCauley CMSC 691S - Semantic Web Spring 2009
Ontology.
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Cyc Jaehui Park Summarized by Jaehui Park, IDS Lab., Seoul National University Presented by Jaehui Park, IDS Lab., Seoul National University

Copyright  2008 by CEBT CycL  Declarative language Syntax derives from – first-order predicate calculus – Lisp CycL expressions – consist of Terms Constants, non-atomic terms, variables It goes far beyond first order logic – In order to express common sense 2

Copyright  2008 by CEBT Constants  The concept names in Cyc Vocabulary words in Cyc knowledge base  Starting with “#$”  Individuals #$ BillJ, #$MapleTree #$France  Collections #$Tree-ThePlant (instance of the collection)  Truth Functions Being applied to one or more concepts and return true or false Connectives – #$and,#$or, #$not, #$implies Quantifiers – #$forAll, #$thereExists  Functions Producing new terms from given ones – #$FruitFn (a type of plants -> return the collection of its fruits) 3

Copyright  2008 by CEBT Connectives & Quantification  Logical Connectives #$not, #$and, #$or #$implies – Returns true iff it is not the case that its first argument is true and its second argument is false E.g. – (#$implies (#$owns #$Fred #$Bike001) (#$colorOfObject #$Bike001 #$RedColor))  Quantification #$forAll, #$thereExists, #$thereExistExactly, #$thereExistAtLeast, #$thereExistAtMost E.g. – (#$implies (#$isa ?A #$Animal) (#$thereExists ?M (#$mother ?A ?M))) 4

Copyright  2008 by CEBT Variables  Constants whose identities are not specified  Starting with “?”  E.g. (?FOO)  E.g. (#$colorOfObject ?CAR ?COLOR)  CycFormula A formula is an expression in a formal language that makes some declarative statement about the world. – Well-formed formulas are called CycFormular – E.g. (#$likesAsFriend #$DougLenat #$KeithGoolsbey) 5

Copyright  2008 by CEBT Specialization & Generalization  Predicates #$isa – Specialization Describing the one item is an instance of some collection #$genls – Generalization Describing the one collection is a subcollection of another one  Examples (#$isa #$GeorgeBush #$UnitedStatesPresident) \; – George Bush belongs to the collection of U.S. presidents (#$genls #$Tree-ThePlant #$Plant) \; – All trees are plants (#$capitalCity #$France #$Paris) \; – Paris is the capital of France 6

Copyright  2008 by CEBT Rules  Sentence containing variables  Starting with “?”  Example (#$implies (#$and (#$isa ?OBJ ?SUBSET) (#$genls ?SUBSET ?SUPERSET)) (#$isa ?OBJ ?SUPERSET)) – If OBJ is an instance of the collection SUBSET and SUBSET is a subcollection of SUPERSET, then OBJ is an instance of the collection SUPERSET. 7

Copyright  2008 by CEBT Assertions  CYC knowledge base A large number of assertions – A formula CycFormlas – A microtheory Cyc constant denoting assertions which are grouped together because they share a set of assumptions #$Microtheroy – A truth value :#$isa, #$genls – A direction Hierarchy of “when it gets used” – A support Consists of one or more justifications which form the support the presence of the assertion in the KB. 8