Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlkka Niemelä
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[p3]Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä:
Non-Clausal SAT and ATPG. Handbook of Satisfiability 2021: 1047-1086- 2020
- [j25]Jori Bomanson
, Tomi Janhunen, Ilkka Niemelä:
Applying Visible Strong Equivalence in Answer-Set Program Transformations. ACM Trans. Comput. Log. 21(4): 33:1-33:41 (2020)
2010 – 2019
- 2016
- [j24]Tomi Janhunen, Ilkka Niemelä:
The Answer Set Programming Paradigm. AI Mag. 37(3): 13-24 (2016) - 2015
- [c74]Tomi Janhunen, Ilkka Niemelä:
Cumulativity Tailored for Nonmonotonic Reasoning. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 96-111 - 2014
- [i16]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Classifying and Propagating Parity Constraints (extended version). CoRR abs/1406.4698 (2014) - [i15]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Conflict-Driven XOR-Clause Learning (extended version). CoRR abs/1407.6571 (2014) - 2013
- [c73]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Bounded Model Checking of an MITL Fragment for Timed Automata. ACSD 2013: 216-225 - [c72]Guohua Liu, Tomi Janhunen, Ilkka Niemelä:
Introducing Real Variables and Integer Objective Functions to Answer Set Programming. KDPD 2013: 118-135 - [c71]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Simulating Parity Reasoning. LPAR 2013: 568-583 - [i14]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Bounded Model Checking of an MITL Fragment for Timed Automata. CoRR abs/1304.7209 (2013) - [i13]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Simulating Parity Reasoning (extended version). CoRR abs/1311.4289 (2013) - 2012
- [j23]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) - [j22]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: 104-113 (2012) - [c70]Tomi Janhunen, Ilkka Niemelä:
Applying Visible Strong Equivalence in Answer-Set Program Transformations. Correct Reasoning 2012: 363-379 - [c69]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Classifying and Propagating Parity Constraints. CP 2012: 357-372 - [c68]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
SMT-Based Induction Methods for Timed Systems. FORMATS 2012: 171-187 - [c67]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata. FMOODS/FORTE 2012: 84-100 - [c66]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Extending Clause Learning SAT Solvers with Complete Parity Reasoning. ICTAI 2012: 65-72 - [c65]Guohua Liu, Tomi Janhunen, Ilkka Niemelä:
Answer Set Programming via Mixed Integer Programming. KR 2012 - [c64]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Conflict-Driven XOR-Clause Learning. SAT 2012: 383-396 - [i12]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
SMT-based Induction Methods for Timed Systems. CoRR abs/1204.5639 (2012) - [i11]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version). CoRR abs/1207.0988 (2012) - 2011
- [j21]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning Search Spaces of a Randomized Search. Fundam. Informaticae 107(2-3): 289-311 (2011) - [c63]Roland Kindermann, Tommi A. Junttila, Ilkka Niemelä:
Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. ACSD 2011: 185-194 - [c62]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 - [c61]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP 2011: 385-399 - [c60]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Equivalence Class Based Parity Reasoning with DPLL(XOR). ICTAI 2011: 649-658 - [c59]Mai Nguyen, Tomi Janhunen, Ilkka Niemelä:
Translating Answer-Set Programs into Bit-Vector Logic. INAP/WLP 2011: 95-113 - [c58]Ilkka Niemelä:
Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems. ISMVL 2011: 139-141 - [c57]Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You:
Strong Equivalence of Logic Programs with Abstract Constraint Atoms. LPNMR 2011: 161-173 - [c56]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 - [i10]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Origins of Answer-Set Programming - Some Background And Two Personal Accounts. CoRR abs/1108.3281 (2011) - [i9]Mai Nguyen, Tomi Janhunen, Ilkka Niemelä:
Translating Answer-Set Programs into Bit-Vector Logic. CoRR abs/1108.5837 (2011) - 2010
- [c55]Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Extending Clause Learning DPLL with Parity Reasoning. ECAI 2010: 21-26 - [c54]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits:
On Testing Answer-Set Programs. ECAI 2010: 951-956 - [c53]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386 - [c52]Vesa Luukkala, Ilkka Niemelä:
Enhancing a Smart Space with Answer Set Programming. RuleML 2010: 89-103 - [c51]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ä:
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 [contents]
2000 – 2009
- 2009
- [j20]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): 223-244 (2009) - [c50]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning Search Spaces of a Randomized Search. AI*IA 2009: 243-252 - [c49]Ilkka Niemelä:
Integrating Answer Set Programming and Satisfiability Modulo Theories. LPNMR 2009: 3 - [c48]Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev:
Computing Stable Models via Reductions to Difference Logic. LPNMR 2009: 142-154 - [c47]Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä:
A Module-Based Framework for Multi-language Constraint Modeling. LPNMR 2009: 155-168 - [c46]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
- [j19]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Preferences and Nonmonotonic Reasoning. AI Mag. 29(4): 69-78 (2008) - [j18]Ilkka Niemelä:
Stable models and difference logic. Ann. Math. Artif. Intell. 53(1-4): 313-329 (2008) - [j17]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) - [j16]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms. Theory Pract. Log. Program. 8(2): 167-199 (2008) - [c45]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA 2008: 247-261 - [c44]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 - [c43]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
Justification-Based Non-Clausal Local Search for SAT. ECAI 2008: 535-539 - [c42]Ilkka Niemelä:
Answer Set Programming without Unstratified Negation. ICLP 2008: 88-92 - [c41]Ilkka Niemelä:
Stable Models and Difference Logic. ISAIM 2008 - [c40]Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä:
Justification-Based Local Search with Adaptive Noise Strategies. LPAR 2008: 31-46 - [r1]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Nonmonotonic Reasoning. Handbook of Knowledge Representation 2008: 239-284 - 2007
- [e3]Verónica Dahl, Ilkka Niemelä:
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 [contents] - 2006
- [j15]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä:
Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12-13): 1031-1080 (2006) - [j14]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): 27-46 (2006) - [j13]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) - [c39]Ilkka Niemelä:
Answer Set Programming: A Declarative Approach to Solving Search Problems. JELIA 2006: 15-18 - [c38]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
A Distribution Method for Solving SAT in Grids. SAT 2006: 430-435 - [i8]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms. CoRR abs/cs/0608103 (2006) - 2005
- [j12]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) - [j11]Toni Jussila, Keijo Heljanko, Ilkka Niemelä:
BMC via on-the-fly determinization. Int. J. Softw. Tools Technol. Transf. 7(2): 89-101 (2005) - [c37]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Prioritized Component Systems. AAAI 2005: 596-601 - [e2]Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski:
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 [contents] - [i7]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 - [i6]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 - 2004
- [j10]Gerhard Brewka, Ilkka Niemelä, Tommi Syrjänen:
Logic Programs with Ordered Disjunction. Comput. Intell. 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. AI&M 2004 - [c35]Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä:
Parallel Encodings of Classical Planning as Satisfiability. JELIA 2004: 307-319 - [c34]V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic Programs With Monotone Cardinality Atoms. LPNMR 2004: 154-166 - [c33]Tomi Janhunen, Ilkka Niemelä:
GNT - A Solver for Disjunctive Logic Programs. LPNMR 2004: 331-335 - [c32]Misa Keinänen, Ilkka Niemelä:
Solving Alternating Boolean Equation Systems in Answer Set Programming. INAP/WLP 2004: 134-148 - [e1]Vladimir Lifschitz, Ilkka Niemelä:
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 [contents] - 2003
- [j9]Keijo Heljanko, Ilkka Niemelä:
Bounded LTL model checking with stable models. Theory Pract. Log. Program. 3(4-5): 519-550 (2003) - [c31]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Answer Set Optimization. IJCAI 2003: 867-872 - [c30]Toni Jussila, Keijo Heljanko, Ilkka Niemelä:
BMC via on-the-fly determinization. BMC@CAV 2003: 561-577 - [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]Keijo Heljanko, Ilkka Niemelä:
Bounded LTL Model Checking with Stable Models. LPNMR 2001: 200-212 - [c25]Tommi Syrjänen, Ilkka Niemelä:
The Smodels System. LPNMR 2001: 434-438 - [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 M. 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 Mag. 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]Ilkka Niemelä:
Implementing Circumscription Using a Tableau Method. ECAI 1996: 80-84 - [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]Peter Baumgartner, Ulrich Furbach, Ilkka Niemelä:
Hyper Tableaux. JELIA 1996: 1-17 - [c12]Ilkka Niemelä:
A Tableau Calculus for Minimal Model Reasoning. TABLEAUX 1996: 278-294 - 1995
- [j3]Ilkka Niemelä:
A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning. J. Autom. Reason. 14(1): 3-42 (1995) - [c11]Ilkka Niemelä:
Towards Efficient Default Reasoning. IJCAI 1995: 312-318 - 1994
- [j2]Ilkka Niemelä, Jussi Rintanen:
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. J. Appl. Non Class. 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. Informaticae 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]Ilkka Niemelä:
A Unifying Framework for Nonmonotonic Reasoning. ECAI 1992: 334-338 - [c6]Ilkka Niemelä, Jussi Rintanen:
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. KR 1992: 627-638 - 1991
- [c5]Ilkka Niemelä:
Constructive Tightly Grounded Autoepistemic Reasoning. IJCAI 1991: 399-405 - 1990
- [c4]Ilkka Niemelä:
Towards Automatic Autoepistemic Reasoning. JELIA 1990: 428-443