| Unfolding partiality and disjunctions in stable model semantics T Janhunen, I Niemelä, D Seipel, P Simons, JH You ACM Transactions on Computational Logic (TOCL) 7 (1), 1-37, 2006 | 247 | 2006 |
| Answer set programming via mixed integer programming G Liu, T Janhunen, I Niemela Thirteenth international conference on the principles of knowledge …, 2012 | 114 | 2012 |
| Modular equivalence for normal logic programs E Oikarinen, T Janhunen ECAI 6, 412-416, 2006 | 100 | 2006 |
| Some (in) translatability results for normal logic programs and propositional theories T Janhunen Journal of Applied Non-Classical Logics 16 (1-2), 35-86, 2006 | 99 | 2006 |
| Modularity aspects of disjunctive stable models T Janhunen, E Oikarinen, H Tompits, S Woltran Journal of Artificial Intelligence Research 35, 813-857, 2009 | 94 | 2009 |
| Representing normal programs with clauses T Janhunen ECAI 16, 358, 2004 | 90 | 2004 |
| Computing stable models via reductions to difference logic T Janhunen, I Niemelä, M Sevalnev Logic Programming and Nonmonotonic Reasoning: 10th International Conference …, 2009 | 65 | 2009 |
| Compact translations of non-disjunctive answer set programs to propositional clauses T Janhunen, I Niemelä Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning …, 2011 | 58 | 2011 |
| Achieving compositionality of the stable model semantics for smodels programs1 E Oikarinen, T Janhunen Theory and Practice of Logic Programming 8 (5-6), 717-761, 2008 | 53 | 2008 |
| SAT modulo graphs: Acyclicity M Gebser, T Janhunen, J Rintanen Logics in Artificial Intelligence: 14th European Conference, JELIA 2014 …, 2014 | 52 | 2014 |
| Gnt-a solver for disjunctive logic programs T Janhunen, I Niemelä LPNMR 2004, 331-335, 2004 | 51 | 2004 |
| On the intertranslatability of non‐monotonic logics T Janhunen Annals of Mathematics and Artificial Intelligence 27, 79-128, 1999 | 50 | 1999 |
| Clingo goes linear constraints over reals and integers T Janhunen, R Kaminski, M Ostrowski, S Schellhorn, P Wanko, T Schaub Theory and Practice of Logic Programming 17 (5-6), 872-888, 2017 | 49 | 2017 |
| Tight integration of non-ground answer set programming and satisfiability modulo theories T Janhunen, G Liu, I Niemelä Proceedings of the First Workshop on Grounding and Transformation for …, 2011 | 49 | 2011 |
| Answer Set Programming as SAT modulo Acyclicity. M Gebser, T Janhunen, J Rintanen ECAI 263, 351-356, 2014 | 46 | 2014 |
| The answer set programming paradigm T Janhunen, I Nimelä AI Magazine 37 (3), 13-24, 2016 | 45 | 2016 |
| Platypus: A platform for distributed answer set solving J Gressmann, T Janhunen, RE Mercer, T Schaub, S Thiele, R Tichy LPNMR, 227-239, 2005 | 45 | 2005 |
| Learning chordal Markov networks by constraint satisfaction J Corander, T Janhunen, J Rintanen, H Nyman, J Pensar Advances in Neural Information Processing Systems 26, 2013 | 43 | 2013 |
| Normalizing cardinality rules using merging and sorting constructions J Bomanson, T Janhunen Logic Programming and Nonmonotonic Reasoning: 12th International Conference …, 2013 | 41 | 2013 |
| A Module-Based Framework for Multi-language Constraint Modeling. M Järvisalo, E Oikarinen, T Janhunen, I Niemelä LPNMR, 155-168, 2009 | 40 | 2009 |
