A Graphical User Interface for a Value Added Network. - Matti Hallivuori; Tomi Janhunen; Tapio Suihko (INDC, 1992)

A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. - Tomi Janhunen; Ilkka Niemelä (Kurt Gödel Colloquium, 1993)

Cautious Models for General Logic Programs. - Tomi Janhunen (Deductive Databases / Abduction in Deductive Databases, 1995)

Representing Autoepistemic Introspection in Terms of Default Rules. - Tomi Janhunen (ECAI, 1996)

Separating Disbeliefs from Beliefs in Autoepistemic Reasoning. - Tomi Janhunen (LPNMR, 1997)

On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription. - Tomi Janhunen (JELIA, 1998)

Classifying Semi-Normal Default Logic on the Basis of its Expressive Power. - Tomi Janhunen (LPNMR, 1999)

On the intertranslatability of non-monotonic logics. - Tomi Janhunen (Ann. Math. Artif. Intell., 1999)

Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs. - Tomi Janhunen (Computational Logic, 2000)

Capturing Stationary and Regular Extensions with Reiter's Extensions. - Tomi Janhunen (JELIA, 2000)

Unfolding Partiality and Disjunctions in Stable Model Semantics. - Tomi Janhunen; Ilkka Niemelä; Patrik Simons; Jia-Huai You (KR, 2000)

On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. - Tomi Janhunen (LPNMR, 2001)

Testing the Equivalence of Logic Programs under Stable Model Semantics. - Tomi Janhunen; Emilia Oikarinen (JELIA, 2002)

A Counter-Based Approach to Translating Normal Logic Programs into Sets of Clauses. - Tomi Janhunen (Answer Set Programming, 2003)

Evaluating the effect of semi-normality on the expressiveness of defaults. - Tomi Janhunen (Artif. Intell., 2003)

Representing Normal Programs with Clauses. - Tomi Janhunen (ECAI, 2004)

Capturing Parallel Circumscription with Disjunctive Logic Programs. - Tomi Janhunen; Emilia Oikarinen (JELIA, 2004)

GNT - A Solver for Disjunctive Logic Programs. - Tomi Janhunen; Ilkka Niemelä (LPNMR, 2004)

LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. - Tomi Janhunen; Emilia Oikarinen (LPNMR, 2004)

Verifying the Equivalence of Logic Programs in the Disjunctive Case. - Emilia Oikarinen; Tomi Janhunen (LPNMR, 2004)

Platypus: A Platform for Distributed Answer Set Solving. - Jean Gressmann; Tomi Janhunen; Robert E. Mercer; Torsten Schaub; Sven Thiele; Richard Tichy (LPNMR, 2005)

circ2dlp - Translating Circumscription into Disjunctive Logic Programming. - Emilia Oikarinen; Tomi Janhunen (LPNMR, 2005)

What's a Head Without a Body? - Christian Anger; Martin Gebser; Tomi Janhunen; Torsten Schaub (ECAI, 2006)

On Probing and Multi-Threading in Platypus. - Jean Gressmann; Tomi Janhunen; Robert E. Mercer; Torsten Schaub; Sven Thiele; Richard Tichy (ECAI, 2006)

Modular Equivalence for Normal Logic Programs. - Emilia Oikarinen; Tomi Janhunen (ECAI, 2006)

Some (in)translatability results for normal logic programs and propositional theories. - Tomi Janhunen (J. Appl. Non Class. Logics, 2006)

Unfolding partiality and disjunctions in stable model semantics. - Tomi Janhunen; Ilkka Niemelä; Dietmar Seipel; Patrik Simons; Jia-Huai You (ACM Trans. Comput. Log., 2006)

A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. - Emilia Oikarinen; Tomi Janhunen (ICLP, 2007)

Automated Verification of Weak Equivalence within the SMODELS System. - Tomi Janhunen; Emilia Oikarinen (Theory Pract. Log. Program., 2007)

Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. - Emilia Oikarinen; Tomi Janhunen (AIMSA, 2008)

