Download KNOWLEDGE REPRESENTATION: SYLLABUS University of

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Existential risk from artificial general intelligence wikipedia , lookup

Fuzzy logic wikipedia , lookup

Personal knowledge base wikipedia , lookup

Logic programming wikipedia , lookup

History of artificial intelligence wikipedia , lookup

Knowledge representation and reasoning wikipedia , lookup

Transcript
KNOWLEDGE REPRESENTATION: SYLLABUS
University of Osnabrück
SS 03
Kai-Uwe Kühnberger
Part 1. Organization
Teacher: Kai-Uwe Kühnberger
Office: 26/101 (Katharinenstr. 24)
Phone: 0541-969-6228
Office Hours: Tue 4:00 - 6:00 pm / Appointment
e-mail: [email protected]
Intended audience: Cognitive Science Bachelor
Type of course: Seminar
Intended language: English
Time of sessions: Thu 4:00 pm - 6:00 pm
Room: 01/EZ04
Purpose and Course Objectives:
The purpose of this course is to discuss and evaluate some major difficulties
and constraints for introducing a knowledge representation formalism for
different applications. Classical examples of such frameworks are natural
language, FOL, Prolog, semantic nets, frames, KL-ONE, formal concept
analysis, channel theory, situation calculus, situation theory, channel theory,
tense logic, description logics etc. The choice is dependent on what we want
to model: temporal reasoning, spatial reasoning, structural description of
objects, context change, reasoning about reasoning, classical logical inferences,
non-classical logical inferences, planning etc. Dependent on the interests of the
participants we will examine some important frameworks that can be used for
representing knowledge.
Requirements in order to pass the course:
• Presentation
• 3 assignments
• Final (take-home) exam
• Attendance and active participation
Grades: Grades are assessed on the basis of the performance concerning the
presentation, the assignments, and the final examination. The presentation
should be a 45-60 minutes talk, in order to provide enough time for discussion.
1
2
KNOWLEDGE REPRESENTATION: SYLLABUS
Criteria that can be important for assessing the performance of the presentations are:
•
•
•
•
•
•
General impression
Clarity
Enthusiasm
Usage of media
Professionalism
Response to questions
Each assignment (including the final exam) must be solved within two weeks.
Late submission is generally not accepted. Exceptions of this rule are possible.
The purpose of the assignments is to review the topics discussed in class.
The final examination is a take-home exam that must be completed in two
weeks.
Grades will be calculated as follows: 30% performance in the presentation,
40% assignments, 30% final exam.
Part 2. Tentative Schedule
1. Introduction
1.1. Introduction (10.04.2003).
• Organization
• Discussion of the tentative schedule
• Preferences of students
• What is knowledge?
• Properties of knowledge
Readings: –
Speaker: Kai-Uwe Kühnberger
1.2. What is knowledge? (17.04.2003).
• Some philosophical remarks
• Distinctions that are relevant for AI
• Some classical problems of knowledge
• Properties of knowledge
Readings: [Bi93], [Sc91], [Pu81].
Objectives of this session: We will discuss classical philosophical distinctions of theories of knowledge as well as distinctions more relevant for AI
applications. Furthermore, we will consider some puzzles of knowledge about
knowledge and start with some first frameworks.
Speaker: Kai-Uwe Kühnberger
KNOWLEDGE REPRESENTATION: SYLLABUS
3
1.3. Meeting canceled (24.04.2003).
1.4. Holiday (01.05.2003).
2. The First Frameworks
2.1. The Classical Frameworks (08.05.2003).
• Semantic nets, frames, and KL-ONE
• Relation between semantic nets and DAGs
• The logic of frames
• Ontologies
• Problems
Readings: [Bi93], [Mi75], [Sh76], [Lu90].
Objectives of this session: We will introduce several frameworks that are
important for AI. Furthermore, we will examine advantages and disadvantages
of these frameworks as well as their expressive power.
Speaker: NN (Seminar paper)
First assignment
2.2. Logical frameworks I (15.05.2003).
• Motivation of modal logic and epistemic logic
• Possible world semantics
• Some facts about modal logic and epistemic logic
• Applications in multi-agent systems
Readings: [DaMo93], [Ch80].
Objectives of this session: In this session, we will use a tutorial given at
the IJCAI-93 (International Joint Conference of Artificial Intelligence) to get
a flavor of modal logic and epistemic logic.
Speaker: NN (Seminar Paper)
2.3. Logical
Frameworks
II:
Knowledge
about
Knowledge
(22.05.2003).
• Puzzles
• Scenarios
• Modal logic representation
Reading: [BaMoSo99]
Objectives of this session: In this session, we will examine in-depth puzzles
of knowledge that can occur in multi-agent systems.
Speaker: NN (Seminar Paper)
First assignment is due
Second assignment
3. The Problem of Analogical Reasoning
3.1. Holiday (29.05.2003).
4
KNOWLEDGE REPRESENTATION: SYLLABUS
3.2. Analogies and Anti-unification (05.06.2003).
•
•
•
•
•
Analogies, similes, metaphors...
Anti-unification: What is it?
Applications in naive physics
Discussion of metaphorical expressions
Applying anti-unification to metaphors
Readings: [GuKuSc03], [Bu02], [In92].
Objectives of this session: Starting with different types of analogies
occurring in intelligence tests, literary texts, naive physics etc. we will examine
the theory of anti-unification and its applications to selected problem spaces.
Furthermore we will try to apply anti-unification to metaphorical expressions
of natural language.
Speaker: Kai-Uwe Kühnberger
3.3. Holiday (12.06.2003).
4. The Problem of Non-monotonicity
4.1. Answer sets and the preference of rules (19.06.2003).
•
•
•
•
Answer sets
Default logic
Semantics and fixed point constructions
Examples
Readings: [BrEi99]
Objectives of this session: An introduction to answer sets, fixed point
constructions, and the semantics of logical programming languages will be
given.
Speaker: NN (Seminar paper).
Second assignment is due
Third assignment
4.2. Logic programming with preferences (26.06.2003).
• Preferences of rules
• Constructing different fixed points (Wang, Delgrande, Brewka)
• A comparison of the frameworks
Readings: [ScWa01].
Objectives of this session: Using techniques of extended logic programming,
default logic, and fixed points constructions, we will compare certain accounts
towards a modeling of non-monotonic reasoning.
Speaker: NN (Seminar paper).
KNOWLEDGE REPRESENTATION: SYLLABUS
5
5. Selected Topics
5.1. Representing the flow of information I: Channels (03.07.2003).
• The crucial ideas of channel theory
• Classifications, infomorphisms, and coproducts
• Dynamics of information flow
• Applications
Readings: [BaSe97].
Objectives of this session: We will introduce the crucial ideas of a dynamic
framework that enables us to model a variety of problems. The theory
in question is called channel theory. It provides a framework that give a
conceptually sound approach towards information flow.
Speaker: NN (Seminar Paper)
Final examination
Third assignment is due
5.2. Representing the flow of information II: Applications
(10.07.2003).
• Dynamic changes of perspectives
• Modeling inferences
• Granularity
Readings: [BaSe97].
Objectives of this session: We will apply channel theory to particular
domains perennially causing problems for classical accounts.
Speaker: NN (Seminar paper).
5.3. Final Discussion (17.07.2003).
• Conclusions
Readings: –
Speaker: Plenum discussion
Final examination is due
References
[BaMoSo99]
[BaSe97]
[Bi93]
[BrEi99]
[Bu02]
[Ch80]
A. Baltag, L. Moss, and S. Solecki, The Logic of Public
Announcements,
Common Knowledge,
and Private Suspicious,
http://www.cs.indiana.edu/pub/techreports/TR534.html.
J. Barwise and J. Seligman, Information Flow. The Logic of Distributed
Systems, Cambridge 1997.
W. Bibel, Wissensreprsentation und Inferenz. Eine grundlegende
Einführung, Braunschweig, Wiesbaden 1993.
G. Brewka and T. Eiter, Preferred answer sets for extended logic programs,
Artificial Intelligence, 109(1-2), pp. 297-356, 1999.
J. Burghardt, An algebraic approach to abstraction and representation
change, Artificial Intelligence (forthcoming).
B. Chellas, Modal Logic, Cambridge University Press, 1980.
6
[DaMo93]
[GöRoSc00]
[GuKuSc03]
[In92]
[Lu90]
[Ma94]
[Mi75]
[Pu81]
[ScWa01]
[Sc91]
[Sc87]
[Sh76]
[So00]
[TuWo94]
KNOWLEDGE REPRESENTATION: SYLLABUS
E. Davies and L. Morgenstern, Epistemic Logics and their Applications,
http://www-formal.stanford.edu/leora/krcourse/.
Handbuch der Künstlichen Intelligenz, edited by G. Görz, C. Rollinger, and
J. Schneeberger, München, Wien 2000.
H. Gust, K.-U. Kühnberger, and U. Schmid, Solving predictive
analogies with anti-unification, http://www.cogsci.uni-osnabrueck.de/ helmar/analogy1.ps.
B. Indurkhya, Metaphor and Cognition. An Interactionist Approach, Dordrecht 1992.
K. von Luck, KL-One: Eine Einfhrung, IWBS Report 106, 1990.
D. Makinson, General Non-monotonic Logic, in: Handbook of Logic in
Artificial Intelligence and Logic Programming, vol.III, edited by D. Gabbay
et.al., Oxford 1994, pp.35-110.
M. Minsky, A framework for representing knowledge, in: The Psychology
of Computer Vision (etited by Winston), New York 1975, pp.211-277.
H. Putnam, Brains in a vat, in: H. Putnam: Reason, Truth, and History,
Cambridge 1981.
T. Schaub and K. Wang, A Comparative Study of Logic Programs with
Preference, Proceedings of the Seventeenth International Joint Conference
on Artificial Intelligence, 2001, pp.597-602.
P Schefe, Künstliche Intelligenz - Überblick und Grundlagen, second edition,
Mannheim, Wien, Zürich 1991.
U. Schöning, Logik für Informatiker, Mannheim 1987.
L.K. Schubert, Extending the expressive power of semantic networks, in:
Artificial Intelligence Journal, vol.7, 1996, pp. 163-198.
J. Sowa, Knowledge Representation: Logical, Philosophical, and Computational Foundations, Pacific Grove, CA 1999.
H.-P. Tuschik and H. Wolter, Mathematische Logik - kurzgefasst: Grundlagen, Modelltheorie, Entscheidbarkeit, Mengenlehre, Mannheim, Leipzig,
Wien, Zürich 1994. Tuschik/Wolter (1994): Mathematische Logik kurzgefat,
Mannheim, Leipzig 1994.