Ilkka Niemelä

Peer-reviewed scientific articles

Journal article-refereed, Original research

The Answer Set Programming Paradigm

Janhunen, Tomi; Niemelä, Ilkka

2016 in AI MAGAZINE (AMER ASSOC ARTIFICIAL INTELL)

ISSN: 0738-4602

Solving Parity Games by a Reduction to SAT

Heljanko, Keijo; Keinänen, Misa; Lange, Martin; Niemelä, Ilkka

2012 in JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Academic Press Inc.)

ISSN: 0022-0000

Model Checking of Safety-Critical Software in the Nuclear Engineering Domain

Lahtinen, Jussi; Valkonen, Janne; Björkman, Kim; Frits, Juho; Niemelä, Ilkka; Heljanko, Keijo

2012 in RELIABILITY ENGINEERING AND SYSTEM SAFETY (Elsevier Limited)

ISSN: 0951-8320

Partitioning Search Spaces of a Randomized Search

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2011 in FUNDAMENTA INFORMATICAE (IOS PRESS)

ISSN: 0169-2968

Incorporating Clause Learning in Grid-Based Randomized SAT Solving

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2009 in Journal on Satisfiability, Boolean Modeling and Computation (IOS PRESS)

Preferences and Nonmonotonic Reasoning

Brewka, Gerd; Niemelä, Ilkka; Truszczynski, Miroslaw

2008 in AI MAGAZINE (AMER ASSOC ARTIFICIAL INTELL)

The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving: An Experimental Study

Järvisalo, Matti; Niemelä, Ilkka

2008 in JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (Academic Press Inc.)

ISSN: 0196-6774

Programs with Monotone Abstract Constraint Atoms

Marek, Victor; Niemelä, Ilkka; Truszczynski, Miroslaw

2008 in THEORY AND PRACTICE OF LOGIC PROGRAMMING (Cambridge University Press)

Stable Models and Difference Logic

Niemelä, Ilkka

2008 in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE (SPRINGER)

Hard satisfiable clause sets for benchmarking equivalence reasoning techniques

Haanpää, Harri; Järvisalo, Matti; Niemelä, Ilkka; Kaski, Petteri

2006 in Journal of Satisfiability , Boolean Modeling and Computation (SPRINGER)

Unfolding Partiality and Disjunctions in Stable Model Semantics

Janhunen, Tomi; Niemelä, Ilkka; Seipel, Dietmar; Simons, Patrik; You, Jia-Huai

2006 in ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (Association for Computing Machinery (ACM))

ISSN: 1529-3785

Planning as satisfiability: parallel plans and algorithms for plan search

Rintanen, Jussi; Heljanko, Keijo; Niemelä, Ilkka

2006 in ARTIFICIAL INTELLIGENCE (ELSEVIER SCIENCE BV)

ISSN: 0004-3702

BMC via on-the-fly Determinization

Jussila, Toni; Heljanko, Keijo; Niemelä, Ilkka

2005 in Journal on Software Tools for Technology Transfer (ELSEVIER SCIENCE BV)

ISSN: 1443-2779

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka

2005 in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE (SPRINGER)

Logic Programs with Ordered Disjunction

Brewka, Gerhard; Niemelä, Ilkka; Syrjänen, Tommi

2004 in COMPUTATIONAL INTELLIGENCE (Wiley-Blackwell)

Bounded LTL Model Checking with Stable Models

Heljanko, Keijo; Niemelä, Ilkka

2003 in THEORY AND PRACTICE OF LOGIC PROGRAMMING (Cambridge University Press)

BMC via on-the-fly Determinization

Jussila, Toni; Heljanko, Keijo; Niemelä, Ilkka

2003 in ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (Elsevier)

Extending and implementing the stable model semantics

Simons, Patrik; Niemelä, Ilkka; Soininen, Timo

2002 in ARTIFICIAL INTELLIGENCE (ELSEVIER SCIENCE BV)

On The Equivalence of the Static and Disjunctive Well-Founded Semantics and its Computation

Brass, Stefan; Dix, Jürgen; Niemelä, Ilkka; Przymusinski, Teodor C.

