E-LIB Suche - Ergebnisse für: NIEMELÄ, ILKKA

1

Applying Visible Strong Equivalence in Answer-Set Program T..:

Bomanson, Jori ; Janhunen, Tomi ; Niemelä, Ilkka
ACM Transactions on Computational Logic. 21 (2020) 4 - p. 1-41 , 2020

2

Applying Visible Strong Equivalence in Answer-Set Program T..:

Bomanson, Jori ; Janhunen, Tomi ; Niemelä, Ilkka
ACM Transactions on Computational Logic (TOCL). 21 (2020) 4 - p. 1-41 , 2020

Link: https://dl.acm.org/doi/1..

3

Solving parity games by a reduction to SAT:

Heljanko, Keijo ; Keinänen, Misa ; Lange, Martin.
Journal of Computer and System Sciences. 78 (2012) 2 - p. 430-440 , 2012

Link: https://doi.org/10.1016/..

4

Strong Equivalence of Logic Programs with Abstract Constrai..:

, In: Logic Programming and Nonmonotonic Reasoning; Lecture Notes in Computer Science,

Liu, Guohua ; Goebel, Randy ; Janhunen, Tomi.. - p. 161-173 , 2011

Link: https://doi.org/10.1007/..

5

Random vs. Structure-Based Testing of Answer-Set Programs: ..:

, In: Logic Programming and Nonmonotonic Reasoning; Lecture Notes in Computer Science,

Janhunen, Tomi ; Niemelä, Ilkka ; Oetsch, Johannes.. - p. 242-247 , 2011

Link: https://doi.org/10.1007/..

6

Logics in artificial intelligence

12th European conference, JELIA 2010, Helsinki, Finland, Se... Lecture notes in computer science ; 6341, Lecture notes in artificial intelligence

Janhunen, Tomi ; Niemelä, Ilkka , 2010

Link: http://dx.doi.org/10.100..

7

Incorporating Clause Learning in Grid-Based Randomized SAT ..:

Hyvärinen, Antti E.J. ; Junttila, Tommi ; Niemelä, Ilkka.
Journal on Satisfiability, Boolean Modeling and Computation. 6 (2009) 4 - p. 223-244 , 2009

Link: https://doi.org/10.3233/..

8

Chapter 6 Nonmonotonic Reasoning:

, In: Handbook of Knowledge Representation; Foundations of Artificial Intelligence,

Brewka, Gerhard ; Niemelä, Ilkka ; Truszczyński, Mirosław - p. 239-284 , 2008

Link: https://doi.org/10.1016/..

9

Stable models and difference logic:

Niemelä, Ilkka
Annals of Mathematics and Artificial Intelligence. 53 (2008) 1-4 - p. 313-329 , 2008

Link: https://doi.org/10.1007/..

10

Logic programs with monotone abstract constraint atoms:

MAREK, VICTOR W. ; NIEMELÄ, ILKKA ; TRUSZCZYŃSKI, MIROSŁAW
Theory and Practice of Logic Programming. 8 (2008) 2 - p. 167-199 , 2008

Link: https://doi.org/10.1017/..

11

The effect of structural branching on the efficiency of cla..:

Järvisalo, Matti ; Niemelä, Ilkka
Journal of Algorithms. 63 (2008) 1-3 - p. 90-113 , 2008

Link: https://doi.org/10.1016/..

12

Logic programming

23rd international conference, ICLP 2007, Porto, Portugal, ... Lecture notes in computer science ; 4670

Dahl, Verónica ; Niemelä, Ilkka , 2007

Link: http://dx.doi.org/10.100..

13

Unfolding partiality and disjunctions in stable model seman..:

Janhunen, Tomi ; Niemelä, Ilkka ; Seipel, Dietmar..
ACM Transactions on Computational Logic. 7 (2006) 1 - p. 1-37 , 2006

Link: https://doi.org/10.1145/..

14

Planning as satisfiability: parallel plans and algorithms f..:

Rintanen, Jussi ; Heljanko, Keijo ; Niemelä, Ilkka
Artificial Intelligence. 170 (2006) 12-13 - p. 1031-1080 , 2006

Link: https://doi.org/10.1016/..

15

Unfolding partiality and disjunctions in stable model seman..:

Janhunen, Tomi ; Niemelä, Ilkka ; Seipel, Dietmar..
ACM Transactions on Computational Logic (TOCL). 7 (2006) 1 - p. 1-37 , 2006

Link: https://dl.acm.org/doi/1..