| 2024 | IJCAI | Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming. | Masood Feyzbakhsh Rankooh, Tomi Janhunen |
| 2024 | IJCAI | Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract). | Masood Feyzbakhsh Rankooh, Tomi Janhunen |
| 2023 | JELIA | Short Boolean Formulas as Explanations in Practice. | Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander |
| 2023 | PADL | Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling. | Anssi Yli-Jyr, Masood Feyzbakhsh Rankooh, Tomi Janhunen |
| 2022 | LPNMR | Explainability via Short Formulas: the Case of Propositional Logic with Implementation. | Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander |
| 2022 | LPNMR | Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination. | Masood Feyzbakhsh Rankooh, Tomi Janhunen |
| 2022 | PADL | Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo. | Tomi Janhunen |
| 2021 | JELIA | On Syntactic Forgetting Under Uniform Equivalence. | Ricardo Gonalves, Tomi Janhunen, Matthias Knorr, Joo Leite |
| 2020 | IJCAI | On Robustness in Qualitative Constraint Networks. | Michael Sioutis, Zhiguo Long, Tomi Janhunen |
| 2019 | AAAI | Forgetting in Modular Answer Set Programming. | Ricardo Gonalves, Tomi Janhunen, Matthias Knorr, Joo Leite, Stefan Woltran |
| 2019 | AAAI | Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming. | Jori Bomanson, Tomi Janhunen, Antonius Weinzierl |
| 2019 | KI | Towards Leveraging Backdoors in Qualitative Constraint Networks. | Michael Sioutis, Tomi Janhunen |
| 2019 | LPNMR | The Return of xorro. | Flavio Everardo, Tomi Janhunen, Roland Kaminski, Torsten Schaub |
| 2019 | TIME | On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning. | Michael Sioutis, Anastasia Paparrizou, Tomi Janhunen |
| 2018 | KR | Variable Elimination for DLP-Functions. | Ricardo Gonalves, Tomi Janhunen, Matthias Knorr, Joo Leite, Stefan Woltran |
| 2018 | KR | Towards Lazy Grounding with Lazy Normalization in Answer-Set Programming - Extended Abstract. | Jori Bomanson, Tomi Janhunen, Antonius Weinzierl |
| 2017 | LPNMR | clingo goes Linear Constraints over Reals and Integers. | Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko |
| 2016 | AAAI | Solving QBF Instances with Nested SAT Solvers. | Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi |
| 2016 | AAAI | SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators. | Tomi Janhunen, Shahab Tasharrofi, Eugenia Ternovska |
| 2016 | ICLP | Rewriting Optimization Statements in Answer-Set Programs. | Jori Bomanson, Martin Gebser, Tomi Janhunen |
| 2016 | JELIA | Writing Declarative Specifications for Clauses. | Martin Gebser, Tomi Janhunen, Roland Kaminski, Torsten Schaub, Shahab Tasharrofi |
| 2016 | KR | Declarative Solver Development: Case Studies. | Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi |
| 2016 | SAT | SAT-to-SAT in QBFEval 2016. | Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi |
| 2015 | ICML | Accessibility by Public Transport Predicts Residential Real Estate Prices: A Case Study in Helsinki Region. | Indre Zliobaite, Michael Mathioudakis, Tuukka Lehtiniemi, Pekka Parviainen, Tomi Janhunen |
| 2015 | LPNMR | Answer Set Programming Modulo Acyclicity. | Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub |
| 2015 | LPNMR | ASP Solving for Expanding Universes. | Martin Gebser, Tomi Janhunen, Holger Jost, Roland Kaminski, Torsten Schaub |
| 2014 | ECAI | Answer Set Programming as SAT modulo Acyclicity. | Martin Gebser, Tomi Janhunen, Jussi Rintanen |
| 2014 | JELIA | Improving the Normalization of Weight Rules in Answer Set Programs. | Jori Bomanson, Martin Gebser, Tomi Janhunen |
| 2014 | JELIA | SAT Modulo Graphs: Acyclicity. | Martin Gebser, Tomi Janhunen, Jussi Rintanen |
| 2014 | KR | ASP Encodings of Acyclicity Properties. | Martin Gebser, Tomi Janhunen, Jussi Rintanen |
| 2013 | LPNMR | Normalizing Cardinality Rules Using Merging and Sorting Constructions. | Jori Bomanson, Tomi Janhunen |
| 2012 | KR | Answer Set Programming via Mixed Integer Programming. | Guohua Liu, Tomi Janhunen, Ilkka Niemel |
| 2011 | LPNMR | Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. | Tomi Janhunen, Ilkka Niemel, Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2011 | LPNMR | Strong Equivalence of Logic Programs with Abstract Constraint Atoms. | Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemel, Jia-Huai You |
| 2010 | ECAI | On Testing Answer-Set Programs. | Tomi Janhunen, Ilkka Niemel, Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2010 | ICLP | Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. | Tomi Janhunen |
| 2009 | LPNMR | Computing Stable Models via Reductions to Difference Logic. | Tomi Janhunen, Ilkka Niemel, Mark Sevalnev |
| 2009 | LPNMR | A Module-Based Framework for Multi-language Constraint Modeling. | Matti Jrvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemel |
| 2008 | AIMSA | Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. | Emilia Oikarinen, Tomi Janhunen |
| 2008 | ECAI | Modular Equivalence in General. | Tomi Janhunen |
| 2008 | ICLP | Removing Redundancy from Answer Set Programs. | Tomi Janhunen |
| 2007 | ICLP | A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. | Emilia Oikarinen, Tomi Janhunen |
| 2007 | LPNMR | Modularity Aspects of Disjunctive Stable Models. | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran |
| 2006 | ECAI | What's a Head Without a Body? | Christian Anger, Martin Gebser, Tomi Janhunen, Torsten Schaub |
| 2006 | ECAI | On Probing and Multi-Threading in Platypus. | Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy |
| 2006 | ECAI | Modular Equivalence for Normal Logic Programs. | Emilia Oikarinen, Tomi Janhunen |
| 2005 | LPNMR | Platypus: A Platform for Distributed Answer Set Solving. | Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy |
| 2005 | LPNMR | circ2dlp - Translating Circumscription into Disjunctive Logic Programming. | Emilia Oikarinen, Tomi Janhunen |
| 2004 | ECAI | Representing Normal Programs with Clauses. | Tomi Janhunen |
| 2004 | JELIA | Capturing Parallel Circumscription with Disjunctive Logic Programs. | Tomi Janhunen, Emilia Oikarinen |
| 2004 | LPNMR | GNT - A Solver for Disjunctive Logic Programs. | Tomi Janhunen, Ilkka Niemel |
| 2004 | LPNMR | LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. | Tomi Janhunen, Emilia Oikarinen |
| 2004 | LPNMR | Verifying the Equivalence of Logic Programs in the Disjunctive Case. | Emilia Oikarinen, Tomi Janhunen |
| 2002 | JELIA | Testing the Equivalence of Logic Programs under Stable Model Semantics. | Tomi Janhunen, Emilia Oikarinen |
| 2001 | LPNMR | On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. | Tomi Janhunen |
| 2000 | JELIA | Capturing Stationary and Regular Extensions with Reiter's Extensions. | Tomi Janhunen |
| 2000 | KR | Unfolding Partiality and Disjunctions in Stable Model Semantics. | Tomi Janhunen, Ilkka Niemel, Patrik Simons, Jia-Huai You |
| 1999 | LPNMR | Classifying Semi-Normal Default Logic on the Basis of its Expressive Power. | Tomi Janhunen |
| 1998 | JELIA | On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription. | Tomi Janhunen |
| 1997 | LPNMR | Separating Disbeliefs from Beliefs in Autoepistemic Reasoning. | Tomi Janhunen |
| 1996 | ECAI | Representing Autoepistemic Introspection in Terms of Default Rules. | Tomi Janhunen |