2001 in THEORETICAL COMPUTER SCIENCE (ELSEVIER SCIENCE BV)

Finding maps for belief networks using rule-based constraint programming

Beaver, H.; Niemelä, I.

1999 in Arpakannus (ELSEVIER SCIENCE BV)

ISSN: 0783-3121

Logic programming with stable model semantics as a constraint programming paradigm

Niemelä, I.

1999 in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE (SPRINGER)

Logic programs with stable model semantics as a constraint programming paradigm

Niemelä, Ilkka

1999 in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE (SPRINGER)

ISSN: 1012-2443

DisLoP a research project on Disjunctive Logic Programming

Aravindan, C; Dix, J; Niemelä, Ilkka

1997 in AI COMMUNICATIONS (IOS PRESS)

ISSN: 0921-7126

A decision method for nonmonotonic reasoning based on autoepistemic reasoning

Niemelä, Ilkka

1995 in JOURNAL OF AUTOMATED REASONING (SPRINGER)

ISSN: 0168-7433

Autoepisteeminen logiikka epämonotonisen päättelyn pohjana

Niemelä, I.

1994 in TIETOJENKÄSITTELYTIEDE (SPRINGER)

On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning

Niemelä, I.; Rintanen, J.

1994 in JOURNAL OF APPLIED NON-CLASSICAL LOGICS (Taylor and Francis)

On the Decidability and Complexity of Autoepistemic Reasoning

Niemelä, I.

1992 in FUNDAMENTA INFORMATICAE (IOS PRESS)

Book section, Chapters in research books

Applying Visible Strong Equivalence in Answer-Set Program Transformations

Janhunen, Tomi; Niemelä, Ilkka

2012

ISBN: 978-3-642-30742-3

ISSN: 0302-9743

The diffusion of language change in real time: Progressive and conservative individuals and the time depth of change

Marek, Victor W.; Niemelä, Ilkka; Truszczynski, Miroslaw

2011

Origins of Answer-Set Programming - Some Background and Two Personal Accounts

Marek, Victor W.; Niemelä, Ilkka; Truszczynski, Miroslaw

2011

Non-Clausal SAT and ATPG

Drechsler, Rolf; Junttila, Tommi; Niemelä, Ilkka

2009

ISBN: 978-1-58603-929-5

Nonmonotonic Reasoning

Brewka, Gerhard; Niemelä, Ilkka; Truszczynski, Miroslaw

2008

Nonmonotonic Reasoning: towards Efficient Calculi and Implementations

Dix, Jürgen; Furbach, Ulrich; Niemelä, Ilkka

2001

Petri Net Analysis and Nonmonotonic Reasoning

Heljanko, K.; Niemelä, I.

2000

Extending the Smodels system with cardinality and weight constraints

Niemelä, I.; Simons, P.

2000 in The Springer International Series in Engineering and Computer Science (Kluwer Academic Publishers)

ISBN: 978-1-4613-5618-9

ISSN: 0893-3405

On Merging Theorem Proving and Logic Programming Paradigms

Aravindan, C.; Baumgartner, P.; Dix, J.; Furbach, U.; Neugebauer, G.; Niemelä, I.; Schäfer, D.; Stolzenburg, F.I.

1996

Autoepistemic Logic as a Basis for Automated Nonmonotonic Reasoning

Niemelä, I.

1996

On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning

Niemelä, I.; Rintanen, J.

1994

Logiikka tietämyskielenä

Niemelä, I.

1993

Conference proceedings

Cumulativity Tailored for Non-Monotonic Reasoning

Janhunen, Tomi; Niemelä, Ilkka

2015

ISBN: 978-3-319-14725-3

ISSN: 0302-9743

Introducing Real Variables and Integer Objective Functions to Answer Set Programming

Liu, Guohua; Janhunen, Tomi; Niemelä, Ilkka

2014

ISBN: 978-3-319-08908-9

Bounded Model Checking of an MITL Fragment for Timed Automata

Kindermann, Roland; Junttila, Tommi; Niemelä, Ilkka

2013

ISSN: 1550-4808

Simulating Parity Reasoning

Laitinen, Tero; Junttila, Tommi; Niemelä, Ilkka

