Klassische Themen der Computerwissenschaft 3 VO, 1 UE, /

Transkript

1 Klassische Themen der Computerwissenschaft 3 VO, 1 UE, / Bernhard Aichernig Oswin Aichholzer Alexander Felfernig Gerald Steinbauer Franz Wotawa Institut für Softwaretechnologie, TU Graz Inffeldgasse 16b, 2.Stock 1

2 Allgemeine Infos LV-Zeiten: VO: Mittwoch 11:45-14:00 HS i11 (Beginn 11:50) UE: Mittwoch 18:00-18:45 HS i11 (bzw nach Vereinbarung) Webseite: Zu VO / UE im TUGOnline anmelden (Frist 15.Okt). Ohne Anmeldung kein Zeugnis! 2

3 Übungen Je Block (insgesamt fünf, einer pro Vortragendem) wird ein Übungsblatt ausgegeben. Details zu den Übungen werden individuell bekannt gegeben. Jedes Übungsblatt trägt 20 % zur Übungsnote bei. Notenschlüssel: 50,01% - 62,50% genügend 62,51% - 75,00% befriedigend 75,01% - 87,50% gut 87,51% - 100,0% sehr gut 3

4 Prüfung Gesamtprüfung über alle Themenblöcke Termin am Semesterende: Mittwoch :00-20:00, i13 Weitere Termine später, je nach Bedarf 4

5 Vorläufiger Zeitplan Vorlesung :45-12:30 HS i11, Vorbesprechung :45-14:00 HS i11, VO G. Steinbauer Übung :45-14:00 HS i11, VO G. Steinbauer 18:00-18:45 HS i11, UE G. Steinbauer :45-14:00 HS i11, VO O. Aichholzer 18:00-18:45 HS i11, UE G. Steinbauer :45-14:00 HS i11, VO O. Aichholzer 18:00-18:45 HS i11, UE O. Aichholzer :45-14:00 HS i11, VO B. Aichernig 18:00-18:45 HS i11, UE A. Aichholzer :45-14:00 HS i11, VO B. Aichernig 18:00-18:45 HS i11, UE B. Aichernig Reservetermin 18:00-18:45 HS i11, UE B. Aichernig :45-14:00 HS i11, VO F. Wotawa Reservetermin :45-14:00 HS i11, VO F. Wotawa Reservetermin :45-14:00 HS i11, VO A. Felfernig 18:00-18:45 HS i11, UE F. Wotawa :45-14:00 HS i11, VO A. Felfernig 18:00-18:45 HS i11, UE A. Felfernig Reservetermin Reservetermin Reservetermin Reservetermin :00-20:00 HS i13, Prüfungstermin 5

6 Vorläufiger Zeitplan - Übungsabgaben G. Steinbauer Abgabe: :59 Abgabegespräche: O. Aichholzer Abgabe: :00 Abgabegespräche: B. Aichernig Abgabe: , 12:00 An der Tafel vorrechnen: , 18:00 F.Wotawa Abgabe: An der Tafel vorrechnen: A. Felfernig Abgabe: Abgabegespräche: :00-15:00 6

7 Überblick 1 (Aichholzer) Game theory is a rather classical topic in mathematics and computer science. We will discuss the theory about numbers and nimbers and see how to (optimal) play the chocolate game, NIM, Kayles and other classical known (and unknown) games. In the exercise part of the lecture you will develop a program which can play several thousands of mathematical games optimally. 7

8 Überblick 2 (Steinbauer) Situation Calculus is a dialog of the first order logic for representing chances in a dynamic world in a formal way. All changes are the results of actions. The state of the world is represented by situations. The key feature of the SC is that it is based on logic and therefore all tools for logic can be use. Therefore, SC allows to reason about actions, change and situation, to make proofs or to plan. The SC is not only a theoretical construct. There exist implementation like the program language Golog which can be used to program and control real systems like robots. 8

9 Überblick 2 (Steinbauer) Golog Program Macro Expansion Logic Sentence in s and S 0 Theorem Prover Basic Action Theory Situation s Constructive Proof 9

10 Überblick 3 (Aichernig) Theory of Programming: A theory of programming explores the principles that underlie the successful practise of software engineering. In this part of the course we introduce different mathematical techniques for describing programs and show how they relate. We cover specifications and their stepwise refinement, as well as denotational, algebraic and operational semantics. 10

11 Überblick (Felfernig) Constraint Programming (CP): CP is one of the closest approaches computer science has yet made to the Holy Grail of programming: the user states the problem, the computer solves it. [Freuder 1997] CP is used in many application areas such as configuration or scheduling. In this part of the course we will discuss major approaches to represent and solve constraint satisfaction problems (CSPs). The major goals are (1) to get an understanding of the basic formal properties of CSPs and (2) to be able to represent real-world problems as a corresponding CSP. 11

12 Überblick (Felfernig) Introduction history, constraint satisfaction problems Applications CSP solvers, configurators, domains Consistency node, arc, and path consistency Combining search and consistency look-ahead schemes variable and value ordering Selected topics automated debugging of constraint KBS 12

13 Überblick 5 (Wotawa) Artificial Intelligence (AI): AI is one large and active research area in computer science. Building intelligent systems that interact with other intelligent entities are of particular interest. In my part of the lecture I'll talk about special aspects of knowledge representation and reasoning. In particular I'll focus on non-monotonic reasoning and its application to diagnosis. The objectives of this part are (1) to get an impression about the state of the art in AI, (2) to get knowledge about open research issues, and (3) to understand how to represent and use knowledge to fulfill an intelligent task, i.e., fault detection and localization. 13