H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 34 Citations 7,868 117 World Ranking 6202 National Ranking 47

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Artificial intelligence
  • Algorithm

Ilkka Niemelä focuses on Theoretical computer science, Stable model semantics, Programming language, Answer set programming and Well-founded semantics. A large part of his Theoretical computer science studies is devoted to Logic programming. His research investigates the connection with Stable model semantics and areas like Semantics which intersect with concerns in Logical programming.

His Answer set programming study combines topics from a wide range of disciplines, such as Model checking, Simple and Inference engine. His study ties his expertise on Constraint satisfaction together with the subject of Well-founded semantics. His work in the fields of Constraint logic programming overlaps with other areas such as Semantics of Business Vocabulary and Business Rules.

His most cited work include:

  • Extending and implementing the stable model semantics (814 citations)
  • Logic programs with stable model semantics as a constraint programming paradigm (791 citations)
  • Smodels — an implementation of the stable model and well-founded semantics for normal logic programs (321 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Theoretical computer science, Programming language, Model checking, Stable model semantics and Algorithm. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Constraint satisfaction and Set. His study in Programming language focuses on Semantics in particular.

His Model checking research incorporates themes from Automaton, Reliability engineering, Formal verification and Petri net. His Stable model semantics research includes elements of Simple, Well-founded semantics and Logical programming. Well-founded semantics is a subfield of Operational semantics that Ilkka Niemelä tackles.

He most often published in these fields:

  • Theoretical computer science (38.07%)
  • Programming language (23.30%)
  • Model checking (21.59%)

What were the highlights of his more recent work (between 2010-2021)?

  • Theoretical computer science (38.07%)
  • Model checking (21.59%)
  • Algorithm (18.75%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Theoretical computer science, Model checking, Algorithm, Bounded function and DPLL algorithm. His work on Answer set programming and Logic programming as part of general Theoretical computer science research is often related to Minimal model, thus linking different fields of science. The study incorporates disciplines such as Orthogonal array testing, Stable model semantics and Test Management Approach in addition to Answer set programming.

His Logic programming research is multidisciplinary, relying on both Inductive programming and Programming paradigm. His work deals with themes such as Automaton, Timed automaton, Minification, Automotive engineering and Formal verification, which intersect with Model checking. His studies examine the connections between Algorithm and genetics, as well as such issues in Equivalence, with regards to Reduct, Logic program, Constraint logic programming, Concurrent constraint logic programming and Bunched logic.

Between 2010 and 2021, his most popular works were:

  • Model Checking of Safety-Critical Software in the Nuclear Engineering Domain (50 citations)
  • Compact translations of non-disjunctive answer set programs to propositional clauses (38 citations)
  • Solving parity games by a reduction to SAT (37 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Artificial intelligence
  • Algorithm

Theoretical computer science, Model checking, Answer set programming, Satisfiability modulo theories and Bounded function are his primary areas of study. Ilkka Niemelä works in the field of Theoretical computer science, focusing on Satisfiability in particular. His Model checking study combines topics in areas such as Nuclear engineering, Software verification and validation and Functional verification.

His studies in Answer set programming integrate themes in fields like Orthogonal array testing, Stable model semantics, Test Management Approach and Programming paradigm. As part of the same scientific family, he usually focuses on Stable model semantics, concentrating on Autoepistemic logic and intersecting with Zeroth-order logic. Ilkka Niemelä interconnects Symbolic programming, Inductive programming, Reactive programming, Functional logic programming and Well-founded semantics in the investigation of issues within Logic programming.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Extending and implementing the stable model semantics

Patrik Simons;Ilkka Niemelá;Timo Soininen.
Artificial Intelligence (2002)

1288 Citations

Logic programs with stable model semantics as a constraint programming paradigm

Ilkka Niemelä.
Annals of Mathematics and Artificial Intelligence (1999)

1229 Citations

Smodels — an implementation of the stable model and well-founded semantics for normal logic programs

Ilkka Niemelä;Patrik Simons.
international conference on logic programming (1997)

495 Citations

Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP

Ilkka Niemelä;Patrik Simons.
international conference on logic programming (1997)

405 Citations

Efficient Implementation of the Well-founded and Stable Model Semantics

Ilkka Niemelä;Patrik Simons.
JICSLP (1996)

273 Citations

Hyper Tableaux

Peter Baumgartner;Ulrich Furbach;Ilkka Niemelä.
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence (1996)

265 Citations

Planning as satisfiability: parallel plans and algorithms for plan search

Jussi Rintanen;Keijo Heljanko;Ilkka Niemelä.
Artificial Intelligence (2006)

260 Citations

Extending the Smodels system with cardinality and weight constraints

Ilkka Niemelä;Patrik Simons.
Logic-based artificial intelligence (2001)

227 Citations

Unfolding partiality and disjunctions in stable model semantics

Tomi Janhunen;Ilkka Niemelä;Dietmar Seipel;Patrik Simons.
ACM Transactions on Computational Logic (2006)

220 Citations

Developing a Declarative Rule Language for Applications in Product Configuration

Timo Soininen;Ilkka Niemelä.
practical aspects of declarative languages (1999)

201 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Ilkka Niemelä

Torsten Schaub

Torsten Schaub

University of Potsdam

Publications: 160

Martin Gebser

Martin Gebser

University of Klagenfurt

Publications: 96

Thomas Eiter

Thomas Eiter

TU Wien

Publications: 92

Nicola Leone

Nicola Leone

University of Calabria

Publications: 92

Miroslaw Truszczynski

Miroslaw Truszczynski

University of Kentucky

Publications: 91

Stefan Woltran

Stefan Woltran

TU Wien

Publications: 83

Wolfgang Faber

Wolfgang Faber

University of Klagenfurt

Publications: 81

Hans Tompits

Hans Tompits

TU Wien

Publications: 73

Enrico  Pontelli

Enrico Pontelli

New Mexico State University

Publications: 69

Marc Denecker

Marc Denecker

KU Leuven

Publications: 52

Michael Gelfond

Michael Gelfond

Texas Tech University

Publications: 48

Vladimir Lifschitz

Vladimir Lifschitz

The University of Texas at Austin

Publications: 45

Chitta Baral

Chitta Baral

Arizona State University

Publications: 43

Fangzhen Lin

Fangzhen Lin

Hong Kong University of Science and Technology

Publications: 32

Luís Moniz Pereira

Luís Moniz Pereira

Universidade Nova de Lisboa

Publications: 27

Piero A. Bonatti

Piero A. Bonatti

University of Naples Federico II

Publications: 25

Something went wrong. Please try again later.