| 2012 | ||
|---|---|---|
| c39 | Tomi Janhunen, Ilkka Niemelä: Applying Visible Strong Equivalence in Answer-Set Program Transformations. Correct Reasoning 2012: 363-379 | |
| c38 | Guohua Liu, Tomi Janhunen, Ilkka Niemelä: Answer Set Programming via Mixed Integer Programming. KR 2012 | |
| c37 | ||
| 2011 | ||
| c36 | Tomi Janhunen, Ilkka Niemelä: Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 111-130 | |
| c35 | Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You: Strong Equivalence of Logic Programs with Abstract Constraint Atoms. LPNMR 2011: 161-173 | |
| c34 | Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits: Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. LPNMR 2011: 242-247 | |
| c33 | Rehan Abdul Aziz, Tomi Janhunen, Vesa Luukkala: Distributed Deadlock Handling for Resource Allocation in Smart Spaces. NEW2AN 2011: 87-98 | |
| i4 | Mai Nguyen, Tomi Janhunen, Ilkka Niemelä: Translating Answer-Set Programs into Bit-Vector Logic. CoRR abs/1108.5837 (2011) | |
| 2010 | ||
| c32 | Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits: On Testing Answer-Set Programs. ECAI 2010: 951-956 | |
| c31 | Tomi Janhunen: Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. ICLP (Technical Communications) 2010: 94-103 | |
| e1 | Tomi Janhunen, Ilkka Niemelä (Eds.): Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6341, Springer 2010, isbn 978-3-642-15674-8 | |
| 2009 | ||
| j8 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. (JAIR) 35: 813-857 (2009) | |
| j7 | Emilia Oikarinen, Tomi Janhunen: A Translation-based Approach to the Verification of Modular Equivalence. J. Log. Comput. 19(4): 591-613 (2009) | |
| c30 | Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev: Computing Stable Models via Reductions to Difference Logic. LPNMR 2009: 142-154 | |
| c29 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä: A Module-Based Framework for Multi-language Constraint Modeling. LPNMR 2009: 155-168 | |
| 2008 | ||
| j6 | Emilia Oikarinen, Tomi Janhunen: Achieving compositionality of the stable model semantics for smodels programs. TPLP 8(5-6): 717-761 (2008) | |
| c28 | Emilia Oikarinen, Tomi Janhunen: Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. AIMSA 2008: 167-180 | |
| c27 | ||
| c26 | ||
| i3 | Emilia Oikarinen, Tomi Janhunen: Achieving compositionality of the stable model semantics for Smodels programs. CoRR abs/0809.4582 (2008) | |
| 2007 | ||
| j5 | Tomi Janhunen, Emilia Oikarinen: Automated Verification of Weak Equivalence within the SMODELS System. TPLP 7(6): 697-744 (2007) | |
| c25 | Emilia Oikarinen, Tomi Janhunen: A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. ICLP 2007: 440-441 | |
| c24 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187 | |
| 2006 | ||
| j4 | Tomi Janhunen: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16(1-2): 35-86 (2006) | |
| j3 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log. 7(1): 1-37 (2006) | |
| c23 | Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy: On Probing and Multi-Threading in Platypus. ECAI 2006: 392-396 | |
| c22 | ||
| c21 | Christian Anger, Martin Gebser, Tomi Janhunen, Torsten Schaub: What's a Head Without a Body? ECAI 2006: 769-770 | |
| i2 | Tomi Janhunen, Emilia Oikarinen: Automated verification of weak equivalence within the SMODELS system. CoRR abs/cs/0608099 (2006) | |
| 2005 | ||
| c20 | Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy: Platypus: A Platform for Distributed Answer Set Solving. LPNMR 2005: 227-239 | |
| c19 | Emilia Oikarinen, Tomi Janhunen: circ2dlp - Translating Circumscription into Disjunctive Logic Programming. LPNMR 2005: 405-409 | |
| 2004 | ||
| c18 | ||
| c17 | Tomi Janhunen, Emilia Oikarinen: Capturing Parallel Circumscription with Disjunctive Logic Programs. JELIA 2004: 134-146 | |
| c16 | Emilia Oikarinen, Tomi Janhunen: Verifying the Equivalence of Logic Programs in the Disjunctive Case. LPNMR 2004: 180-193 | |
| c15 | ||
| c14 | Tomi Janhunen, Emilia Oikarinen: LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. LPNMR 2004: 336-340 | |
| 2003 | ||
| j2 | Tomi Janhunen: Evaluating the effect of semi-normality on the expressiveness of defaults. Artif. Intell. 144(1-2): 233-250 (2003) | |
| c13 | Tomi Janhunen: A Counter-Based Approach to Translating Normal Logic Programs into Sets of Clauses. Answer Set Programming 2003 | |
| i1 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You: Unfolding Partiality and Disjunctions in Stable Model Semantics. CoRR cs.AI/0303009 (2003) | |
| 2002 | ||
| c12 | Tomi Janhunen, Emilia Oikarinen: Testing the Equivalence of Logic Programs under Stable Model Semantics. JELIA 2002: 493-504 | |
| 2001 | ||
| c11 | Tomi Janhunen: On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. LPNMR 2001: 93-106 | |
| 2000 | ||
| c10 | Tomi Janhunen: Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs. Computational Logic 2000: 852-866 | |
| c9 | Tomi Janhunen: Capturing Stationary and Regular Extensions with Reiter's Extensions. JELIA 2000: 102-117 | |
| c8 | Tomi Janhunen, Ilkka Niemelä, Patrik Simons, Jia-Huai You: Unfolding Partiality and Disjunctions in Stable Model Semantics. KR 2000: 411-422 | |
| 1999 | ||
| j1 | Tomi Janhunen: On the intertranslatability of non-monotonic logics. Ann. Math. Artif. Intell. 27(1-4): 79-128 (1999) | |
| c7 | Tomi Janhunen: Classifying Semi-Normal Default Logic on the Basis of its Expressive Power. LPNMR 1999: 19-33 | |
| 1998 | ||
| c6 | Tomi Janhunen: On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription. JELIA 1998: 216-232 | |
| 1997 | ||
| c5 | ||
| 1996 | ||
| c4 | ||
| 1995 | ||
| c3 | Tomi Janhunen: Cautious Models for General Logic Programs. Deductive Databases / Abduction in Deductive Databases 1995: 25-39 | |
| 1993 | ||
| c2 | Tomi Janhunen, Ilkka Niemelä: A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. Kurt Gödel Colloquium 1993: 211-222 | |
| 1992 | ||
| c1 | Matti Hallivuori, Tomi Janhunen, Tapio Suihko: A Graphical User Interface for a Value Added Network. INDC 1992: 293-307 | |
Colors in the list of coauthors
Last update Sat May 25 22:03:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page