2013

Translating Answer-Set Programs into Bit-Vector Logic

Nguyen, Mai; Janhunen, Tomi; Niemelä, Ilkka

2013

ISBN: 978-3-642-41523-4

SMT-Based Induction Methods for Timed Systems

Kindermann, Roland; Junttila, Tommi; Niemelä, Ilkka

2012

ISBN: 978-3-642-33364-4

ISSN: 0302-9743

Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata

Kindermann, Roland; Junttila, Tommi; Niemelä, Ilkka

2012

ISBN: 978-3-642-30792-8

ISSN: 0302-9743

Conflict-Driven XOR-Clause Learning

Laitinen, Tero; Junttila, Tommi; Niemelä, Ilkka

2012

ISBN: 978-3-642-31612-8

ISSN: 0302-9743

Extending Clause Learning SAT Solvers with Complete Parity Reasoning

Laitinen, Tero; Junttila, Tommi; Niemelä, Ilkka

2012 in Proceedings-International Conference on Tools With Artificial Intelligence (IEEE)

ISBN: 978-1-4799-0227-9

ISSN: 1082-3409

Classifying and Propagating Parity Constraints

Laitinen, Tero; Junttila, Tommi; Niemelä, Ilkka

2012

ISBN: 978-3-642-33557-0

ISSN: 0302-9743

Answer Set Programming via Mixed Integer Programming

Liu, Guohua; Janhunen, Tomi; Niemelä, Ilkka

2012

ISBN: 978-1-57735-560-1

Grid-Based SAT Solving with Iterative Partitioning and Clause Learning

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2011

ISSN: 0302-9743

Random vs. Structure-Based Testing of Answer-Set Programs An Experimental Comparison

Janhunen, Tomi; Niemelä, Ilkka; Oetsch, Johannes; Puehrer, Joerg; Tompits, Hans

2011 in Lecture Notes in Artificial Intelligence (Springer-verlag Berlin)

ISBN: 978-3-642-20894-2

ISSN: 0302-9743

Compact Translations of Non-Disjunctive Answer Set Programs to Propositional Clauses

Janhunen, Tomi; Niemelä, Ilkka

2011

ISSN: 0302-9743

Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks

Kindermann, Roland; Junttila, Tommi; Niemelä, Ilkka

2011

ISBN: 978-0-7695-4387-1

ISSN: 1550-4808

LCT: An Open Source Concolic Testing Tool for Java Programs

Kähkönen, Kari; Launiainen, Tuomas; Saarikivi, Olli; Kauttio, Janne; Heljanko, Keijo; Niemelä, Ilkka

2011

Equivalence Class Based Parity Reasoning with DPLL(XOR)

Laitinen, Tero; Junttila, Tommi; Niemelä, Ilkka

2011

ISBN: 978-1-4577-2068-0

ISSN: 1082-3409

Strong Equivalence of Logic Programs with Abstract Constraint Atoms

Liu, Guohua; Goebel, Randy; Janhunen, Tomi; Niemelä, Ilkka; You, Jia-Huai

2011 in Lecture Notes in Artificial Intelligence (Springer-verlag Berlin)

ISBN: 978-3-642-20894-2

ISSN: 0302-9743

Answer Set Programming A Declarative Approach to Solving Challenging Search Problems

Niemelä, Ilkka

2011

ISBN: 978-9949-23-178-2

Answer Set Programming A Declarative Approach to Solving Challenging Search Problems

Niemelä, Ilkka

2011 in International Symposium on Multiple-Valued Logic (IEEE COMPUTER SOC)

ISSN: 0195-623X

Partitioning SAT Instances for Distributed Solving

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2010 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-642-16241-1

ISSN: 0302-9743

Partitioning SAT Instances for Distributed Solving

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2010

On Testing Answer-Set Programs

Janhunen, Tomi; Niemelä, Ilkka; Oetsch, Johannes; Pührer, Jörg; Tompits, Hans

2010 in Frontiers in Artificial Intelligence and Applications (IOS PRESS)

ISBN: 978-1-60750-605-8

ISSN: 0922-6389

Experimental Comparison of Concolic and Random Testing for Java Card Applets

