Dr. Ilkka Niemelä

Postal Address:	Helsinki University of Technology Dept. of Information and Computer Science P.O.Box 5400, FI-02015 TKK, Finland
Street address:	Konemiehentie 2, Otaniemi, Espoo
Telephone:	+358-9-470 23290
Fax:	+358-9-470 23369
Email:	Ilkka.Niemelatkk.fi
Office:	Room T-B337
Office hour:	Mondays 12:00-13:00 o'clock

• Brief Biography

• Tiivistelmä virkaanastujaisesitelmästä 19.9.2000: Laskennallinen logiikka - soveltavaa tietojenkäsittelyteoriaa
  (Summary of the inauguration talk Sep 19, 2000: Computational logic - applied theoretical computer science; in Finnish)

• Scientific Positions of Trust
  • Editorial board member of Theory and Practice of Logic Programming
  • Editorial board member of Journal of Artificial Intelligence Research
  • Member of the Executive Committee of the Association for Logic Programming (ALP)
  • Steering Committee Member of the International Workshops on Nonmonotonic Reasoning
  • Steering Committee Member of the International Conferences on Logic Programming and Nonmonotonic Reasoning
  • Steering Committee Member of the ESF Research Networking Program on Games for Design and Verification (GAMES)
  • Management Committee Member of the COST Action IC0901: Rich-Model Toolkit - An Infrastructure for Reliable Computer System

Papers

• Papers Online
• List of Publications

Research

• Head of the Computational Logic Group in the Department of Information and Computer Science
  
• Research interests
  • knowledge representation, default reasoning, logic programming
  • automated reasoning, satisfiability checking, constraint satisfaction
  • computer-aided verification, symbolic model checking, automated testing
  • computational complexity
• Projects
  • LightweIght formal Methods for distributed component-based Embedded systems (LIME2) 2009-2011
  • Symbolic Testing and Model Checking of Distributed Embedded Systems (StMcDes) 2009-2012
  • Methods for Constructing and Solving Large Constraint Models (MCM) 2008-2011
  • LightweIght formal Methods for distributed component-based Embedded systems (LIME) 2007-2009 (publications)
  • Model-Based Safety Evaluation of Automation Systems (MODSAFE) 2007-2011
  • Symbolic Methods for UML Behavioural Diagrams (SMUML) 2005-2007
  • Advanced Constraint Programming Techniques for Large Structured Problems (ACPT) 2005-2007
  • Working group on Answer Set Semantics (The Computational Logic group is the leader of Work package 3: Language Extensions and Software Engineering for ASP )
  • Applications of Rule-Based Constraint Programming 2002-2005
  • Formal Methods in Distributed Systems 2000-2002
  • Constraint Programming Based on Default Rules 1998-2001
  • Conformance Testing and Bounded Model Checking 2002
  • Analysis and Development of Cryptosystems 2001-2005
  • Security in Mobile Ad-hoc Networks, 2001

Software

• Smodels, a system for rule-based 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 tableau-based method for automating circumscriptive reasoning (TABLEAUX'96, ECAI'96).

Tutorials and short courses given

• The Implementation of Answer Set Solvers. An invited tutorial given at the 20th International Conference on Logic Programming (ICLP'04), September 6-10, 2004, Saint-Malo, France (Slides [ps.gz]).
• Answer-Set Programming: a Declarative Knowledge Representation Paradigm. A tutorial given at the 13th European Summer School in Logic, Language and Information (ESSLLI-2001), Helsinki, Finland, August 13-24, 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 30-August 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 24-28, 2000 (Handout, Slides ).
• Smodels: a System for Answer Set Programming, Dresden University of Technology, Department of Computer Science, Dresden, Germany, June 5--7, 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 16-20, 1999.
• Proof Systems for Nonmonotonic Logics. A tutorial given at the 12th International Conference on Automated Deduction, Nancy, France, June 28-July 1, 1994 together with Camilla Schwind. (Lecture Notes)

Teaching

• T-79.5103 Computational Complexity Theory. This is an advanced course on computational complexity covering topics such as NP-completeness, randomized algorithms, cryptography, approximation algorithms, parallel algorithms, polynomial hierarchy, PSPACE-completeness.
• T-79.4201 Search Problems and Algorithms . 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.
• T-79.5101 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 applications of temporal logic in concurrent and distributed systems.
• T-79.7001 Postgraduate Course in Theoretical Computer Science, Autumn 2007 .
• T-79.4001 Seminar on Theoretical Computer Science . This is a seminar course covering current research topics in theoretical computer science. The topic varies yearly.
• T-79.298: Postgraduate Course in Digital Systems Science, 2001 .
• Tik-79.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.
• Tik-79.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 (Davis-Putnam, BDDs, stochastic methods) and for rule-based reasoning.
• Tik-79.230 Foundations of Agent-Based Computing, Spring 1998. This is a course on architectures, implementation technology and applications of agent-based systems.

Conferences involved

• As PC Chair
• As PC Member
• As Invited/tutorial speaker