
Dr. Ilkka Niemelä
Professor of Computer Science, Dept. of
Computer Science, School of Science, Aalto University
Currently serving as Provost of Aalto University
Contact info for the Provost position:
Postal Address: 
Aalto University
P.0.Box 17800, FI00076 AALTO, Finland

Street address: 
Lämpömiehenkuja 2,
Aalto Otaniemi campus,
Espoo

Email: 
provostaalto.fi 
Appointments: 
Contact Executive Assistant Pia Holmberg
pia.holmbergaalto.fi,
+ 358 40 542 1546 
[Papers]
[Research]
[Software]
[Tutorials]
[Teaching]
[Conferences]
Papers
Research
Software
 lp2diff,
a translator mapping logic programs to SMT theories
implemented by Tomi Janhunen.
 Smodels, a
system for rulebased constraint programming based on logic
programs with the stable model semantics implemented in C++.
 GnT,
an implementation of disjunctive stable models on top of Smodels.
Note that this can compute also, e.g., minimal
models of sets of clauses.

BCSat
 an implementation of a tableau method for Boolean circuit
satisfiability checking done by
Tommi Junttila.

Test case generation
for minimal model and other propositional
reasoners.
 An Eclipse Prolog
implementation
of a tableaubased method for
automating circumscriptive reasoning (TABLEAUX'96, ECAI'96).
Tutorials and short courses given
 Answer Set Programming.
An invited tutorial given at
the 19th European Conference on Artificial Intelligence (ECAI 2010),
August 1620, Lisbon, Portugal.
(Slides [pdf]).
 The Implementation of Answer Set Solvers.
An invited tutorial given at
the 20th International Conference on Logic
Programming (ICLP'04), September 610, 2004, SaintMalo, France
(Slides [ps.gz]).
 AnswerSet Programming: a Declarative Knowledge Representation
Paradigm.
A tutorial given at
the 13th European Summer School in Logic, Language and Information
(ESSLLI2001), Helsinki, Finland, August 1324, 2001 together with Mirek
Truszczynski.
(Handout,
Slides).
 Practical Tools for Knowledge Representation and Nonmonotonic Reasoning.
A tutorial given at
the 17th National Conference on Artificial Intelligence,
Austin, Texas, July 30August 3, 2000 together with Mirek Truszczynski.
(Handout,
Slides
).

Stable Model Semantics: From Theory to Implementations and Applications.
An invited tutorial given at the
First International Conference on Computational Logic (CL2000),
Imperial College, London, UK, July 2428, 2000
(Handout,
Slides
).
 Smodels: a System for Answer Set Programming,
Dresden University of Technology, Department of Computer Science,
Dresden, Germany, June 57,
2000. (Short course)

Default Logic: From Theory to Applications.
A course given at
the 11th European Summer School in Logic, Language and Information
,
Utrecht University, Aug 1620, 1999.
 Proof Systems for Nonmonotonic Logics.
A tutorial given at
the 12th International Conference on Automated Deduction, Nancy, France,
June 28July 1, 1994 together with Camilla Schwind.
(Lecture Notes)
Teaching

T79.5103 Computational Complexity Theory.
This is an advanced course on computational complexity covering topics
such as NPcompleteness, randomized algorithms, cryptography,
approximation algorithms, parallel algorithms, polynomial
hierarchy, PSPACEcompleteness.

T79.5104 Advanced Course in Computational Logic.
This is an advanced course on logic and its applications in computer
science and engineering. Subjects covered:
modal logics (syntax, semantics, proof theory and computational
properties) and Current applications in computer science and
engineering.

T79.4101 Discrete Models and Search
.
The course provides an introduction to the fundamental concepts,
techniques and tools used in dealing with large, weakly structured
combinatorial search spaces. The topics covered include:
Search spaces and search methods. Backtracking, local and heuristic
search. Representing and solving search problems using
propositional satisfiability, constraint programming and integer
programming techniques.

T79.4202 Principles of Algorithmic Techniques
.
Fundamental algorithm design paradigms: divideandconquer, greedy
algorithms, dynamic programming. Randomised algorithms.
Introduction to the analysis of algorithms and the theory of
NPcompleteness.

T79.7001 Postgraduate Course in Theoretical Computer Science,
Spring 2010
.

T79.4001 Seminar on Theoretical Computer Science .
This is a seminar course covering current research topics in theoretical
computer science. The topic varies yearly.

T79.298: Postgraduate Course in Digital Systems Science, 2001 .

Tik79.144 Logic in Computer Science: Foundations,
Spring 1997.
This is an introductory course on logic and its applications in
computer science. Subjects covered are: propositional and predicate
logic, model theory, proof theory, semantic/analytic tableaux,
resolution.

Tik79.154 Logic in Computer Science: Special Topics II,
Autumn 1997.
This is an advanced course on logic and its applications in computer
science and engineering. Subjects covered in 1997 are:
advanced decision methods for propositional logic (DavisPutnam, BDDs,
stochastic methods) and for rulebased reasoning.

Tik79.230 Foundations of AgentBased Computing,
Spring 1998.
This is a course on architectures, implementation technology and
applications of agentbased systems.
Conferences involved
