T-79.5102 Special Course in Computational Logic

Tentative Schedule (Autumn 2007)

Period I

Lecture 1 (17.9.2007): Introduction

Declarative problem solving, some terminology and notations

Lecture 2 (24.9.2007): Positive programs

Monotonic rules, answer sets, and variables

Lecture 3 (1.10.2007): Normal programs

Negation, stable models, domains, programming tips, problem solving

Lecture 4 (8.10.2007): Further primitives

Classical negation, choice rules, cardinality rules, weight rules, the SMODELS system

Lecture 5 (15.10.2007): Modelling aspects

Product configuration, principles for relation design

Lecture 6 (22.10.2007): Applications

AI Planning

Period II

Lecture 7 (5.11.2007): Complexity and approximations

Decision problems, classifications in polynomial hierarchy, well-founded semantics

Lecture 8 (12.11.2007): Implementation techniques

Dowling-Gallier method for positive programs, branch and bound, search techniques for stable models, SMODELS

Lecture 9 (19.11.2007): Equivalence checking

Weak and strong equivalence, translation-based verification, LPEQ

Lecture 10 (26.11.2007): Modular program development

Stratification, strongly connected components, modules, module theorem, modular equivalence, LPCAT, IGEN, LPEQ

Lecture 11 (3.12.2007): Relationship with propositional logic

Clark's completion, tightness, loop formulas, CMODELS

Lecture 12 (10.12.2007): Translation into propositional logic

Translating rules into clauses, LP2SAT