The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ilkka Niemelä: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
    Prioritized Component Systems. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:596-601 [Conf]
  2. Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
    Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    AMAI, 2004, pp:- [Conf]
  3. Keijo Heljanko, Ilkka Niemelä
    Answer Set Programming and Bounded Model Checking. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  4. Timo Soininen, Ilkka Niemelä, Juha Tiihonen, Reijo Sulonen
    Representing Configuration Knowledge With Weight Constraint Rules. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  5. Ilkka Niemelä
    Decision Procedure for Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:675-684 [Conf]
  6. Tommi A. Junttila, Ilkka Niemelä
    Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:553-567 [Conf]
  7. Timo Soininen, Esther Gelle, Ilkka Niemelä
    A Fixpoint Definition of Dynamic Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:419-433 [Conf]
  8. Ilkka Niemelä
    On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:226-239 [Conf]
  9. Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski
    05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005, pp:- [Conf]
  10. Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, Joost Vennekens
    05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005, pp:- [Conf]
  11. Ilkka Niemelä
    Autoepistemic Predicate Logic. [Citation Graph (0, 0)][DBLP]
    ECAI, 1988, pp:595-600 [Conf]
  12. Ilkka Niemelä
    A Unifying Framework for Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:334-338 [Conf]
  13. Ilkka Niemelä
    Implementing Circumscription Using a Tableau Method. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:80-84 [Conf]
  14. Ilkka Niemelä, Jussi Rintanen
    On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    ECAI Workshop on Knowledge Representation and Reasoning, 1992, pp:275-295 [Conf]
  15. 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). [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:546- [Conf]
  16. Ilkka Niemelä, Patrik Simons
    Efficient Implementation of the Well-founded and Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:289-303 [Conf]
  17. Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
    Answer Set Optimization. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:867-872 [Conf]
  18. Ilkka Niemelä
    Constructive Tightly Grounded Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:399-405 [Conf]
  19. Ilkka Niemelä
    Towards Efficient Default Reasoning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:312-318 [Conf]
  20. Peter Baumgartner, Ulrich Furbach, Ilkka Niemelä
    Hyper Tableaux. [Citation Graph (0, 0)][DBLP]
    JELIA, 1996, pp:1-17 [Conf]
  21. Gerhard Brewka, Ilkka Niemelä, Tommi Syrjänen
    Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:444-455 [Conf]
  22. Ilkka Niemelä
    Answer Set Programming: A Declarative Approach to Solving Search Problems. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:15-18 [Conf]
  23. Ilkka Niemelä
    Towards Automatic Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    JELIA, 1990, pp:428-443 [Conf]
  24. Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
    Parallel Encodings of Classical Planning as Satisfiability. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:307-319 [Conf]
  25. Tomi Janhunen, Ilkka Niemelä
    A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:211-222 [Conf]
  26. Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
    A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:74-85 [Conf]
  27. Tomi Janhunen, Ilkka Niemelä, Patrik Simons, Jia-Huai You
    Unfolding Partiality and Disjunctions in Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:411-422 [Conf]
  28. Ilkka Niemelä
    A Decision Method for Nonmomotonic Reasoning Based on Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    KR, 1994, pp:473-484 [Conf]
  29. Ilkka Niemelä, Jussi Rintanen
    On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    KR, 1992, pp:627-638 [Conf]
  30. Tomi Janhunen, Ilkka Niemelä
    GNT - A Solver for Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:331-335 [Conf]
  31. Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä
    Dislop: Towards a Disjunctive Logic Programming System. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:342-353 [Conf]
  32. Keijo Heljanko, Ilkka Niemelä
    Bounded LTL Model Checking with Stable Models. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:200-212 [Conf]
  33. V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski
    Logic Programs With Monotone Cardinality Atoms. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:154-166 [Conf]
  34. Tommi Syrjänen, Ilkka Niemelä
    The Smodels System. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:434-438 [Conf]
  35. Ilkka Niemelä, Patrik Simons
    Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:421-430 [Conf]
  36. Ilkka Niemelä, Patrik Simons, Timo Soininen
    Stable Model Semantics of Weight Constraint Rules. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:317-331 [Conf]
  37. Timo Soininen, Ilkka Niemelä
    Developing a Declarative Rule Language for Applications in Product Configuration. [Citation Graph (0, 0)][DBLP]
    PADL, 1999, pp:305-319 [Conf]
  38. Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä
    A Distribution Method for Solving SAT in Grids. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:430-435 [Conf]
  39. Ilkka Niemelä
    A Tableau Calculus for Minimal Model Reasoning. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1996, pp:278-294 [Conf]
  40. Misa Keinänen, Ilkka Niemelä
    Solving Alternating Boolean Equation Systems in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    INAP/WLP, 2004, pp:134-148 [Conf]
  41. Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
    Planning as satisfiability: parallel plans and algorithms for plan search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:12-13, pp:1031-1080 [Journal]
  42. Patrik Simons, Ilkka Niemelä, Timo Soininen
    Extending and implementing the stable model semantics. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:138, n:1-2, pp:181-234 [Journal]
  43. Chandrabose Aravindan, Jürgen Dix, Ilkka Niemelä
    DisLoP: A Research Project on Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    AI Commun., 1997, v:10, n:3-4, pp:151-165 [Journal]
  44. Gerhard Brewka, Ilkka Niemelä
    Report on the Seventh International Workshop on Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 1998, v:19, n:4, pp:139- [Journal]
  45. Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
    Unrestricted vs restricted cut in a tableau method for Boolean circuits. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:44, n:4, pp:373-399 [Journal]
  46. Ilkka Niemelä
    Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:25, n:3-4, pp:241-273 [Journal]
  47. Ilkka Niemelä, Patrik Simons, Tommi Syrjänen
    Smodels: A System for Answer Set Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  48. Maarit Hietalahti, Fabio Massacci, Ilkka Niemelä
    DES: a Challenge Problem for Nonmonotonic Reasoning Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  49. Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
    Unfolding Partiality and Disjunctions in Stable Model Semantics [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  50. Keijo Heljanko, Ilkka Niemelä
    Bounded LTL Model Checking with Stable Models [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  51. V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski
    Logic programs with monotone cardinality atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  52. Toni Jussila, Keijo Heljanko, Ilkka Niemelä
    BMC via on-the-fly determinization. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:89, n:4, pp:- [Journal]
  53. Ilkka Niemelä
    On the decidability and complexity of autoepistemic reasoning. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:17, n:1-2, pp:117-155 [Journal]
  54. Ilkka Niemelä, Jussi Rintanen
    On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1994, v:4, n:2, pp:- [Journal]
  55. Ilkka Niemelä
    A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1995, v:14, n:1, pp:3-42 [Journal]
  56. Toni Jussila, Keijo Heljanko, Ilkka Niemelä
    BMC via on-the-fly determinization. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:2, pp:89-101 [Journal]
  57. Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
    On the equivalence of the static and disjunctive well-founded semantics and its computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:523-553 [Journal]
  58. Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
    Unfolding partiality and disjunctions in stable model semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:1, pp:1-37 [Journal]
  59. Keijo Heljanko, Ilkka Niemelä
    Bounded LTL model checking with stable models. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:4-5, pp:519-550 [Journal]
  60. Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski
    Logic programs with monotone abstract constraint atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  61. Partitioning Search Spaces of a Randomized Search. [Citation Graph (, )][DBLP]


  62. Incorporating Learning in Grid-Based Randomized SAT Solving. [Citation Graph (, )][DBLP]


  63. Strategies for Solving SAT in Grids by Randomized Search. [Citation Graph (, )][DBLP]


  64. Justification-Based Non-Clausal Local Search for SAT. [Citation Graph (, )][DBLP]


  65. Extending Clause Learning DPLL with Parity Reasoning. [Citation Graph (, )][DBLP]


  66. On Testing Answer-Set Programs. [Citation Graph (, )][DBLP]


  67. Answer Set Programming without Unstratified Negation. [Citation Graph (, )][DBLP]


  68. Justification-Based Local Search with Adaptive Noise Strategies. [Citation Graph (, )][DBLP]


  69. A Module-Based Framework for Multi-language Constraint Modeling. [Citation Graph (, )][DBLP]


  70. Computing Stable Models via Reductions to Difference Logic. [Citation Graph (, )][DBLP]


  71. Integrating Answer Set Programming and Satisfiability Modulo Theories. [Citation Graph (, )][DBLP]


  72. The LIME Interface Specification Language and Runtime Monitoring Tool. [Citation Graph (, )][DBLP]


  73. Stable models and difference logic. [Citation Graph (, )][DBLP]


  74. Logic Programs with Ordered Disjunction. [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002