LM01 - Introduction to knowledge representation
LM01 - Introduction to knowledge representation
Lecture 1
Introduction
1
Overview
n Lecture time:
g See “Course Syllabus” for details…
g Lecture pre-recordings, on occasions…
n Office times: Sunday 10:00AM, Monday 1:30PM (By
appointment preferable)
n Assignments:
g 1 major.
Implementation of a solver
Implementing Expert system
Implementing Ontology system
Theoretical study, presentation, and discussion of research papers
(select your preferred choice)
2
Overview
n Aims
g Development of skills in Knowledge
Representation & Reasoning
3
Overview
n Prerequisites:
g Artificial Intelligence
· Search Algorithms
g Logic
· Propositional & First Order Logic
g Algorithms & Data Structures
· Algorithmic Complexity
g Programming!
· C C++ Java, python
4
Overview
n Bibliography:
g General stuff on AI
· Artificial Intelligence: A Modern Approach, Russell & Norvig
· http://www.cs.berkeley.edu/~russell/aima.html
· http://aima.cs.berkeley.edu/
5
ΑΙ and KR
n A description of Artificial
Intelligence is:
g The study and development of systems
that demonstrate intelligent behavior
6
What is KR&R?
n There are many ways to approach the topic of intelligence and
intelligent behavior
g neuroscience, psychology, evolution, philosophy
n KR suggests an approach to understanding intelligent behavior that is
radically different
g Instead of studying humans very carefully (biology, nervous systems,
psychology, sociology, etc.), it argues that what we need to study is what
humans know.
g It is taken as given that what allows humans to behave intelligently is that they
know a lot of things about a lot of things and are able to apply this knowledge as
appropriate to adapt to their environment and achieve their goals.
8
9
What is Intentional Stance?
n A philosophical concept introduced by Daniel Dennett that
is relevant to Knowledge Representation and Reasoning
(KR&R) in AI.
13
14
15
& Reasoning
n What is reasoning? In general, it is the formal manipulation of the
symbols representing a collection of believed propositions to produce
representations of new ones.
g Here that we use the fact that symbols are more accessible than the propositions
they represent: They must be concrete enough that we can manipulate them
(move them around, take them apart, copy them, string them together) in such a
way as to construct representations of new propositions.
· We might start with the sentences “John loves Mary” and “Mary is coming to the
party” and after a certain amount of manipulation produce the sentence, “Someone
John loves is coming to the party”
· We would call this form of reasoning logical inference because the final sentence
represents a logical conclusion of the propositions represented by the initial ones.
n Reasoning is a form of calculation, not unlike arithmetic, but over
symbols standing for propositions rather than numbers.
16
17
How can knowledge be represented ?
n Symbolic methods
g Declarative Languages (Logic)
g Imperative Languages (C, C++, Java, etc.)
g Hybrid Languages (Prolog)
g Rules
g Frames
g Semantic Networks
g …
n Non-symbolic methods
g Neural Networks
g Genetic Algorithms
18
Symbolic Methods of Knowledge
Representation
Natural Language
Frames
First-order Logic
Semantic Networks
Non-monotonic Logic
Rules Hybrid systems
Constraints Fuzzy Logic
XML/RDF Prolog Bayes Networks
Ontologies Description Logics
C/C++/Java
Scripts Propositional Logic
19
Types of Knowledge
n Declarative Knowledge
g Description of notions, facts, and rules of the world
n E.g.
g For each lecture there is a specific time and place
g Only one lecture can take place at each time and place
20
Types of Knowledge
n Procedural Knowledge
g Description of procedures required to achieve targets
g Knowledge of the order in which actions must be performed
g Heuristic knowledge
n E.g.
g To construct the exams timetable, assign first the classes of the first year
g To reach Athens faster, take the airplane
21
Types of Knowledge
n Basic Difference
g declarative knowledge is right or wrong
· Lectures are on Wednesdays
g procedural knowledge can be executed
· the procedure of constructing the exams timetable
Knowledge Representation
&
n Which of the two interests us? Reasoning
g Both of course
22
The Language of Propositional Logic
n Before any system aspiring to intelligence can even begin to reason,
learn, plan, or explain its behavior, it must be able to formulate the
ideas involved.
g You will not be able to learn something about the world around you, for
example, if it is beyond you to even express what that thing is.
24
Semantics of a KR language
n We need to specify what the well-formed expressions are supposed to
mean.
g Some well-formed expressions like “the recently divorced decimal holiday”
might not mean anything. We need to be clear about what idea about the world
is being expressed.
n The semantics determine a mapping between symbols, combinations
of symbols, propositions of the language and concepts of the world to
which they refer
25
Knowledge Representation Languages
n An expression is true under a certain interpretation if the
facts of the real world that it represents are valid.
n We say that a proposition (α) is entailed by a set of
propositions (s) when whenever the set of propositions s is
true then α is true.
g entailment is usually notated by s |= α
entails
proposition proposition
Representation semantics semantics
Real world
fact fact
entails
KNOWLEDGE REPRESENTATION & 26
REASONING - Lecture 1
Desired Features of KR languages
n Epistemological Level
g Clarity
g Expressiveness
n Logical Level CONFLICT !
g Elegant syntax & semantics
g Decidability / Tractability
g Sound and complete inference mechanism
n Implementation Level
g Space & Time efficiency
g Extensibility
27
Chapter 16. The Tradeoff between Expressiveness and Tractability
DOI: 10.1016/B978-155860932-7/50101-1
In book: Knowledge Representation and Reasoning, Ronald J. BrachmanHector J. Levesque
n This chapter begins with a simple description language and reveals how a very
small change in its expressiveness completely changes the sort of reasoning
procedure it requires. It also considers the idea of languages in a more limited way
than first-order logic (FOL) and examines what seems to happen as they are
generalized to full FOL. To illustrate the tradeoff between expressiveness and
tractability it begins by examining a very concrete case involving description logics
and the subsumption task. It suggests that one way of dealing with the tradeoff is to
allow very expressive languages, but to preserve tractability by doing a form of
reasoning that is somehow less demanding. Researchers have proposed alternative
logical systems with weaker notions of entailment that might be candidates for
exploration of limited reasoning with expressive representation languages. The
tradeoff between expressiveness and complexity is so fundamental to the
understanding of knowledge representation and reasoning the chapter also
concentrates on that issue and leaves aside the consideration of weak logics.
proof method
· computational & representational problems
g 1970s: Rivals emerge (semantic networks, rules, frames)
· unclear semantics & inference
g 1975: Logic Programming (Kowalski)
· decrease expressivity to increase efficiency
· declarative & procedural knowledge in one language
g 1980…: Non-monotonic reasoning (McCarthy, Reiter)
· common sense knowledge
30
Advantages of Logic for KR
n Like all declarative languages:
g compact
g task-independent
g modular representation
g reusable, flexible, maintainable
n Logic has formal well-defined semantics
n Logic is expressive
g incomplete knowledge
g temporal logics
g second order logic
g …
31
Disadvantages of Logic for KR
n Inefficiency !!!
g implementation level
n Difficulty in describing procedural knowledge
32
Logic-based Reasoners
n Knowledge Representation Languages based on Logic
SAT solvers
g Propositional logic
g First order logic Theorem Provers
g Answer set programming ASP solvers
g Prolog
SICStus Prolog
ECLiPSe Prolog at ECRC
ECLiPSe Prolog at IC-PARC
CIAO Prolog
XSB Prolog
Yap Prolog
CHIP
33