Knowledge Representation

Knowledge Representation
Issues, Predicate Logic, Rules
How do we represent what we know ?
• Knowledge is a general term.
An answer to the question, "how to represent knowledge", requires an analysis to distinguish between knowledge “how”
and knowledge “that”.
■ knowing "how to do something".
e.g. "how to drive a car" is Procedural knowledge.
■ knowing "that something is true or false".
e.g. "that is the speed limit for a car on a motorway" is Declarative knowledge.
• knowledge and Representation are distinct entities that play a central but distinguishable roles in intelligent
system.
■ Knowledge is a description of the world.
It determines a system's competence by what it knows.
■ Representation is the way knowledge is encoded.
It defines the performance of a system in doing something.
• Different types of knowledge require different kinds of representation.
The Knowledge Representation models/mechanisms are often based on:
◊ Logic ◊ Rules
◊ Frames ◊ Semantic Net
• Different types of knowledge require different kinds of reasoning.
03
1. Introduction
Knowledge is a general term.
Knowledge is a progression that starts with data which is of limited utility.
􀂃 By organizing or analyzing the data, we understand what the data means, and this becomes
information.
􀂃 The interpretation or evaluation of information yield knowledge.
􀂃 An understanding of the principles embodied within the knowledge is wisdom.
• Knowledge Progression

■ Data is viewed as collection of : Example : It is raining.

disconnected facts.

■ Information emerges when

relationships among facts are : Example : The temperature dropped 15
established and understood; degrees and then it started raining.
Provides answers to "who",
"what", "where", and "when".

■ Knowledge emerges when : Example : If the humidity is very high

relationships among patterns and the temperature drops substantially,
are identified and understood; then atmospheres is unlikely to hold the
Provides answers as "how" moisture, so it rains.

■ Wisdom is the pinnacle of : Example : Encompasses understanding

understanding, uncovers the of all the interactions that happen
principles of relationships that between raining, evaporation, air
describe patterns. currents, temperature
Provides answers as "why" .
Knowledge Model (Bellinger 1980)
The model tells, that as the degree of “connectedness” and
“understanding” increase, we progress from data through
information and knowledge to wisdom.

The model represents transitions and understanding.

􀂃 the transitions are from data, to information, to knowledge, and finally to wisdom;
􀂃 the understanding support the transitions from one stage to the next stage.
The distinctions between data, information, knowledge, and wisdom are not very discrete. They are
more like shades of gray, rather than black and white (Shedroff, 2001).
􀂃 data and information deal with the past; they are based on the gathering of facts and adding
context.
􀂃 knowledge deals with the present that enable us to perform.
􀂃 wisdom deals with the future, acquire vision for what will be, rather than for what is or was.
 Knowledge Type
Knowledge is categorized into two major types: Tacit and Explicit.
• term “Tacit” corresponds to informal or implicit type of knowledge,
•term “Explicit”Tacit
corresponds to formal type of knowledge.
knowledge Explicit knowledge

◊ Exists within a human being; ◊ Exists outside a human being;

it is embodied. it is embedded.

Difficult to articulate formally. ◊ Can be articulated formally

◊ Difficult to share/communicate. ◊ Can be shared, copied,
processed and stored.
.

◊ Hard to steal or copy ◊ Difficult to articulate

formally.
◊ Drawn from experience, action, ◊ Drawn from artifact of some type
subjective insight. as principle, procedure, process,
concepts
Framework of Knowledge Representation (Poole 1998)
Computer requires a well-defined problem description to process and also provide well-
defined acceptable solution.
To collect fragments of knowledge we need : first to formulate description in our spoken
language and then represent it in formal language so that computer can understand. The
computer can then use an algorithm to compute an answer. This process is illustrated below.

Note : The Problem solving requires

− formal knowledge representation, and
− conversion of informal (implicit) knowledge to formal (explicit)
knowledge.
Knowledge and Representation
Problem solving requires large amount of knowledge and
some mechanism for manipulating that knowledge.
The Knowledge and the Representation are distinct
entities, play a central but distinguishable roles in
intelligent system.
− Knowledge is a description of the world; it
determines a system's competence by what it knows.
− Representation is the way knowledge is encoded; it
defines the system's performance in doing something.
In simple words, we :
− need to know about things we want to represent , and
− need some means by which things we can manipulate.
◊ know things to represent

