Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ilkka Niemelä
2010 – today
- 2013
[i11]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: Bounded Model Checking of an MITL Fragment for Timed Automata. CoRR abs/1304.7209 (2013)- 2012
- [j24]Keijo Heljanko, Misa Keinänen, Martin Lange, Ilkka Niemelä: Solving parity games by a reduction to SAT. J. Comput. Syst. Sci. 78(2): 430-440 (2012)
- [j23]J. Lahtinen, J. Valkonen, K. Björkman, J. Frits, Ilkka Niemelä, Keijo Heljanko: Model checking of safety-critical software in the nuclear engineering domain. Rel. Eng. & Sys. Safety 105: 104-113 (2012)
- [c71]Tomi Janhunen, Ilkka Niemelä: Applying Visible Strong Equivalence in Answer-Set Program Transformations. Correct Reasoning 2012: 363-379
- [c70]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Classifying and Propagating Parity Constraints. CP 2012: 357-372
- [c69]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: SMT-Based Induction Methods for Timed Systems. FORMATS 2012: 171-187
- [c68]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata. FMOODS/FORTE 2012: 84-100
- [c67]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Extending Clause Learning SAT Solvers with Complete Parity Reasoning. ICTAI 2012: 65-72
- [c66]Guohua Liu, Tomi Janhunen, Ilkka Niemelä: Answer Set Programming via Mixed Integer Programming. KR 2012
- [c65]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Conflict-Driven XOR-Clause Learning. SAT 2012: 383-396
- [i10]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: SMT-based Induction Methods for Timed Systems. CoRR abs/1204.5639 (2012)
- [i9]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version). CoRR abs/1207.0988 (2012)
- 2011
- [j22]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Partitioning Search Spaces of a Randomized Search. Fundam. Inform. 107(2-3): 289-311 (2011)
- [c64]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä: Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. ACSD 2011: 185-194
- [c63]Tomi Janhunen, Ilkka Niemelä: Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 111-130
- [c62]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP 2011: 385-399
- [c61]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Equivalence Class Based Parity Reasoning with DPLL(XOR). ICTAI 2011: 649-658
- [c60]Ilkka Niemelä: Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems. ISMVL 2011: 139-141
- [c59]Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You: Strong Equivalence of Logic Programs with Abstract Constraint Atoms. LPNMR 2011: 161-173
- [c58]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: 242-247
- [i8]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski: Origins of Answer-Set Programming - Some Background And Two Personal Accounts. CoRR abs/1108.3281 (2011)
- [i7]Mai Nguyen, Tomi Janhunen, Ilkka Niemelä: Translating Answer-Set Programs into Bit-Vector Logic. CoRR abs/1108.5837 (2011)
- 2010
- [c57]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä: Extending Clause Learning DPLL with Parity Reasoning. ECAI 2010: 21-26
- [c56]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits: On Testing Answer-Set Programs. ECAI 2010: 951-956
- [c55]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386
- [c54]Vesa Luukkala, Ilkka Niemelä: Enhancing a Smart Space with Answer Set Programming. RuleML 2010: 89-103
- [c53]Kari Kähkönen, Roland Kindermann, Keijo Heljanko, Ilkka Niemelä: Experimental Comparison of Concolic and Random Testing for Java Card Applets. SPIN 2010: 22-39
- [e4]Tomi Janhunen, Ilkka Niemelä (Eds.): Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6341, Springer 2010, ISBN 978-3-642-15674-8
2000 – 2009
- 2009
- [j21]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Incorporating Clause Learning in Grid-Based Randomized SAT Solving. JSAT 6(4): 223-244 (2009)
- [c52]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Partitioning Search Spaces of a Randomized Search. AI*IA 2009: 243-252
- [c51]
- [c50]Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev: Computing Stable Models via Reductions to Difference Logic. LPNMR 2009: 142-154
- [c49]Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä: A Module-Based Framework for Multi-language Constraint Modeling. LPNMR 2009: 155-168
- [c48]Kari Kähkönen, Jani Lampinen, Keijo Heljanko, Ilkka Niemelä: The LIME Interface Specification Language and Runtime Monitoring Tool. RV 2009: 93-100
- [p2]Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä: Non-Clausal SAT and ATPG. Handbook of Satisfiability 2009: 655-693
- 2008
- [j20]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski: Preferences and Nonmonotonic Reasoning. AI Magazine 29(4): 69-78 (2008)
- [j19]Ilkka Niemelä: Stable models and difference logic. Ann. Math. Artif. Intell. 53(1-4): 313-329 (2008)
- [j18]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): 90-113 (2008)
- [j17]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic programs with monotone abstract constraint atoms. TPLP 8(2): 167-199 (2008)
- [c47]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA 2008: 247-261
- [c46]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: Strategies for Solving SAT in Grids by Randomized Search. AISC/MKM/Calculemus 2008: 125-140
- [c45]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Justification-Based Non-Clausal Local Search for SAT. ECAI 2008: 535-539
- [c44]
- [c43]
- [c42]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Justification-Based Local Search with Adaptive Noise Strategies. LPAR 2008: 31-46
- 2007
- [e3]Verónica Dahl, Ilkka Niemelä (Eds.): Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings. Lecture Notes in Computer Science 4670, Springer 2007, ISBN 978-3-540-74608-9
- 2006
- [j16]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12-13): 1031-1080 (2006)
- [j15]Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä: Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. JSAT 2(1-4): 27-46 (2006)
- [j14]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): 1-37 (2006)
- [c41]Ilkka Niemelä: Answer Set Programming: A Declarative Approach to Solving Search Problems. JELIA 2006: 15-18
- [c40]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä: A Distribution Method for Solving SAT in Grids. SAT 2006: 430-435
- [i6]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic programs with monotone abstract constraint atoms. CoRR abs/cs/0608103 (2006)
- 2005
- [j13]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): 373-399 (2005)
- [j12]Toni Jussila, Keijo Heljanko, Ilkka Niemelä: BMC via on-the-fly determinization. STTT 7(2): 89-101 (2005)
- [c39]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski: Prioritized Component Systems. AAAI 2005: 596-601
- [c38]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
- [c37]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
- [e2]Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski (Eds.): Nonmonotonic Reasoning, Answer Set Programming and Constraints, 24.-29. April 2005. Dagstuhl Seminar Proceedings 05171, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005
- 2004
- [j11]Gerhard Brewka, Ilkka Niemelä, Tommi Syrjänen: Logic Programs with Ordered Disjunction. Computational Intelligence 20(2): 335-357 (2004)
- [c36]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. AMAI 2004
- [c35]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä: Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. ISAIM 2004
- [c34]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä: Parallel Encodings of Classical Planning as Satisfiability. JELIA 2004: 307-319
- [c33]V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic Programs With Monotone Cardinality Atoms. LPNMR 2004: 154-166
- [c32]
- [c31]Misa Keinänen, Ilkka Niemelä: Solving Alternating Boolean Equation Systems in Answer Set Programming. INAP/WLP 2004: 134-148
- [e1]Vladimir Lifschitz, Ilkka Niemelä (Eds.): Logic Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings. Lecture Notes in Computer Science 2923, Springer 2004, ISBN 3-540-20721-X
- 2003
- [j10]Toni Jussila, Keijo Heljanko, Ilkka Niemelä: BMC via on-the-fly determinization. Electr. Notes Theor. Comput. Sci. 89(4): 561-577 (2003)
- [j9]Keijo Heljanko, Ilkka Niemelä: Bounded LTL model checking with stable models. TPLP 3(4-5): 519-550 (2003)
- [c30]
- [i5]Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You: Unfolding Partiality and Disjunctions in Stable Model Semantics. CoRR cs.AI/0303009 (2003)
- [i4]Keijo Heljanko, Ilkka Niemelä: Bounded LTL Model Checking with Stable Models. CoRR cs.LO/0305040 (2003)
- [i3]V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic programs with monotone cardinality atoms. CoRR cs.LO/0310063 (2003)
- 2002
- [j8]Patrik Simons, Ilkka Niemelä, Timo Soininen: Extending and implementing the stable model semantics. Artif. Intell. 138(1-2): 181-234 (2002)
- [c29]Gerhard Brewka, Ilkka Niemelä, Tommi Syrjänen: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. JELIA 2002: 444-455
- 2001
- [j7]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): 523-553 (2001)
- [c28]Keijo Heljanko, Ilkka Niemelä: Answer Set Programming and Bounded Model Checking. Answer Set Programming 2001
- [c27]Timo Soininen, Ilkka Niemelä, Juha Tiihonen, Reijo Sulonen: Representing Configuration Knowledge With Weight Constraint Rules. Answer Set Programming 2001
- [c26]
- [c25]
- [p1]Jürgen Dix, Ulrich Furbach, Ilkka Niemelä: Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations. Handbook of Automated Reasoning 2001: 1241-1354
- 2000
- [c24]Tommi A. Junttila, Ilkka Niemelä: Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. Computational Logic 2000: 553-567
- [c23]Tomi Janhunen, Ilkka Niemelä, Patrik Simons, Jia-Huai You: Unfolding Partiality and Disjunctions in Stable Model Semantics. KR 2000: 411-422
- [i2]Ilkka Niemelä, Patrik Simons, Tommi Syrjänen: Smodels: A System for Answer Set Programming. CoRR cs.AI/0003033 (2000)
- [i1]Maarit Hietalahti, Fabio Massacci, Ilkka Niemelä: DES: a Challenge Problem for Nonmonotonic Reasoning Systems. CoRR cs.AI/0003039 (2000)
1990 – 1999
- 1999
- [j6]Ilkka Niemelä: Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Ann. Math. Artif. Intell. 25(3-4): 241-273 (1999)
- [c22]Timo Soininen, Esther Gelle, Ilkka Niemelä: A Fixpoint Definition of Dynamic Constraint Satisfaction. CP 1999: 419-433
- [c21]Ilkka Niemelä, Patrik Simons, Timo Soininen: Stable Model Semantics of Weight Constraint Rules. LPNMR 1999: 317-331
- [c20]Timo Soininen, Ilkka Niemelä: Developing a Declarative Rule Language for Applications in Product Configuration. PADL 1999: 305-319
- 1998
- [j5]Gerhard Brewka, Ilkka Niemelä: Report on the Seventh International Workshop on Nonmonotonic Reasoning. AI Magazine 19(4): 139 (1998)
- [c19]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: 74-85
- 1997
- [j4]Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä: DisLoP: A Research Project on Disjunctive Logic Programming. AI Commun. 10(3-4): 151-165 (1997)
- [c18]Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä: Dislop: Towards a Disjunctive Logic Programming System. LPNMR 1997: 342-353
- [c17]Ilkka Niemelä, Patrik Simons: Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. LPNMR 1997: 421-430
- 1996
- [c16]
- [c15]Ilkka Niemelä, Patrik Simons: Efficient Implementation of the Well-founded and Stable Model Semantics. JICSLP 1996: 289-303
- [c14]Chandrabose Aravindan, Peter Baumgartner, Jürgen Dix, Ulrich Furbach, Gerd Neugebauer, Ilkka Niemelä, Dorothea Schäfer, Frieder Stolzenburg: On Merging Theorem Proving and Logic Programming Paradigms (Poster Abstract). JICSLP 1996: 546
- [c13]
- [c12]
- 1995
- [j3]Ilkka Niemelä: A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning. J. Autom. Reasoning 14(1): 3-42 (1995)
- [c11]
- 1994
- [j2]Ilkka Niemelä, Jussi Rintanen: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. Journal of Applied Non-Classical Logics 4(2): 141-179 (1994)
- [c10]Ilkka Niemelä: A Decision Method for Nonmomotonic Reasoning Based on Autoepistemic Reasoning. KR 1994: 473-484
- 1993
- [c9]Tomi Janhunen, Ilkka Niemelä: A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. Kurt Gödel Colloquium 1993: 211-222
- 1992
- [j1]Ilkka Niemelä: On the decidability and complexity of autoepistemic reasoning. Fundam. Inform. 17(1-2): 117-155 (1992)
- [c8]Ilkka Niemelä, Jussi Rintanen: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. ECAI Workshop on Knowledge Representation and Reasoning 1992: 275-295
- [c7]
- [c6]Ilkka Niemelä, Jussi Rintanen: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. KR 1992: 627-638
- 1991
- [c5]
- 1990
- [c4]
1980 – 1989
- 1988
- [c3]
- [c2]Ilkka Niemelä: On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. CSL 1988: 226-239
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:59 CEST by the dblp team