Ilkka Niemelä

Affiliations:
  • Aalto University, Finland


According to our database1, Ilkka Niemelä authored at least 105 papers between 1988 and 2021.

Collaborative distances:

Timeline

1990
1995
2000
2005
2010
2015
2020
0
5
10
1
1
1
1
1
1
2
1
3
2
1
4
3
2
1
1
1
1
2
1
1
1
1
1
1
1
3
7
8
5
4
5
2
3
4
1
1
3
2
3
1
2
5
1
1
1
1
1
1
3

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Non-Clausal SAT and ATPG.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

2020
Applying Visible Strong Equivalence in Answer-Set Program Transformations.
ACM Trans. Comput. Log., 2020

2016
The Answer Set Programming Paradigm.
AI Mag., 2016

2015
Cumulativity Tailored for Nonmonotonic Reasoning.
Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

2014
Conflict-Driven XOR-Clause Learning (extended version).
CoRR, 2014

Classifying and Propagating Parity Constraints (extended version).
CoRR, 2014

2013
Simulating Parity Reasoning (extended version).
CoRR, 2013

Simulating Parity Reasoning.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Introducing Real Variables and Integer Objective Functions to Answer Set Programming.
Proceedings of the Declarative Programming and Knowledge Management, 2013

Bounded Model Checking of an MITL Fragment for Timed Automata.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012
Model checking of safety-critical software in the nuclear engineering domain.
Reliab. Eng. Syst. Saf., 2012

Solving parity games by a reduction to SAT.
J. Comput. Syst. Sci., 2012

Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)
CoRR, 2012

Conflict-Driven XOR-Clause Learning.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Answer Set Programming via Mixed Integer Programming.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Extending Clause Learning SAT Solvers with Complete Parity Reasoning.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata.
Proceedings of the Formal Techniques for Distributed Systems, 2012

SMT-Based Induction Methods for Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

Classifying and Propagating Parity Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Applying Visible Strong Equivalence in Answer-Set Program Transformations.
Proceedings of the Correct Reasoning, 2012

2011
Partitioning Search Spaces of a Randomized Search.
Fundam. Informaticae, 2011

Origins of Answer-Set Programming - Some Background And Two Personal Accounts
CoRR, 2011

Strong Equivalence of Logic Programs with Abstract Constraint Atoms.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems.
Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

Translating Answer-Set Programs into Bit-Vector Logic.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Equivalence Class Based Parity Reasoning with DPLL(XOR).
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Grid-Based SAT Solving with Iterative Partitioning and Clause Learning.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks.
Proceedings of the 11th International Conference on Application of Concurrency to System Design, 2011

2010
Experimental Comparison of Concolic and Random Testing for Java Card Applets.
Proceedings of the Model Checking Software, 2010

Enhancing a Smart Space with Answer Set Programming.
Proceedings of the Semantic Web Rules - International Symposium, 2010

Partitioning SAT Instances for Distributed Solving.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Extending Clause Learning DPLL with Parity Reasoning.
Proceedings of the ECAI 2010, 2010

On Testing Answer-Set Programs.
Proceedings of the ECAI 2010, 2010

2009
Non-Clausal SAT and ATPG.
Proceedings of the Handbook of Satisfiability, 2009

Incorporating Clause Learning in Grid-Based Randomized SAT Solving.
J. Satisf. Boolean Model. Comput., 2009

The LIME Interface Specification Language and Runtime Monitoring Tool.
Proceedings of the Runtime Verification, 9th International Workshop, 2009

Integrating Answer Set Programming and Satisfiability Modulo Theories.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

A Module-Based Framework for Multi-language Constraint Modeling.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Computing Stable Models via Reductions to Difference Logic.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008
Nonmonotonic Reasoning.
Proceedings of the Handbook of Knowledge Representation, 2008

Logic programs with monotone abstract constraint atoms.
Theory Pract. Log. Program., 2008

The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study.
J. Algorithms, 2008

Stable models and difference logic.
Ann. Math. Artif. Intell., 2008

Preferences and Nonmonotonic Reasoning.
AI Mag., 2008

Justification-Based Local Search with Adaptive Noise Strategies.
Proceedings of the Logic for Programming, 2008

Answer Set Programming without Unstratified Negation.
Proceedings of the Logic Programming, 24th International Conference, 2008

Justification-Based Non-Clausal Local Search for SAT.
Proceedings of the ECAI 2008, 2008