Modular Equivalence in General. - Tomi Janhunen (ECAI, 2008)

Removing Redundancy from Answer Set Programs. - Tomi Janhunen (ICLP, 2008)

Achieving compositionality of the stable model semantics for smodels programs. - Emilia Oikarinen; Tomi Janhunen (Theory Pract. Log. Program., 2008)

Computing Stable Models via Reductions to Difference Logic. - Tomi Janhunen; Ilkka Niemelä; Mark Sevalnev (LPNMR, 2009)

A Module-Based Framework for Multi-language Constraint Modeling. - Matti Järvisalo; Emilia Oikarinen; Tomi Janhunen; Ilkka Niemelä (LPNMR, 2009)

Modularity Aspects of Disjunctive Stable Models. - Tomi Janhunen; Emilia Oikarinen; Hans Tompits; Stefan Woltran (J. Artif. Intell. Res., 2009)

A Translation-based Approach to the Verification of Modular Equivalence. - Emilia Oikarinen; Tomi Janhunen (J. Log. Comput., 2009)

On Testing Answer-Set Programs. - Tomi Janhunen; Ilkka Niemelä; Johannes Oetsch; Jörg Pührer; Hans Tompits (ECAI, 2010)

Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. - Tomi Janhunen (ICLP (Technical Communications), 2010)

Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses. - Tomi Janhunen; Ilkka Niemelä (Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011)

Translating Answer-Set Programs into Bit-Vector Logic. - Mai Nguyen; Tomi Janhunen; Ilkka Niemelä (INAP/WLP, 2011)

Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. - Tomi Janhunen; Ilkka Niemelä; Johannes Oetsch; Jörg Pührer; Hans Tompits (LPNMR, 2011)

Strong Equivalence of Logic Programs with Abstract Constraint Atoms. - Guohua Liu; Randy Goebel; Tomi Janhunen; Ilkka Niemelä; Jia-Huai You (LPNMR, 2011)

Distributed Deadlock Handling for Resource Allocation in Smart Spaces. - Rehan Abdul Aziz; Tomi Janhunen; Vesa Luukkala (NEW2AN, 2011)

Applying Visible Strong Equivalence in Answer-Set Program Transformations. - Tomi Janhunen; Ilkka Niemelä (Correct Reasoning, 2012)

Answer Set Programming via Mixed Integer Programming. - Guohua Liu; Tomi Janhunen; Ilkka Niemelä (KR, 2012)

Meta Programming with Answer Sets for Smart Spaces. - Tomi Janhunen; Vesa Luukkala (RR, 2012)

Introducing Real Variables and Integer Objective Functions to Answer Set Programming. - Guohua Liu; Tomi Janhunen; Ilkka Niemelä (KDPD, 2013)

Normalizing Cardinality Rules Using Merging and Sorting Constructions. - Jori Bomanson; Tomi Janhunen (LPNMR, 2013)

Learning Chordal Markov Networks by Constraint Satisfaction. - Jukka Corander; Tomi Janhunen; Jussi Rintanen; Henrik J. Nyman; Johan Pensar (NIPS, 2013)

Answer Set Programming as SAT modulo Acyclicity. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (ECAI, 2014)

Improving the Normalization of Weight Rules in Answer Set Programs. - Jori Bomanson; Martin Gebser; Tomi Janhunen (JELIA, 2014)

SAT Modulo Graphs: Acyclicity. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (JELIA, 2014)

ASP Encodings of Acyclicity Properties. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (KR, 2014)

Cumulativity Tailored for Nonmonotonic Reasoning. - Tomi Janhunen; Ilkka Niemelä (Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015)

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 (MUD@ICML, 2015)

ASP Solving for Expanding Universes. - Martin Gebser; Tomi Janhunen; Holger Jost; Roland Kaminski; Torsten Schaub (LPNMR, 2015)

Optimizing phylogenetic supertrees using answer set programming. - Laura Koponen; Emilia Oikarinen; Tomi Janhunen; Laura Säilä (Theory Pract. Log. Program., 2015)