Kähkönen, Kari; Kindermann, Roland; Heljanko, Keijo; Niemelä, Ilkka

2010 in Lecture Notes in Computer Science (IOS PRESS)

ISBN: 978-3-642-16163-6

ISSN: 0302-9743

Extending Clause Learning DPLL with Parity Reasoning

Laitinen, Tero; Junttila, Tommi A.; Niemelä, Ilkka

2010 in Frontiers in Artificial Intelligence and Applications (IOS PRESS)

ISBN: 978-1-60750-605-8

ISSN: 0922-6389

Enhancing a Smart Space with Answer Set Programming

Luukkala, Vesa; Niemelä, Ilkka

2010 in Lecture Notes in Computer Science (IOS PRESS)

ISBN: 978-3-642-16288-6

ISSN: 0302-9743

Verification of Safety Logic Designs by Model Checking

Björkman, Kim; Frits, Juho; Valkonen, Janne; Lahtinen, Jussi; Heljanko, Keijo; Niemelä, Ilkka; Hämäläinen, Jari J.

2009

Partitioning Search Spaces of a Randomized Search

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2009 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-642-10290-5

ISSN: 0302-9743

Computing Stable Models via Reductions to Difference Logic

Janhunen, Tomi; Niemelä, Ilkka; Sevalnev, Mark

2009 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-642-04237-9

ISSN: 0302-9743

A Module-Based Framework for Multi-Language Constraint Modeling

Järvisalo, Matti; Oikarinen, Emilia; Janhunen, Tomi; Niemelä, Ilkka

2009 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-642-04237-9

ISSN: 0302-9743

A Module-Based Framework for Multi-Language Constraint Modeling

Järvisalo, Matti; Oikarinen, Emilia; Janhunen, Tomi; Niemelä, Ilkka

2009

The LIME Interface Specification Language and Runtime Monitoring Tool

Kähkönen, Kari; Lampinen, Jani; Heljanko, Keijo; Niemelä, Ilkka

2009 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-642-04693-3

ISSN: 0302-9743

Integrating Answer Set Programming and Satisfiability Modulo Theories

Niemelä, Ilkka

2009

Formal Verification of Safety Automation Logic Designs

Valkonen, Janne; Koskimies, Matti; Björkman, Kim; Heljanko, Keijo; Niemelä, Ilkka; Hämäläinen, Jari J.

2009

Strategies for Solving SAT in Grids by randomized search

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2008 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-85109-7

ISSN: 0302-9743

Incorporating Learning in Grid-Based Randomized SAT Solving

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2008 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-85775-4

ISSN: 0302-9743

Justification-Based Non-Clausal Local Search for SAT

Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka

2008 in Frontiers in Artificial Intelligence and Applications (IOS PRESS)

ISBN: 978-1-58603-891-5

Justification-Based Local Search with Adaptive Noise Strategies

Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka

2008

Justification-Based Local Search with Adaptive Noise Strategies

Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka

2008 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-89438-4

ISSN: 0302-9743

Stable Models and Difference LogicTenth International

Niemelä, Ilkka

2008

Answer Set Programming without Unstratified Negation

Niemelä, Ilkka

2008 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-89981-5

ISSN: 0302-9743

A Distribution Method for Solving SAT in Grids

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2006 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-37206-6

ISSN: 0302-9743

Bounded Model Checking, Answer Set Programming, and Fixed Points

Niemelä, Ilkka

2006

Answer Set Programming: Foundations, Implementation Techniques, and Applications

Niemelä, Ilkka

2006

Answer Set Programming: A Declarative Approach to Solving Search Problems

Niemelä, Ilkka

2006 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-39625-3

ISSN: 0302-9743

Prioritized Component Systems

Brewka, Gerd; Niemelä, Ilkka; Truszczynski, Miroslav

2005

Prioritized Component Systems

Brewka, Gerd; Niemelä, Ilkka; Truszczynski, Miroslaw

2005

Solving Alternating Boolean Equation Systems in Answer Set Programming

Keinänen, Misa; Niemelä, Ilkka

2005 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-25560-5

ISSN: 0302-9743

