| 2008 |
|---|
| 72 | EE | Antti Eero Johannes Hyvärinen,
Tommi A. Junttila,
Ilkka Niemelä:
Incorporating Learning in Grid-Based Randomized SAT Solving.
AIMSA 2008: 247-261 |
| 71 | EE | 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 |
| 70 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Non-Clausal Local Search for SAT.
ECAI 2008: 535-539 |
| 69 | EE | Ilkka Niemelä:
Answer Set Programming without Unstratified Negation.
ICLP 2008: 88-92 |
| 68 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Local Search with Adaptive Noise Strategies.
LPAR 2008: 31-46 |
| 67 | EE | 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) |
| 66 | EE | Victor W. Marek,
Ilkka Niemelä,
Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms.
TPLP 8(2): 167-199 (2008) |
| 2007 |
|---|
| 65 | | Verónica Dahl,
Ilkka Niemelä:
Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings
Springer 2007 |
| 2006 |
|---|
| 64 | EE | Ilkka Niemelä:
Answer Set Programming: A Declarative Approach to Solving Search Problems.
JELIA 2006: 15-18 |
| 63 | EE | Antti Eero Johannes Hyvärinen,
Tommi A. Junttila,
Ilkka Niemelä:
A Distribution Method for Solving SAT in Grids.
SAT 2006: 430-435 |
| 62 | EE | 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) |
| 61 | EE | Jussi Rintanen,
Keijo Heljanko,
Ilkka Niemelä:
Planning as satisfiability: parallel plans and algorithms for plan search.
Artif. Intell. 170(12-13): 1031-1080 (2006) |
| 60 | EE | Victor W. Marek,
Ilkka Niemelä,
Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms
CoRR abs/cs/0608103: (2006) |
| 59 | EE | 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) |
| 2005 |
|---|
| 58 | | Gerhard Brewka,
Ilkka Niemelä,
Torsten Schaub,
Miroslaw Truszczynski:
Nonmonotonic Reasoning, Answer Set Programming and Constraints, 24.-29. April 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 |
| 57 | | Gerhard Brewka,
Ilkka Niemelä,
Miroslaw Truszczynski:
Prioritized Component Systems.
AAAI 2005: 596-601 |
| 56 | EE | 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 |
| 55 | EE | 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 |
| 54 | EE | 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) |
| 53 | EE | Toni Jussila,
Keijo Heljanko,
Ilkka Niemelä:
BMC via on-the-fly determinization.
STTT 7(2): 89-101 (2005) |
| 2004 |
|---|
| 52 | | Vladimir Lifschitz,
Ilkka Niemelä:
Logic Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings
Springer 2004 |
| 51 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
AMAI 2004 |
| 50 | EE | Misa Keinänen,
Ilkka Niemelä:
Solving Alternating Boolean Equation Systems in Answer Set Programming.
INAP/WLP 2004: 134-148 |
| 49 | EE | Jussi Rintanen,
Keijo Heljanko,
Ilkka Niemelä:
Parallel Encodings of Classical Planning as Satisfiability.
JELIA 2004: 307-319 |
| 48 | EE | V. Wiktor Marek,
Ilkka Niemelä,
Miroslaw Truszczynski:
Logic Programs With Monotone Cardinality Atoms.
LPNMR 2004: 154-166 |
| 47 | EE | Tomi Janhunen,
Ilkka Niemelä:
GNT - A Solver for Disjunctive Logic Programs.
LPNMR 2004: 331-335 |
| 2003 |
|---|
| 46 | | Gerhard Brewka,
Ilkka Niemelä,
Miroslaw Truszczynski:
Answer Set Optimization.
IJCAI 2003: 867-872 |
| 45 | EE | Tomi Janhunen,
Ilkka Niemelä,
Dietmar Seipel,
Patrik Simons,
Jia-Huai You:
Unfolding Partiality and Disjunctions in Stable Model Semantics
CoRR cs.AI/0303009: (2003) |
| 44 | EE | Keijo Heljanko,
Ilkka Niemelä:
Bounded LTL Model Checking with Stable Models
CoRR cs.LO/0305040: (2003) |
| 43 | EE | V. Wiktor Marek,
Ilkka Niemelä,
Miroslaw Truszczynski:
Logic programs with monotone cardinality atoms
CoRR cs.LO/0310063: (2003) |
| 42 | EE | Toni Jussila,
Keijo Heljanko,
Ilkka Niemelä:
BMC via on-the-fly determinization.
Electr. Notes Theor. Comput. Sci. 89(4): (2003) |
| 41 | | Keijo Heljanko,
Ilkka Niemelä:
Bounded LTL model checking with stable models.
TPLP 3(4-5): 519-550 (2003) |
| 2002 |
|---|
| 40 | EE | Gerhard Brewka,
Ilkka Niemelä,
Tommi Syrjänen:
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs.
JELIA 2002: 444-455 |
| 39 | EE | Patrik Simons,
Ilkka Niemelä,
Timo Soininen:
Extending and implementing the stable model semantics.
Artif. Intell. 138(1-2): 181-234 (2002) |
| 2001 |
|---|
| 38 | EE | Keijo Heljanko,
Ilkka Niemelä:
Answer Set Programming and Bounded Model Checking.
Answer Set Programming 2001 |
| 37 | EE | Timo Soininen,
Ilkka Niemelä,
Juha Tiihonen,
Reijo Sulonen:
Representing Configuration Knowledge With Weight Constraint Rules.
Answer Set Programming 2001 |
| 36 | EE | Keijo Heljanko,
Ilkka Niemelä:
Bounded LTL Model Checking with Stable Models.
LPNMR 2001: 200-212 |
| 35 | EE | Tommi Syrjänen,
Ilkka Niemelä:
The Smodels System.
LPNMR 2001: 434-438 |
| 34 | | Jürgen Dix,
Ulrich Furbach,
Ilkka Niemelä:
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations.
Handbook of Automated Reasoning 2001: 1241-1354 |
| 33 | EE | 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) |
| 2000 |
|---|
| 32 | EE | Tommi A. Junttila,
Ilkka Niemelä:
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking.
Computational Logic 2000: 553-567 |
| 31 | | Tomi Janhunen,
Ilkka Niemelä,
Patrik Simons,
Jia-Huai You:
Unfolding Partiality and Disjunctions in Stable Model Semantics.
KR 2000: 411-422 |
| 30 | EE | Ilkka Niemelä,
Patrik Simons,
Tommi Syrjänen:
Smodels: A System for Answer Set Programming
CoRR cs.AI/0003033: (2000) |
| 29 | EE | Maarit Hietalahti,
Fabio Massacci,
Ilkka Niemelä:
DES: a Challenge Problem for Nonmonotonic Reasoning Systems
CoRR cs.AI/0003039: (2000) |
| 1999 |
|---|
| 28 | | Timo Soininen,
Esther Gelle,
Ilkka Niemelä:
A Fixpoint Definition of Dynamic Constraint Satisfaction.
CP 1999: 419-433 |
| 27 | EE | Ilkka Niemelä,
Patrik Simons,
Timo Soininen:
Stable Model Semantics of Weight Constraint Rules.
LPNMR 1999: 317-331 |
| 26 | EE | Timo Soininen,
Ilkka Niemelä:
Developing a Declarative Rule Language for Applications in Product Configuration.
PADL 1999: 305-319 |
| 25 | | Ilkka Niemelä:
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm.
Ann. Math. Artif. Intell. 25(3-4): 241-273 (1999) |
| 1998 |
|---|
| 24 | | 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 |
| 23 | | Gerhard Brewka,
Ilkka Niemelä:
Report on the Seventh International Workshop on Nonmonotonic Reasoning.
AI Magazine 19(4): 139 (1998) |
| 1997 |
|---|
| 22 | | Chandrabose Aravindan,
Jürgen Dix,
Ilkka Niemelä:
Dislop: Towards a Disjunctive Logic Programming System.
LPNMR 1997: 342-353 |
| 21 | | Ilkka Niemelä,
Patrik Simons:
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP.
LPNMR 1997: 421-430 |
| 20 | | Chandrabose Aravindan,
Jürgen Dix,
Ilkka Niemelä:
DisLoP: A Research Project on Disjunctive Logic Programming.
AI Commun. 10(3-4): 151-165 (1997) |
| 1996 |
|---|
| 19 | | Ilkka Niemelä:
Implementing Circumscription Using a Tableau Method.
ECAI 1996: 80-84 |
| 18 | | Peter Baumgartner,
Ulrich Furbach,
Ilkka Niemelä:
Hyper Tableaux.
JELIA 1996: 1-17 |
| 17 | | Ilkka Niemelä,
Patrik Simons:
Efficient Implementation of the Well-founded and Stable Model Semantics.
JICSLP 1996: 289-303 |
| 16 | | 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 |
| 15 | | Ilkka Niemelä:
A Tableau Calculus for Minimal Model Reasoning.
TABLEAUX 1996: 278-294 |
| 1995 |
|---|
| 14 | | Ilkka Niemelä:
Towards Efficient Default Reasoning.
IJCAI 1995: 312-318 |
| 13 | | Ilkka Niemelä:
A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning.
J. Autom. Reasoning 14(1): 3-42 (1995) |
| 1994 |
|---|
| 12 | | Ilkka Niemelä:
A Decision Method for Nonmomotonic Reasoning Based on Autoepistemic Reasoning.
KR 1994: 473-484 |
| 11 | | Ilkka Niemelä,
Jussi Rintanen:
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning.
Journal of Applied Non-Classical Logics 4(2): (1994) |
| 1993 |
|---|
| 10 | | Tomi Janhunen,
Ilkka Niemelä:
A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning.
Kurt Gödel Colloquium 1993: 211-222 |
| 1992 |
|---|
| 9 | | Ilkka Niemelä:
A Unifying Framework for Nonmonotonic Reasoning.
ECAI 1992: 334-338 |
| 8 | | 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 |
| 7 | | Ilkka Niemelä,
Jussi Rintanen:
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning.
KR 1992: 627-638 |
| 6 | | Ilkka Niemelä:
On the decidability and complexity of autoepistemic reasoning.
Fundam. Inform. 17(1-2): 117-155 (1992) |
| 1991 |
|---|
| 5 | | Ilkka Niemelä:
Constructive Tightly Grounded Autoepistemic Reasoning.
IJCAI 1991: 399-405 |
| 1990 |
|---|
| 4 | | Ilkka Niemelä:
Towards Automatic Autoepistemic Reasoning.
JELIA 1990: 428-443 |
| 1988 |
|---|
| 3 | | Ilkka Niemelä:
Decision Procedure for Autoepistemic Logic.
CADE 1988: 675-684 |
| 2 | | Ilkka Niemelä:
On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic.
CSL 1988: 226-239 |
| 1 | | Ilkka Niemelä:
Autoepistemic Predicate Logic.
ECAI 1988: 595-600 |