Strategies for Solving SAT in Grids by Randomized Search.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

Incorporating Learning in Grid-Based Randomized SAT Solving.
Proceedings of the Artificial Intelligence: Methodology, 2008

2006
Unfolding partiality and disjunctions in stable model semantics.
ACM Trans. Comput. Log., 2006

Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.
J. Satisf. Boolean Model. Comput., 2006

Planning as satisfiability: parallel plans and algorithms for plan search.
Artif. Intell., 2006

A Distribution Method for Solving SAT in Grids.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Answer Set Programming: A Declarative Approach to Solving Search Problems.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

2005
BMC via on-the-fly determinization.
Int. J. Softw. Tools Technol. Transf., 2005

Unrestricted vs restricted cut in a tableau method for Boolean circuits.
Ann. Math. Artif. Intell., 2005

05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints.
Proceedings of the Nonmonotonic Reasoning, 2005

05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints.
Proceedings of the Nonmonotonic Reasoning, 2005

Prioritized Component Systems.
Proceedings of the Proceedings, 2005

2004
Logic Programs with Ordered Disjunction.
Comput. Intell., 2004

Solving Alternating Boolean Equation Systems in Answer Set Programming.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2004

Logic Programs With Monotone Cardinality Atoms.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

GNT - A Solver for Disjunctive Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Parallel Encodings of Classical Planning as Satisfiability.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

2003
Bounded LTL model checking with stable models.
Theory Pract. Log. Program., 2003

Answer Set Optimization.
Proceedings of the IJCAI-03, 2003

2002
Extending and implementing the stable model semantics.
Artif. Intell., 2002

Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

2001
On the equivalence of the static and disjunctive well-founded semantics and its computation.
Theor. Comput. Sci., 2001

The Smodels System.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

Representing Configuration Knowledge With Weight Constraint Rules.
Proceedings of the Answer Set Programming, 2001

Answer Set Programming and Bounded Model Checking.
Proceedings of the Answer Set Programming, 2001

Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations.
Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000
DES: a Challenge Problem for Nonmonotonic Reasoning Systems
CoRR, 2000

Smodels: A System for Answer Set Programming
CoRR, 2000

Unfolding Partiality and Disjunctions in Stable Model Semantics.
Proceedings of the KR 2000, 2000

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking.
Proceedings of the Computational Logic, 2000

1999
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm.
Ann. Math. Artif. Intell., 1999

Developing a Declarative Rule Language for Applications in Product Configuration.
Proceedings of the Practical Aspects of Declarative Languages, 1999

Stable Model Semantics of Weight Constraint Rules.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

A Fixpoint Definition of Dynamic Constraint Satisfaction.
Proceedings of the Principles and Practice of Constraint Programming, 1999

1998
Report on the Seventh International Workshop on Nonmonotonic Reasoning.
AI Mag., 1998

A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

1997
DisLoP: A Research Project on Disjunctive Logic Programming.
AI Commun., 1997

Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Dislop: Towards a Disjunctive Logic Programming System.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

1996
A Tableau Calculus for Minimal Model Reasoning.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

Hyper Tableaux.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

Efficient Implementation of the Well-founded and Stable Model Semantics.
Proceedings of the Logic Programming, 1996

On Merging Theorem Proving and Logic Programming Paradigms (Poster Abstract).
Proceedings of the Logic Programming, 1996

Implementing Circumscription Using a Tableau Method.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996

1995
A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning.
J. Autom. Reason., 1995

Towards Efficient Default Reasoning.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning.
J. Appl. Non Class. Logics, 1994

A Decision Method for Nonmomotonic Reasoning Based on Autoepistemic Reasoning.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

1993
A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992
On the decidability and complexity of autoepistemic reasoning.
Fundam. Informaticae, 1992

A Unifying Framework for Nonmonotonic Reasoning.
Proceedings of the 10th European Conference on Artificial Intelligence, 1992

1991
Constructive Tightly Grounded Autoepistemic Reasoning.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1990
Towards Automatic Autoepistemic Reasoning.
Proceedings of the Logics in AI, European Workshop, 1990

1988
Autoepistemic Predicate Logic.
Proceedings of the 8th European Conference on Artificial Intelligence, 1988

On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic.
Proceedings of the CSL '88, 1988

Decision Procedure for Autoepistemic Logic.
Proceedings of the 9th International Conference on Automated Deduction, 1988


  Loading...