‡ Objects - facts about objects in the domain.

Facts about objects in our world domain. e.g. Guitars
have strings, trumpets are brass instruments.
‡ Events - actions that occur in the domain.
Actions that occur in our world. e.g. Steve Vai played
the guitar in Frank Zappa's Band.
‡ Performance - knowledge about how to do things
A behavior like playing the guitar involves knowledge
about how to do things.
‡ Meta-knowledge - knowledge about what we know
◊ need means to manipulate
‡ Requires some formalism - to what we represent ;
.
Thus, knowledge representation can be considered
at two levels :
(a) knowledge level at which facts are described, and
(b) symbol level at which the representations of the
objects, defined in terms of symbols, can be
manipulated in the programs

Note : A good representation enables fast and

accurate access to knowledge and understanding of
the content.
 Knowledge Representation Approaches

Relational Knowledge : a simple way to Inheritable Knowledge

store facts − is obtained from associated objects.
− provides a framework to compare two − it prescribes a structure in which new
objects
• based
Thereonare
equivalent attributes.
four types objects are created
of Knowledge representation which may inherit
- Relational,
− any instance in whichInferential,
two differentandobjects all or a subset of attributes from existing
Inheritable, Declarative/Procedural.
are compared is a relational type of knowledge. objects.

Inferential Knowledge Declarative Knowledge

− is inferred from objects through relations − a statement in which knowledge is specified,
among objects. but the use to which that knowledge is to be
− e.g., a word alone is a simple syntax, but with put is not given.
the help of other words in − e.g. laws, people's name; these are facts which
phrase the reader may infer more from a word; can stand alone, not dependent on other
this inference within linguistic is called knowledge;
semantics. Procedural Knowledge
− a representation in which the control
information, to use the knowledge, is
embedded in the knowledge itself.
− e.g. computer programs, directions, and
recipes; these indicate specific use or
implementation;
Relational knowledge : associates elements of one domain with another.
Used to associate elements of one domain with the elements of another
domain or set of design constrains.
− Relational knowledge is made up of objects consisting of attributes and

their corresponding associated values.

− The results of this knowledge type is a mapping of elements among

different domains.
The table below shows a simple way to store facts.
− The facts about a set of objects are put systematically in columns.

 This representation provides little opportunity for inference.

Table - Simple Relational Knowledge Player Height Weight Bats Throws

Aaron 6-0 180 Right - Right

Mays 5-10 170 Right - Right

Ruth 6-2 215 Left - Left

Williams 6-3 205 Left - Right

‡ Given the facts it is not possible to answer simple question such as :
" Who is the heaviest player ? ".
‡ But if a procedure for finding heaviest player is provided, then these
facts will enable that procedure to compute an answer.
Inheritable knowledge : elements inherit attributes
from their parents.
The knowledge is embodied in the design hierarchies found in the
functional, physical and process domains. Within the hierarchy,
elements inherit attributes from their parents, but in many cases,
not all attributes of the parent elements be prescribed to the
child elements.
− The basic KR needs to be augmented with inference mechanism, and
− Inheritance is a powerful form of inference, but not adequate.
The KR in hierarchical structure, shown below, is called “semantic
network” or a collection of “frames” or “slot-and-filler structure". It
shows property inheritance and way for insertion of additional
knowledge.
− Property inheritance : Objects/elements of specific classes
inherit attributes and values from more general classes.
− Classes are organized in a generalized hierarchy.
Baseball-player
isa : Adult-Male
Bates : EQUAL handed
Height : 6.1
Batting-average : 0.252

Viewing a node as a frame

 Algorithm : Property Inheritance
Retrieve a value V for an attribute A of an instance object O.
Steps to follow:
1. Find object O in the knowledge base.
2. If there is a value for the attribute A then report that value.
3. Else, see if there is a value for the attribute instance; If not, then fail.
4 Else, move to the node corresponding to that value and look for a value
for the attribute A; If one is found, report it.

