ECSEL Graduate Courses
Representation of Knowledge in AI
Course type
Research Frontiers
Periodicity
Every year.
Prerequisites
Basic undergraduate courses in Logic. An introductory course in
Artificial Intelligence is desirable but not required.
Contents
This course provides an introduction to formal knowledge representation in AI. More
specifically, we consider the problem of reasoning about action and change and its
formal characterization in logic. Conceptually, the course consists of three parts:
- In part one, we consider knowledge representation in general and a methodology
for constructing reasoners for computing inferences from a knowledge base.
- In part two, we focus on a particular application domain, that of reasoning
about action and change. We consider the historical development of the
frame, qualification, and ramification problems which arise when
reasoning about dynamical systems. We also introduce a number of approaches
to temporal reasoning and introduce the notion of preferential entailment
and its characterization in terms of circumscription. We conclude this part
of the course with a number of case studies which propose solutions to the
frame problems.
- In part three, we question the methodological practice used in the case studies
and consider a proposal by Sandewall, described in the book
Features and Fluents: A Systematic Approach to the Representation
of Knowledge about Dynamical Systems,
Erik Sandewall,
Oxford University Press, 1994.
We introduce a systematic approach for studying the knowledge representation
of dynamical systems. It is used for analyzing much of the work considered in
part two of the course, and for constructing new logics of action and change
which correct various anomalies in the case studies.
Literature
The course literature will include a collection of articles in compendium form used in
the first part and the following book used in the second part:
Features and Fluents: A Systematic Approach to the Representation
of Knowledge about Dynamical Systems,
Erik Sandewall,
Oxford University Press, 1994.
Some useful Links
- The DLS algorithm
is an algorithm for reducing second-order formulas to logically equivalent
first-order formulas. You can test the experimental interactive implementation
and try to reduce some of the circumscription axioms described in the course!
- The European Colloquium for Spatial and
Temporal Reasoning (ECSTER) is organized by the Compulog SIG for Spatial
and Temporal Reasoning and it's web page contains a plethora of useful information
relating to spatial and temporal reasoning.
- The
reasoning about actions link has been compiled by Rob Miller and contains links
to a large number of researchers actively working in the area of reasoning about
actions and time.
Further Information
Patrick Doherty
(Course Leader)
Department of Computer and Information Science
University of Linköping
S-581 83 Linköping,
SWEDEN
Phone: +46 13 28 24 26
Telefax: +46 13 28 26 06
Room: FOA A1.291
email: patdo@ida.liu.se
Lars Karlsson
(Course Assistant)
Department of Computer and Information Science
University of Linköping
S-581 83 Linköping,
SWEDEN
Phone: +46 13 28 24 28
Telefax: +46 13 28 26 06
Room: FOA A1.287
email: larka@ida.liu.se
Lise-Lott Svensson (Course Administrator)
Department of Computer and Information Science
University of Linköping
S-581 83 Linköping,
SWEDEN
Phone: +46 13 28 23 60
Telefax: +46 13 28 26 06
Room: E Bv G 474
email: lissv@ida.liu.se
23-Feb-96 16:44