Solving QBF Instances with Nested SAT Solvers. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (AAAI Workshop: Beyond NP, 2016)

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators. - Tomi Janhunen; Shahab Tasharrofi; Eugenia Ternovska (AAAI, 2016)

Rewriting Optimization Statements in Answer-Set Programs. - Jori Bomanson; Martin Gebser; Tomi Janhunen (ICLP (Technical Communications), 2016)

Writing Declarative Specifications for Clauses. - Martin Gebser; Tomi Janhunen; Roland Kaminski; Torsten Schaub; Shahab Tasharrofi (JELIA, 2016)

Declarative Solver Development: Case Studies. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (KR, 2016)

SAT-to-SAT in QBFEval 2016. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (QBF@SAT, 2016)

The Answer Set Programming Paradigm. - Tomi Janhunen; Ilkka Niemelä (AI Mag., 2016)

Answer Set Programming Modulo Acyclicity. - Jori Bomanson; Martin Gebser; Tomi Janhunen; Benjamin Kaufmann; Torsten Schaub (Fundam. Informaticae, 2016)

Stable-unstable semantics: Beyond NP with normal logic programs. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (Theory Pract. Log. Program., 2016)

Learning discrete decomposable graphical models via constraint optimization. - Tomi Janhunen; Martin Gebser; Jussi Rintanen; Henrik J. Nyman; Johan Pensar; Jukka Corander (Stat. Comput., 2017)

Clingo goes linear constraints over reals and integers. - Tomi Janhunen; Roland Kaminski; Max Ostrowski; Sebastian Schellhorn; Philipp Wanko; Torsten Schaub (Theory Pract. Log. Program., 2017)

Variable Elimination for DLP-Functions. - Ricardo Gonçalves 001; Tomi Janhunen; Matthias Knorr 001; João Leite 001; Stefan Woltran (KR, 2018)

Towards Lazy Grounding with Lazy Normalization in Answer-Set Programming - Extended Abstract. - Jori Bomanson; Tomi Janhunen; Antonius Weinzierl (KR, 2018)

Answer Set Programming - Related with Other Solving Paradigms. - Tomi Janhunen (Künstliche Intell., 2018)

Cross-Translating Answer Set Programs Using the ASPTOOLS Collection. - Tomi Janhunen (Künstliche Intell., 2018)

Forgetting in Modular Answer Set Programming. - Ricardo Gonçalves 001; Tomi Janhunen; Matthias Knorr 001; João Leite 001; Stefan Woltran (AAAI, 2019)

Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming. - Jori Bomanson; Tomi Janhunen; Antonius Weinzierl (AAAI, 2019)

Allen's Interval Algebra Makes the Difference. - Tomi Janhunen; Michael Sioutis (DECLARE, 2019)

Towards Leveraging Backdoors in Qualitative Constraint Networks. - Michael Sioutis; Tomi Janhunen (KI, 2019)

The Return of xorro. - Flavio Everardo; Tomi Janhunen; Roland Kaminski; Torsten Schaub (LPNMR, 2019)

On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning. - Michael Sioutis; Anastasia Paparrizou; Tomi Janhunen (TIME, 2019)

On Robustness in Qualitative Constraint Networks. - Michael Sioutis; Zhiguo Long; Tomi Janhunen (IJCAI, 2020)

Declarative encodings of acyclicity properties. - Martin Gebser; Tomi Janhunen; Jussi Rintanen (J. Log. Comput., 2020)

Applying Visible Strong Equivalence in Answer-Set Program Transformations. - Jori Bomanson; Tomi Janhunen; Ilkka Niemelä (ACM Trans. Comput. Log., 2020)

Boosting Answer Set Optimization with Weighted Comparator Networks. - Jori Bomanson; Tomi Janhunen (Theory Pract. Log. Program., 2020)

On Syntactic Forgetting Under Uniform Equivalence. - Ricardo Gonçalves 001; Tomi Janhunen; Matthias Knorr 001; João Leite 001 (JELIA, 2021)