Answer Set Programming: an Approach to Declarative Problem Solving

Niemelä, Ilkka

2005

Mobile security - in search for comprehensive integrity

Eskelinen, Pekka; Vuorimaa, Petri; Vainikainen, Pertti; Niemelä, Ilkka; Smeds, Riitta; Tommiska, Matti; Sipilä, Markku; Hytönen, Kristiina; Tenhonen, Kati; Paloheimo, Aura

2004

GnT - A Solver for Disjunctive Logic Programs

Janhunen, Tomi; Niemelä, Ilkka

2004 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-20721-4

ISSN: 0302-9743

A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction

Järvisalo, Matti; Niemelä, Ilkka

2004

Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Järvisalo, Matti; Junttila, Tommi; Niemelä, Ilkka

2004

Programs with Monotone Cardinality Atoms

Marek, Victor; Niemelä, Ilkka; Truszczynski, Miroslaw

2004 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-20721-4

ISSN: 0302-9743

The Implementation of Answer Set Solvers

Niemelä, Ilkka

2004

Parallel Encodings of Classical Planning as Satisfiability

Rintanen, Jussi; Niemelä, Ilkka

2004 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 3-540-23242-7

ISSN: 0302-9743

Answer Set Optimization

Brewka, Gerhard; Niemelä, Ilkka; Truszczynski, Miroslaw

2003

Answer Set Programming: From Model Computation to Problem Solving

Niemelä, Ilkka

2003

Answer Set Programming: an Approach to Declarative Problem Solving

Niemelä, Ilkka

2003

ISBN: 1586033905

A Practical Tool for Mass-Customising Configurable Products

Soininen, Timo; Niemelä, Ilkka; Sulonen, Reijo

2003

Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs

Brewka, Gerd; Niemelä, Ilkka; Syrjänen, Tommi

2002 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-44190-8

ISSN: 0302-9743

Parallel Program Verification using BMC

Jussila, Toni; Niemelä, Ilkka

2002

Empirical Testing of a Weight Constraint Rule Based Configurator

Tiihonen, Juha; Soininen, Timo; Niemelä, Ilkka; Sulonen, Reijo

2002

Answer Set Programming and Bounded Model Checking

Heljanko, Keijo; Niemelä, Ilkka

2001

Bounded LTL Model Checking with Stable Models

Heljanko, Keijo; Niemelä, Ilkka

2001

Representing Configuration Knowledge With Weight Constraint Rules

Soininen, Timo; Niemelä, Ilkka; Tiihonen, Juha; Sulonen, Reijo

2001

The Smodels System

Syrjänen, Tommi; Niemelä, Ilkka

2001

DES: a Challenge Problem for Nonmonotonic Reasoning Systems

Hietalahti, M.; Massacci, F.; Niemelä, I.

2000

Unfolding Partiality and Disjunctions in Stable Model Semantics

Janhunen, T.; Niemelä, I.; Simons, P.; You, J.

2000

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

Junttila, T.; Niemelä, I.

2000 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-67797-0

ISSN: 0302-9743

Smodels: A System for Answer Set Programming

Niemelä, I.; Simons, P.; Syrjänen, T.

2000

Stable model semantics of weight constraint rules

Niemelä, Ilkka; Simons, P; Soininen, T

1999 in LECTURE NOTES IN ARTIFICIAL INTELLIGENCE (SPRINGER)

ISBN: 3-540-66749-0

ISSN: 0302-9743

On the complexity of dynamic constraint satisfaction

Niemelä, I.

1999

Developing a declarative rule language for applications in product configuration

Soininen, T; Niemelä, Ilkka

1999 in Lecture Notes in Computer Science (Springer-verlag Berlin)

ISBN: 3-540-65527-1

ISSN: 0302-9743

A fixpoint definition of dynamic constraint satisfaction

Soininen, T; Gelle, E; Niemelä, Ilkka

1999 in LECTURE NOTES IN COMPUTER SCIENCE (Springer-verlag Berlin)

ISBN: 3-540-66626-5

ISSN: 0302-9743

A comparison of the static and disjunctive well-founded semantics and its implementation

Brass, S.; Dix, J.; Niemelä, I.; Przymusinski, T.