5. Else, do until there is no value for the “isa” attribute or

until an answer is found :
(a) Get the value of the “isa” attribute and move to that node.
(b) See if there is a value for the attribute A; If yes, report it.

This algorithm is simple.

‡ It does describe the basic mechanism of inheritance.
‡ It does not say what to do if there is more than one value of the instance
or “isa” attribute.
This can be applied to the example of knowledge base illustrated to derive
answers to the following queries :
− team (Pee-Wee-Reese) = Brooklyn–Dodger
− batting–average(Three-Finger-Brown) = 0.106
− height (Pee-Wee-Reese) = 6.1
− bats(Three Finger Brown) = right
Inferential knowledge : generates new information .
Generates new information from the given information. This new
information does not require further data gathering form source, but does
require analysis of the given information to generate new knowledge.
− Given a set of relations and values, one may infer other values or relations.
− In addition to algebraic relations, a predicate logic (mathematical deduction)
is used to infer from a set of attributes.
− Inference through predicate logic uses a set of logical operations to relate
individual data. The symbols used for the logic operations are :
The symbols used for the logic operations are :
" → " (implication),
" ¬ " (not),
" V " (or),
" Λ " (and),
" ∀ " (for all),
" ∃ " (there exists).
Declarative/Procedural knowledge
Declarative knowledge :
Here, the knowledge is based on declarative facts about axioms and domains.
− axioms are assumed to be true unless a counter example is found to invalidate them.
− domains represent the physical world and the perceived functionality.
− axiom and domains thus simply exists and serve as declarative
statements that can stand alone.

Procedural knowledge:
Here the knowledge is a mapping process between domains that specifies “what to do when”
and the representation is of “how to make it” rather than “what it is”.

The procedural knowledge :

− may have inferential efficiency, but no inferential adequacy and acquisitional efficiency.
− are represented as small programs that know how to do specific things, how to proceed.

Example : a parser in a natural language has the knowledge that a noun phrase may
contain articles, adjectives and nouns. It thus accordingly call routines that know how
to process articles, adjectives and nouns.
 Four General Representation Types
• Logical Representations
• Semantic Networks
• Production Rules
• Frames
Knowledge represented as “symbol structures”
Symbol that characterize bits of knowledge about objects, concepts, facts, rules,
strategies;
examples : “red” represents colour red;
“car1” represents my car ;
"red(car1)" represents fact that my car is red.
Assumptions about KR :
− Intelligent Behavior can be achieved by manipulation of symbol structures.
− KR languages are designed to facilitate operations over symbol structures,
- have precise syntax and semantics;
Syntax tells which expression is legal ?,
e.g., red1(car1), red1 car1, car1(red1), red1(car1 & car2) ?; and
Semantic tells what an expression means ?
e.g., property “dark red” applies to my car.
− Make Inferences, draw new conclusions from existing facts.
To satisfy these assumptions about KR, we need formal notation that allow
automated inference and problem solving. One popular choice is use of logic.
Logic Representation
The Facts are claims about the world that are True or False.
Logic can be used to represent simple facts.

To build a Logic-based representation :

◊ User defines a set of primitive symbols and the associated semantics.
◊ Logic defines ways of putting symbols together so that user can
define legal sentences in the language that represent TRUE facts.
◊ Logic defines ways of inferring new sentences from existing ones.
◊ Sentences - either TRUE or false but not both are called propositions.
◊ A declarative sentence expresses a statement with a proposition as
content; example: the declarative "snow is white" expresses that snow is
white; further, "snow is white" expresses that snow is white is TRUE.
 Logic
