Ilkka Niemelä

Publication Activity (10 Years)

Years Active: 1988-2020
Publications (10 Years): 2

Top Venues

CoRR

J. Comput. Syst. Sci.

Correct Reasoning

ICTAI

Publications

Jori Bomanson, Tomi Janhunen, Ilkka Niemelä
Applying Visible Strong Equivalence in Answer-Set Program Transformations. ACM Trans. Comput. Log. 21 (4) (2020)
Tomi Janhunen, Ilkka Niemelä
The Answer Set Programming Paradigm. AI Mag. 37 (3) (2016)
Tomi Janhunen, Ilkka Niemelä
Cumulativity Tailored for Nonmonotonic Reasoning. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (2015)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Classifying and Propagating Parity Constraints (extended version). CoRR (2014)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Conflict-Driven XOR-Clause Learning (extended version). CoRR (2014)
Guohua Liu, Tomi Janhunen, Ilkka Niemelä
Introducing Real Variables and Integer Objective Functions to Answer Set Programming. KDPD (2013)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Bounded Model Checking of an MITL Fragment for Timed Automata. ACSD (2013)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Bounded Model Checking of an MITL Fragment for Timed Automata CoRR (2013)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Simulating Parity Reasoning (extended version). CoRR (2013)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Simulating Parity Reasoning. LPAR (2013)
Tomi Janhunen, Ilkka Niemelä
Applying Visible Strong Equivalence in Answer-Set Program Transformations. Correct Reasoning (2012)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
SMT-Based Induction Methods for Timed Systems. FORMATS (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version) CoRR (2012)
Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä
Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78 (2) (2012)
Jussi Lahtinen, J. Valkonen, Kim Björkman, J. Frits, Ilkka Niemelä, Keijo Heljanko
Model checking of safety-critical software in the nuclear engineering domain. Reliab. Eng. Syst. Saf. 105 (2012)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
SMT-based Induction Methods for Timed Systems CoRR (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Classifying and Propagating Parity Constraints. CP (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Conflict-Driven XOR-Clause Learning. SAT (2012)
Guohua Liu, Tomi Janhunen, Ilkka Niemelä
Answer Set Programming via Mixed Integer Programming. KR (2012)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata. FMOODS/FORTE (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Extending Clause Learning SAT Solvers with Complete Parity Reasoning. ICTAI (2012)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Equivalence Class Based Parity Reasoning with DPLL(XOR). ICTAI (2011)
Ilkka Niemelä
Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems. ISMVL (2011)
Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski
Origins of Answer-Set Programming - Some Background And Two Personal Accounts CoRR (2011)
Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You
Strong Equivalence of Logic Programs with Abstract Constraint Atoms. LPNMR (2011)
Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä
Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. ACSD (2011)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search. Fundam. Informaticae 107 (2-3) (2011)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP (2011)
Tomi Janhunen, Ilkka Niemelä
Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning (2011)
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. LPNMR (2011)
Mai Nguyen, Tomi Janhunen, Ilkka Niemelä
Translating Answer-Set Programs into Bit-Vector Logic. INAP/WLP (2011)
Mai Nguyen, Tomi Janhunen, Ilkka Niemelä
Translating Answer-Set Programs into Bit-Vector Logic CoRR (2011)
Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
Extending Clause Learning DPLL with Parity Reasoning. ECAI (2010)
Kari Kähkönen, Roland Kindermann, Keijo Heljanko, Ilkka Niemelä
Experimental Comparison of Concolic and Random Testing for Java Card Applets. SPIN (2010)
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits
On Testing Answer-Set Programs. ECAI (2010)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) (2010)
Vesa Luukkala, Ilkka Niemelä
Enhancing a Smart Space with Answer Set Programming. RuleML (2010)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Partitioning Search Spaces of a Randomized Search. AI*IA (2009)
Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä
A Module-Based Framework for Multi-language Constraint Modeling. LPNMR (2009)
Kari Kähkönen, Jani Lampinen, Keijo Heljanko, Ilkka Niemelä
The LIME Interface Specification Language and Runtime Monitoring Tool. RV (2009)
Ilkka Niemelä
Integrating Answer Set Programming and Satisfiability Modulo Theories. LPNMR (2009)
Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev
Computing Stable Models via Reductions to Difference Logic. LPNMR (2009)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Incorporating Clause Learning in Grid-Based Randomized SAT Solving. J. Satisf. Boolean Model. Comput. 6 (4) (2009)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Strategies for Solving SAT in Grids by Randomized Search. AISC/MKM/Calculemus (2008)
Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
Preferences and Nonmonotonic Reasoning. AI Mag. 29 (4) (2008)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Justification-Based Non-Clausal Local Search for SAT. ECAI (2008)
Matti Järvisalo, Ilkka Niemelä
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. J. Algorithms 63 (1-3) (2008)
Ilkka Niemelä
Answer Set Programming without Unstratified Negation. ICLP (2008)
Ilkka Niemelä
Stable models and difference logic. Ann. Math. Artif. Intell. 53 (1-4) (2008)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA (2008)
Ilkka Niemelä
Stable Models and Difference Logic. ISAIM (2008)
Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski
Logic programs with monotone abstract constraint atoms. Theory Pract. Log. Program. 8 (2) (2008)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Justification-Based Local Search with Adaptive Noise Strategies. LPAR (2008)
Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170 (12-13) (2006)
Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
A Distribution Method for Solving SAT in Grids. SAT (2006)
Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. J. Satisf. Boolean Model. Comput. 2 (1-4) (2006)
Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski
Logic programs with monotone abstract constraint atoms CoRR (2006)
Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log. 7 (1) (2006)
Ilkka Niemelä
Answer Set Programming: A Declarative Approach to Solving Search Problems. JELIA (2006)
Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, Joost Vennekens
05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Unrestricted vs restricted cut in a tableau method for Boolean circuits. Ann. Math. Artif. Intell. 44 (4) (2005)
Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski
05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005)
Toni Jussila, Keijo Heljanko, Ilkka Niemelä
BMC via on-the-fly determinization. Int. J. Softw. Tools Technol. Transf. 7 (2) (2005)
Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
Prioritized Component Systems. AAAI (2005)
Tomi Janhunen, Ilkka Niemelä
GNT - A Solver for Disjunctive Logic Programs. LPNMR (2004)
Gerhard Brewka, Ilkka Niemelä, Tommi Syrjänen
Logic Programs with Ordered Disjunction. Comput. Intell. 20 (2) (2004)
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. AI&M (2004)
Misa Keinänen, Ilkka Niemelä
Solving Alternating Boolean Equation Systems in Answer Set Programming. INAP/WLP (2004)
Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
Parallel Encodings of Classical Planning as Satisfiability. JELIA (2004)
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski
Logic Programs With Monotone Cardinality Atoms. LPNMR (2004)
Keijo Heljanko, Ilkka Niemelä
Bounded LTL model checking with stable models. Theory Pract. Log. Program. 3 (4-5) (2003)
Keijo Heljanko, Ilkka Niemelä
Bounded LTL Model Checking with Stable Models CoRR (2003)
Toni Jussila, Keijo Heljanko, Ilkka Niemelä
BMC via on-the-fly determinization. Electron. Notes Theor. Comput. Sci. 89 (4) (2003)
Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
Unfolding Partiality and Disjunctions in Stable Model Semantics CoRR (2003)
Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
Answer Set Optimization. IJCAI (2003)
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski
Logic programs with monotone cardinality atoms CoRR (2003)
Patrik Simons, Ilkka Niemelä, Timo Soininen
Extending and implementing the stable model semantics. Artif. Intell. 138 (1-2) (2002)
Gerhard Brewka, Ilkka Niemelä, Tommi Syrjänen
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. JELIA (2002)
Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
On the equivalence of the static and disjunctive well-founded semantics and its computation. Theor. Comput. Sci. 258 (1-2) (2001)
Keijo Heljanko, Ilkka Niemelä
Bounded LTL Model Checking with Stable Models. LPNMR (2001)
Tommi Syrjänen, Ilkka Niemelä
The Smodels System. LPNMR (2001)
Timo Soininen, Ilkka Niemelä, Juha Tiihonen, Reijo Sulonen
Representing Configuration Knowledge With Weight Constraint Rules. Answer Set Programming (2001)
Keijo Heljanko, Ilkka Niemelä
Answer Set Programming and Bounded Model Checking. Answer Set Programming (2001)
Ilkka Niemelä, Patrik Simons, Tommi Syrjänen
Smodels: A System for Answer Set Programming CoRR (2000)
Maarit Hietalahti, Fabio Massacci, Ilkka Niemelä
DES: a Challenge Problem for Nonmonotonic Reasoning Systems CoRR (2000)
Tomi Janhunen, Ilkka Niemelä, Patrik Simons, Jia-Huai You
Unfolding Partiality and Disjunctions in Stable Model Semantics. KR (2000)
Tommi A. Junttila, Ilkka Niemelä
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. Computational Logic (2000)
Timo Soininen, Ilkka Niemelä
Developing a Declarative Rule Language for Applications in Product Configuration. PADL (1999)
Ilkka Niemelä, Patrik Simons, Timo Soininen
Stable Model Semantics of Weight Constraint Rules. LPNMR (1999)
Timo Soininen, Esther M. Gelle, Ilkka Niemelä
A Fixpoint Definition of Dynamic Constraint Satisfaction. CP (1999)
Ilkka Niemelä
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Ann. Math. Artif. Intell. 25 (3-4) (1999)
Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation. KR (1998)
Gerhard Brewka, Ilkka Niemelä
Report on the Seventh International Workshop on Nonmonotonic Reasoning. AI Mag. 19 (4) (1998)
Ilkka Niemelä, Patrik Simons
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. LPNMR (1997)
Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä
DisLoP: A Research Project on Disjunctive Logic Programming. AI Commun. 10 (3-4) (1997)
Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä
Dislop: Towards a Disjunctive Logic Programming System. LPNMR (1997)
Ilkka Niemelä
A Tableau Calculus for Minimal Model Reasoning. TABLEAUX (1996)
Ilkka Niemelä
Implementing Circumscription Using a Tableau Method. ECAI (1996)
Peter Baumgartner, Ulrich Furbach, Ilkka Niemelä
Hyper Tableaux. JELIA (1996)
Ilkka Niemelä, Patrik Simons
Efficient Implementation of the Well-founded and Stable Model Semantics. JICSLP (1996)

Ilkka Niemelä.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ilkka Niemelä