|
Logic |
||||||||
|
|
||||||||
Information Flow FoundationA local logic L = áinst(L), typ(L), ⊨L, ⊢L, NLñ, which is an inclusive idea combining the notions of classification and theory into a (not necessarily sound) whole, consists of 1. a theory th(L) = átyp(L), ⊢Lñ of types and constraints, 2. a classification cla(L) = áinst(L), typ(L), ⊨Lñ of instances, 3. a subset NL Í inst(L) of normal instances which satisfy all the constraints. A logic is sound when every instance of inst(L) is normal. For any local logic L, the sound part of L is obtained by throwing away all abnormal instances and restricting the classification relation to normal instances. A (sound) logic L = áinst(L), typ(L), ⊨L, ⊢Lñ consists of 1. a theory th(L) = átyp(L), ⊢Lñ of types and constraints, and 2. a classification cla(L) = áinst(L), typ(L), ⊨Lñ of instances which satisfy all the constraints. |
||||||||
OverviewThe IFF representation for the theory component of an
Information Flow logic has been dealt with in a separate discussion. Here we
are mainly concerned with the representation for the classification
component. Clearly, the specification form for a classification needs to
contain the following information: name (or id) of classification; the
instance set; the type set; and the classification relation. There are two
specification forms for Information Flow classifications. 1.
An
individual incidence in the classification relation is represented as an
implicit has relationship. For example, to make the claims that the movie
Toy_Story_(1995) is an Animation, and the movie Casablanca_(1942) is a
Romance, we use the following specification forms.
Note that
these declarations do not assert the existence of the objects (instances)
involve. In IFF the hallmark of an assertion of existence is use of the id
attribute instead of the obj attribute. The use of these declarations
is only to make a claim that the objects are of certain types. This
specification form for Information Flow logics is called the has
relationship form. As
illustrated below, any binary relation of IFF can be "entified"
(reified) by being defined in terms of the primitive has incidence
relation and the genus type for a reifying theory.
2. When a large number of incidence relationships must be asserted, an aggregate form may come in handy. This aggregate form, called the type set form, uses the Information Flow notion of the type set of an instance in a classification. The type set of an instance is represented by the typ element. For example, the following specification makes a claim for three incidence relationships.
|
||||||||
Movie Genre LogicAs an example of the “type
set” specification form for logics, consider the genre of movies. Movie genre
provides an interesting example of a binary ontological relation that can be
directly used (direct conceptual scaling) as the classification component of
an Information Flow logic. In a movie ontology movie instances can be of
several genres, and genre information is represented as a binary ontological
relation genre Í Movie´Genre. Since the binary genre
relation is between the extent (set of instances) of an object type Movie
and a controlled vocabulary Genre, it can be considered to be an
Information Flow classification with instances being movies, types being
genres, and incidence being the genre relation. o
The
theory of the logic is the controlled Genre vocabulary. This controlled
vocabulary is specified as an Information Flow theory associated with the
ontology being used. o
The
classification of the logic needs only an instance set and an incidence
relation -
The
Movie extent forms the instance set. This instance metadata may be contained
in a instance component of the entity classification of an IFF model. The
only information needed from this model is id and display information. -
The
binary genre relation is transformed by direct conceptual scaling into
the incidence relation for the classification component of the logic. This
relational instance metadata is contained in an (possibly the same) IFF model
as the model containing the instance set information. The
fact that the controlled vocabulary is a theory has implications for the
classification relation. For example, if the theory is a partial order, then
the classification relation is most likely closed (on the right) with respect
to this order. To
illustrate this, consider the following classification of 10 top-rated
movies. |
||||||||
|
|
||||||||
|
Here is the
representation as an IFF logic using the typ element. IFFOntology(located at http://www.movie.org/ontology)
Model(located at http://www.movie.org/model)
Logic – (type set form)
|
||||||||
Automobile Color LogicAs
an example of the “has
relationship” specification form for logics,
consider the following natural language description for the color of automobiles.
The color of
automobiles is naturally modeled with the binary relation
where the data type RGB represents the Red-Green-Blue
values for the color. For example, a red automobile has RGB value
"FF0000". Then the above description could be represented as an
Information Flow model with the entity classification representing the set of
automobiles and the relation classification representing the color relation. Below this is the representation
as an IFF logic using the typ element. IFFOntology(located
at http://www.automobile.org/ontology)
Model
But it is natural to define a simple color theory for this
situation, where the common colors are given names. This theory represents a controlled
vocabulary of colors. Normally one would interpret the colors with simple
conceptual scaling according to their RGB values, but for simplicity we will
assume the color binary relation has target type Color and use
direct conceptual scaling here.
Here is the new color relation.
IFFModelThe
has relation is represented by a classification using the obj attribute.
Logic – (has relationship form)
|
||||||||
|
|
||||||||
|
Please send questions, comments and suggestions
about this page to: Robert E. Kent rekent@ontologos.org |
||||||||
|
Copyright © 2000 TOC (The Ontology
Consortium). All rights reserved. Revised: July 2000 |