Logic is concerned with the truth of statements about the world.
Generally each statement is either TRUE or FALSE.
Logic includes : Syntax , Semantics and Inference Procedure.
◊ Syntax :
Specifies the symbols in the language about how they can be combined to form
sentences. The facts about the world are represented as sentences in logic.
◊ Semantic :
Specifies how to assign a truth value to a sentence based on its meaning in the
world. It Specifies what facts a sentence refers to. A fact is a claim about the
world, and it may be TRUE or FALSE.
◊ Inference Procedure :
Specifies methods for computing new sentences from an existing sentences.
Note :
Facts are claims about the world that are True or False.
Representation is an expression (sentence), stands for the objects and relations.
Sentences can be encoded in a computer program.
 Logic as a KR Language
Logic is a language for reasoning, a collection of rules used while doing logical reasoning. Logic is studied
as KR languages in artificial intelligence.
◊ Logic is a formal system in which the formulas or sentences have true or false values.
◊ The problem of designing a KR language is a tradeoff between that which is :
(a) Expressive enough to represent important objects and relations in a problem domain.
(b) Efficient enough in reasoning and answering questions about implicit information in a reasonable
amount of time.
◊ Logics are of different types :
Propositional logic,
Predicate logic,
Temporal logic,
Modal logic,
Description logic etc;
They represent things and allow more or less efficient inference.
◊ Propositional logic and Predicate logic are fundamental to all logic.
Propositional Logic is the study of statements and their connectivity.
Predicate Logic is the study of individuals and their properties.
 Propositional Logic (PL)
A proposition is a statement, which in English would be a
declarative sentence. Every proposition is either TRUE or
FALSE.

Examples: (a) The sky is blue., (b) Snow is cold. , (c) 12 *