On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning. - Michael Sioutis; Anastasia Paparrizou; Tomi Janhunen (Inf. Comput., 2021)

Solution Enumeration by Optimality in Answer Set Programming. - Jukka Pajunen; Tomi Janhunen (Theory Pract. Log. Program., 2021)

Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination. - Masood Feyzbakhsh Rankooh; Tomi Janhunen (LPNMR, 2022)

Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo. - Tomi Janhunen (PADL, 2022)

Plingo: A System for Probabilistic Reasoning in Clingo Based on LP MLN . - Susana Hahn; Tomi Janhunen; Roland Kaminski; Javier Romero 003; Nicolas Rühling; Torsten Schaub (RuleML+RR, 2022)

Applying Answer Set Optimization to Preventive Maintenance Scheduling for Rotating Machinery. - Anssi Yli-Jyrä; Tomi Janhunen (RuleML+RR, 2022)

plingo: A system for probabilistic reasoning in clingo based on lpmln. - Susana Hahn; Tomi Janhunen; Roland Kaminski; Javier Romero 003; Nicolas Rühling; Torsten Schaub (CoRR, 2022)

Short Boolean Formulas as Explanations in Practice. - Reijo Jaakkola; Tomi Janhunen; Antti Kuusisto; Masood Feyzbakhsh Rankooh; Miikka Vilander (JELIA, 2023)

Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling. - Anssi Yli-Jyrä; Masood Feyzbakhsh Rankooh; Tomi Janhunen (PADL, 2023)

Generalizing Level Ranking Constraints for Monotone and Convex Aggregates. - Tomi Janhunen (ICLP, 2023)

Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs. - Masood Feyzbakhsh Rankooh; Tomi Janhunen (Theory Pract. Log. Program., 2023)

Interpretable Classifiers for Tabular Data via Feature Selection and Discretization. - Reijo Jaakkola; Tomi Janhunen; Antti Kuusisto; Masood Feyzbakhsh Rankooh; Miikka Vilander (DAO-XAI@ECAI, 2024)

Integrating Competencies into Preventive Maintenance Scheduling with Answer Set Optimization. - Anssi Yli-Jyrä; Heini Ikävalko; Tomi Janhunen (FoIKS, 2024)

Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming. - Masood Feyzbakhsh Rankooh; Tomi Janhunen (IJCAI, 2024)

Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract). - Masood Feyzbakhsh Rankooh; Tomi Janhunen (IJCAI, 2024)

Automating Cybersecurity Compliance in DevSecOps with Open Information Model for Security as Code. - Henry Haverinen; Tomi Janhunen; Tero Päivärinta; Sami Lempinen; Suvi Kaartinen; Sami Merilä (eSAAM, 2024)

Interpretable classifiers for tabular data via discretization and feature selection. - Reijo Jaakkola; Tomi Janhunen; Antti Kuusisto; Masood Feyzbakhsh Rankooh; Miikka Vilander (CoRR, 2024)

Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions. - Reijo Jaakkola; Tomi Janhunen; Antti Kuusisto; Masood Feyzbakhsh Rankooh; Miikka Vilander (CoRR, 2024)

Explainability via Short Formulas: the Case of Propositional Logic with Implementation. - Reijo Jaakkola; Tomi Janhunen; Antti Kuusisto; Masood Feyzbakhsh Rankooh; Miikka Vilander (J. Artif. Intell. Res., 2025)

Plingo: A System for Probabilistic Reasoning in Answer Set Programming. - Susana Hahn; Tomi Janhunen; Roland Kaminski; Javier Romero 003; Nicolas Rühling; Torsten Schaub (Theory Pract. Log. Program., 2025)

Graph Learning via Logic-Based Weisfeiler-Leman Variants and Tabularization. - Reijo Jaakkola; Tomi Janhunen; Antti Kuusisto; Magdalena Ortiz 001; Matias Selin; Mantas Simkus (CoRR, 2025)