Ilkka Niemelä

123 papers A* 9A 12B 28C 1Misc 2Journal 39Unranked 27

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