12=144
‡ propositions are “sentences” , either true or false but
not both.
‡ a sentence is smallest unit in propositional logic.
‡ if proposition is true, then truth value is "true" .
if proposition is false, then truth value is "false" .
Example :
Statement, variables and symbols
These and few more related terms, such as, connective, truth value,
contingencies, tautologies, contradictions, antecedent, consequent and argument are
explained below.
◊ Statement
Simple statements (sentences), TRUE or FALSE, that does not contain any
other statement as a part, are basic propositions; lower-case letters, p, q, r,
are symbols for simple statements.
Large, compound or complex statement are constructed from basic
propositions by combining them with connectives.
◊ Connective or Operator
The connectives join simple statements into compounds, and joins
compounds into larger compounds.
Table below indicates, five basic connectives and their symbols :
− listed in decreasing order of operation priority;
− operations with higher priority is solved first.
Example of a formula : ((((a Λ ¬b) V c → d) ↔ ¬ (a V c ))
Tautologies
A proposition that is always true is called a tautology.
e.g., (P v ¬P) is always true regardless of the truth value of the proposition P.

◊ Contradictions
A proposition that is always false is called a contradiction.
e.g., (P ∧ ¬P) is always false regardless of the truth value of the proposition P.

◊ Contingencies
A proposition is called a contingency, if that proposition is neither a tautology nor a
contradiction
e.g., (P v Q) is a contingency.

◊ Antecedent, Consequent
In the conditional statements, p → q , the
1st statement or "if - clause" (here p) is called antecedent ,
2nd statement or "then - clause" (here q) is called consequent.
34
 Summing up Propositional Logic
• It is a way of representing knowledge in a logic
and mathematical form.
• Sentences that are just not arbitrary but are facts
are either true of false nut not both are
proposition.
A => It is rainy
B => It is hot Propositions represented by
symbols

C=> It is humid
• When basic propositions are connected using
connectives it becomes Propositional logic or
PL

A => It is rainy
B => It is hot
C=> It is humid

It is humid then it is hot

=> C->B
It is hot and humid but it is not rainy
=> C ˄ B --> ᷆ A
 Predicate logic
The propositional logic, is not powerful enough for all types of assertions;
Example : The assertion "x > 1", where x is a variable, is not a proposition because it is
neither true nor false unless value of x is defined.
For x > 1 to be a proposition ,
− either we substitute a specific number for x ;

− or change it to something like

"There is a number x for which x > 1 holds";

− or "For every number x, x > 1 holds".

Consider example :
“All men are mortal.
Socrates is a man.
Then Socrates is mortal” ,
These cannot be expressed in propositional logic as a finite and logically valid argument
(formula).
We need languages : that allow us to describe properties (predicates) of objects, or a
relationship among objects represented by the variables .

Predicate logic satisfies the requirements of a language.

− Predicate logic is powerful enough for expression and reasoning.

− Predicate logic is built upon the ideas of propositional logic.

 Predicate :
Every complete sentence contains two parts: a subject and a predicate.
The subject is what (or whom) the sentence is about.
The predicate tells something about the subject;
Example :
A sentence "Judy {runs}".
The subject is Judy and the predicate is runs .
Predicate, always includes verb, tells something about the subject.
Predicate is a verb phrase template that describes a property of
objects, or a relation among objects represented by the variables.
 Predicate :
Example:
“The car Tom is driving is blue" ;
"The sky is blue" ;
"The cover of this book is blue"
Predicate is “is blue" , describes property.
Predicates are given names; Let ‘B’ is name for
predicate "is_blue".
Sentence is represented as "B(x)" , read as "x is blue";
“x” represents an arbitrary Object .
37
 Predicate Logic Quantifiers
As said before, x > 1 is not proposition and why ?
Also said, that for x > 1 to be a proposition what is required ?
Generally, a predicate with variables (is called atomic formula) can be made a proposition by applying
one of the following two operations to each of its variables :
1. Assign a value to the variable; e.g., x > 1, if 3 is assigned to x becomes 3 > 1 , and it then becomes a true statement, hence a proposition.

2. Quantify the variable using a quantifier on formulas of predicate logic (called wff ), such as x > 1 or P(x), by using Quantifiers on
variables.

Apply Quantifiers on Variables

‡ Variable x
* x > 5 is not a proposition, its truth depends upon the
value of variable x
* to reason such statements, x need to be declared
‡ Declaration x : a
* x : a declares variable x
* x : a read as “x is an element of set a”
‡ Statement p is a statement about x
*Qx:a•p is quantification of statement
Statement
declaration of variable x as element of set a

quantifier
 Predicate Logic Quantifiers

•Quantifiers are two types :

universal quantifiers , denoted by symbol

and
existential quantifiers , denoted by symbol
Universe of Discourse
The universe of discourse, also called domain of discourse or universe.
This indicates :
− a set of entities that the quantifiers deal.

− entities can be set of real numbers, set of integers, set of all cars on a parking
lot, the set of all students in a classroom etc.
− universe is thus the domain of the (individual) variables.

− propositions in the predicate logic are statements on objects of a universe .

The universe is often left implicit in practice, but it should be obvious from the
context.
Examples:
− About natural numbers forAll x, y (x < y or x = y or x > y),

there is no need to be more precise and say forAll x, y in N, because N is implicit,

being the universe of discourse.
− About a property that holds for natural numbers but not for real numbers, it is necessary to
qualify what the allowable values of x and y are.
Propositional Logic Predicate or First Order Logic

The complete sentence can be Uses predicates which involves

represented by a single symbol constants ,variable , functions.

Cannot represent the individual Beautiful(Sarah)

entities
Sarah is beautiful
Cannot express generalisation, No_of sides(triangles,3)
specialisation or patterns

All triangles have 3 sides

Representing “ IsA ” and “ Instance ” Relationships
Logic statements, containing subject, predicate, and object, were explained.
Also stated, two important attributes "instance" and "isa", in a hierarchical
structure (ref. fig. Inheritable KR). These two attributes support property
inheritance and play important role in knowledge representation.
The ways, attributes "instance" and "isa", are logically expressed are :
■ Example : A simple sentence like "Joe is a musician"
◊ Here "is a" (called IsA) is a way of expressing what logically is called
a class-instance relationship between the subjects represented by
the terms "Joe" and "musician".
◊ "Joe" is an instance of the class of things called "musician".
"Joe" plays the role of instance,
"musician" plays the role of class in that sentence.
◊ Note : In such a sentence, while for a human there is no confusion,
but for computers each relationship have to be defined explicitly.
This is specified as: [Joe] IsA [Musician]
i.e., [Instance] IsA [Class]