1998

Logic programs with stable model semantics as a constraint programming framework

Niemelä, I.

1998

Formalizing configuration knowledge using rules with choises

Soininen, Timo; Niemelä, Ilkka

1998

Towards a disjunctive logic programming system

Aravindan, C.; Dix, J.; Niemelä, Ilkka

1997

DisLoP Towards a disjunctive logic programming system

Aravindan, C; Dix, J; Niemelä, Ilkka

1997 in Lecture Notes in Artificial Intelligence (Springer-verlag Berlin)

ISBN: 3-540-63255-7

ISSN: 0302-9743

Comparison and Efficient Computation of the Static and the Disjunctive

Brass, S.; Dix, J.; Przymusinski, T.; Niemelä, I.

1997

Smodels - an implementation of the stable model and well-founded semantics for normal logic programs

Niemelä, Ilkka; Simons, P

1997 in Lecture Notes in Artificial Intelligence (SPRINGER)

ISBN: 3-540-63255-7

ISSN: 0302-9743

On Merging Theorem Proving and Logic Programming Paradigms

Aravindan, C.; Baumgartner, P.; Dix, J.; Furbach, U.; Neugebauer, G.; Niemelä, I.; Schäfer, D.; Stolzenburg, F.

1996

Hyper tableaux

Baumgartner, P; Furbach, U; Niemelä, Ilkka

1996 in Lecture Notes in Artificial Intelligence (SPRINGER)

ISBN: 3-540-61630-6

ISSN: 0302-9743

A tableau calculus for minimal model reasoning

Niemelä, Ilkka

1996 in Lecture Notes in Artificial Intelligence (Springer-verlag Berlin)

ISBN: 3-540-61208-4

ISSN: 0302-9743

Efficient Implementation of the Well-founded and Stable Model Semantics

Niemelä, I.; Simons, Patrik

1996

Implementing Circumscription Using a Tableau Method

Niemelä, I.

1996

Evaluating an Algorithm for Default Reasoning

Niemelä, I.; Simons, P.

1995

Towards efficient default reasoning

Niemelä, Ilkka

1995 in INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (MORGAN KAUFMANN PUB INC)

ISBN: 1-55860-363-8

ISSN: 1045-0823

Towards Efficent Default Reasoning

Niemelä, I.

1995

A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning

Niemelä, I.

1994

A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning

Janhunen, Tomi; Niemelä, I.

1993

A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Logic

Niemelä, I.

1993

A Unifying Framework for Nonmonotonic Reasoning

Niemelä, Ilkka

1992

ISBN: 0-471-93608-1

A Decision Procedure for Stratified Autoepistemic Logic

Niemelä, I.; Rintanen, J.

1992

On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning

Niemelä, Ilkka; RINTANEN, J

1992

ISBN: 1-55860-262-3

TOWARDS AUTOMATIC AUTOEPISTEMIC REASONING

Niemelä, Ilkka

1991 in LECTURE NOTES IN ARTIFICIAL INTELLIGENCE (Springer-verlag Berlin)

ISBN: 3-540-53686-8

ON THE COMPLEXITY OF THE DECISION PROBLEM IN PROPOSITIONAL NONMONOTONIC LOGIC

Niemelä, Ilkka

1989 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-51659-0

ISSN: 0302-9743

DECISION PROCEDURE FOR AUTOEPISTEMIC LOGIC

Niemelä, Ilkka

1988 in Lecture Notes in Computer Science (SPRINGER)

ISBN: 978-3-540-19343-2

ISSN: 0302-9743

Non-refereed scientific articles

Unrefereed journal articles

Turvallisuuskriittisten järjestelmien verifiointi mallintarkastuksella

Valkonen, Janne; Niemelä, Ilkka

2010 in ATS Ydintekniikka (SPRINGER)

ISSN: 0356-0473

Unrefereed conference proceedings

Model Checking Methodology for Supporting Safety Critical Software Development and Verification

Lahtinen, Jussi; Valkonen, Janne; Björkman, Kim; Frits, Juho; Niemelä, Ilkka

2010

Model checking methodology for verification of safety logics

