DOC PREVIEW
Pitt CS 2710 - Knowledge Representation

This preview shows page 1-2-21-22 out of 22 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CS 2710, ISSP 2610KRNatural KindsUpper OntologiesPowerPoint PresentationSlide 6Categories and ObjectsFacts about categories and objects in FOLOther RelationshipsComposite ObjectsMeasuresOrdinal ComparisonsStuff versus ThingsSlide 14Actions, Situations, and Events The Situation CalculusInheritanceSemantic NetworksExampleSlide 19Slide 20Slide 21Speaking of logics1CS 2710, ISSP 2610Chapter 12Knowledge Representation2KR•Logic chapters: syntax, semantics, and proof theory of propositional and first-order logic; associated knowledge-based systems–Theorem provers•Prove sentences in FOL. Use inference rules, resolution rule, and resolution refutation–Forward and back chaning for KBs in Horn form•Chapter 12: –what content to put into an agent’s KB, i.e., how to represent knowledge of the world–special purpose representations, e.g. semantic networks and description logics3Natural Kinds•Some categories have strict definitions (triangles, squares, etc)•Natural kinds don’t•Define a cup (distinguishing it from bowls, mugs, glasses, etc)•Bachelor: is the Pope a bachelor?•But logical treatment can be useful (can extend with typicality, uncertainty, fuzziness)4Upper Ontologies•An ontology is similar to a dictionary but with greater detail and structure•Ontology: concepts, relations, axioms that formalize a field of interest•Upper ontology: only concepts that are meta, generic, abstract; cover a broad range of domain areas5AnythingAbstractObjects GeneralizedEventsSets Numbers RepresentationalObjects Interval Places PhysicalObjects ProcessesCategories Sentences Measurements Moments things stuff times weights animals agents solid liquid gasLower concepts are specializations of their parentsTo date limited success in creating shared resources6Ontology Acquisition•Manually, often by domain experts•Bootstrapping from structured sources such as Wikipedia•Bootstrapping from unstructured text documents (Information Extraction chapter later)•Crowdsourcing and Games with a purpose7Categories and Objects•I want to marry a smart woman–Category of smart woman?–A particular woman who is smart?•Choices for representing categories: predicates or reified objects•basketball(b) vs member(b,basketballs)•Let’s go with the reified version…8Facts about categories and objects in FOL•An object is a member of a category•A category is a subclass of another category•All members of a category have some properties•Members of a category can be recognized by some properties•A category as a whole has some propertiesNecessary versus sufficient properties?Note: simplification of real categories9Other Relationships•disjoint (no members in common)•exhaustive decomposition of a category (all members are in at least one of the sets)•Partition: disjoint, exhaustive decomposition10Composite Objects•partof(england,europe)•All X,Y,Z partof(X,Y) ^ partof(Y,Z)  partof(X,Z)•Heavy(bunchOf({apple1,apple2,apple3}))•Before continuing: inspiration for creative reification!•From Through the Looking Glass11Measures•Diameter(basketball12) = inches(9.5)•All XY member(X,dimestore) ^ sells(X,Y)  cost(Y) = $(1)•member(db1,dollarbills)•member(db2,dollarbills)•denomination(db1) = $(1) •denomination(db2) = $(1)There are multiple dollar bills, but a single $(1)12Ordinal Comparisons•But often scales are not so precisely defined•Often, ordinal comparisons among members of categories are useful•member(p1,poems) ^ member(p2,poems) ^ beauty(p1) < beauty(p2)We don’t have to say p1 has beauty 54.321Qualitative physics: reasoning about physical systems without detailed equations and numerical simulations.13Stuff versus Things•Suppose some ice cream and a cat in front of you. There is one cat, but no obvious number of ice-cream things in front of you.•A piece of an ice-cream thing is an ice-cream thing (until you get down to very low level)•A piece of a cat is not a cat14Stuff versus Things•Linguistically distinguished, in English through mass versus count noun phrases•“a cat”•“an ice-cream” (you have to coerce this to a thing, such as an ice-cream bar, or a variety of ice cream)•“a sand”, “an energy”•“some cat” (you have to coerce this to a substance; eeewww)15Actions, Situations, and EventsThe Situation Calculus•Previously discussed16Inheritance•If a property is true of a class, it is true of all subclasses of that class•If a property is true of a class, it is true of all objects that are members of that class•(If a property is true of a class, it is true of all objects that are members of subclasses of that class)•There are exceptions17Semantic Networks•Graphical aids for visualizing the knowledge base•Efficient algorithms for inferring properties based on category membership•Often, correspond to a subset of first-order logic•Many variants•All distinguish among individual objects, categories of objects and relations among objects18Example•See figures 12.5-12.6•Specify what edges and nodes mean•In Figure 12.5, individuals (e.g. Mary) and categories (Female Persons) look the same•memberOf(indiv,category)•sisterOf(indiv,indiv)•subsetOf(category,category)•hasMother(indiv,indiv)19Semantic Networks•How about hasMother(persons,femalePersons)?•Nope: hasMother is a relation between individuals(So, this does not say that each person has a mother)20Inheritance•Inheritance is efficient and convenient •Trace paths from individuals to categories, inheriting properties as you go•In Figure 12.5, how many legs does John have? Most specific (nearest) information wins21Semantic Networks•In a semantic network, only binary relations are possible•A richer representation is possible by reifying propositions and events (example: SNePS)•This forces creation of a rich ontology of reified concepts; many current ideas originated in semantic network systems•Also description logics, which is currently being applied to the semantic web!Speaking of logics•Modal logics for mental information•Nonmonotic logics for default


View Full Document

Pitt CS 2710 - Knowledge Representation

Documents in this Course
Learning

Learning

24 pages

Planning

Planning

25 pages

Lecture

Lecture

12 pages

Load more
Download Knowledge Representation
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Knowledge Representation and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Knowledge Representation 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?