Valkonen, Janne; Björkman, Kim; Frits, Juho; Niemelä, Ilkka

2010

Scientific books (monographs)

Book (editor)

Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010.Proceedings

Janhunen, Tomi; Niemelä, Ilkka

2010

Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings

Dahl, Verónica; Niemelä, Ilkka

2007

ISBN: 978-3-540-74608

05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints

Brewka, Gerd; Niemelä, Ilkka; Schaub, Torsten; Truszczynski, Miroslaw; Vennekens, Joost

2005

Logic Programming and Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdate, FL, USA, January 2004, Proceedings

Lifschitz, Vladimir; Niemelä, Ilkka

2004

Publications intended for professional communities

Article in professional journal

Report on the seventh international workshop on nonmonotonic reasoning

Brewka, G.; Niemelä, I.

1998 in AI MAGAZINE (AMER ASSOC ARTIFICIAL INTELL)

Published development or research report

Analysis of an Emergency Diesel Generator Control System by Compositional Model Checking

Lahtinen, Jussi; Björkman, Kim; Valkonen, Janne; Frits, Juho; Niemelä, Ilkka

2010

Model-Based Analysis of a Stepwise Shutdown Logic

Björkman, Kim; Frits, Juho; Valkonen, Janne; Heljanko, Keijo; Niemelä, Ilkka

2009

Partitioning Search Spaces of a Randomized Search

Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

2009

Model-Based Analysis of an Arc Protection and an Emergency Cooling System - MODSAFE 2007 Working Report

Valkonen, Janne; Petterson, Ville; Björkman, Kim; Holmberg, Jan-Erik; Koskimies, Matti; Heljanko, Keijo; Niemelä, Ilkka

2008

Formal Verification of Safety I & C System Designs: Two Nuclear Power Plant Related Applications

Valkonen, Janne; Koskimies, Matti; Pettersson, Ville; Heljanko, Keijo; Holmberg, Jan-Erik; Niemelä, Ilkka

2008

NPP Safety Automation Systems Analysis - State of the Art

Valkonen, Janne; Karanta, Ilkka; Koskimies, Matti; Heljanko, Keijo; Niemelä, Ilkka; Sheridan, Dan; Bloomfield, Robin E.

2008

Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search

Rintanen, Jussi; Heljanko, Keijo; Niemelä, Ilkka

2005

Parallel encodings of classical planning as satisfiability

Rintanen, Jussi; Heljanko, Keijo; Niemelä, Ilkka

2004

Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala

Husberg, N.; Janhunen, T.; Niemelä, I.

2000

Unified Configuration Knowledge Representation Using Weight Constraint Rules.

Soininen, T.; Niemelä, I.; Tiihonen, J.; Sulonen, R.

2000

Proceedings of the HeCSE Workshop on Emerging Technologies in Distributed Systems

Niemelä, I.

1998

Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning

Niemelä, I.; Schaub, T.

1998

Formalizing configuration knowledge using rules with choices

Soininen, Timo; Niemelä, Ilkka

1998

DisLoP: a research project on Disjunctive Logic Programming

Aravindan, C.; Dix, J.; Niemelä, Ilkka

1997

Hyper Tableaux

Baumgartner, P.; Furbach, U.; Niemelä, I.

1996

A Comparison of STATIC Semantics with D-WFS

Brass, T.; Dix, J.; Niemelä, I.; Przymusinski, T.C.

1996

A Tableau Calculus for Minimal Model Reasoning

Niemelä, I.

1996

Implementing Circumscription Using a Tableau Method

Niemelä, I.

1996

Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems

Niemelä, I.

1996

Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity unto Automated Reasoning Systems

Niemelä, I.

1996

Efficient Implementation of the Well-founded and Stable Model Semantics

Niemelä, I.; Simons, P.

1996

Annual Report for the Year 1994

Niemelä, Ilkka

1995

Digital Systems Laboratory, Annual Report for the Year 1993

Niemelä, I.

1994

Autoepistemic Logic as a Unified Basis for Nonmonotonic Reasoning

Niemelä, I.

1993

Digital Systems Laboratory, Annual Report for the Year 1991

Niemelä, I.

1992