The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Tomi Janhunen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomi Janhunen
    A Counter-Based Approach to Translating Normal Logic Programs into Sets of Clauses. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2003, pp:- [Conf]
  2. Tomi Janhunen
    Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:852-866 [Conf]
  3. Tomi Janhunen
    Cautious Models for General Logic Programs. [Citation Graph (0, 0)][DBLP]
    Deductive Databases / Abduction in Deductive Databases, 1995, pp:25-39 [Conf]
  4. Christian Anger, Martin Gebser, Tomi Janhunen, Torsten Schaub
    What's a Head Without a Body? [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:769-770 [Conf]
  5. Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy
    On Probing and Multi-Threading in Platypus. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:392-396 [Conf]
  6. Tomi Janhunen
    Representing Normal Programs with Clauses. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:358-362 [Conf]
  7. Tomi Janhunen
    Representing Autoepistemic Introspection in Terms of Default Rules. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:70-74 [Conf]
  8. Emilia Oikarinen, Tomi Janhunen
    Modular Equivalence for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:412-416 [Conf]
  9. Matti Hallivuori, Tomi Janhunen, Tapio Suihko
    A Graphical User Interface for a Value Added Network. [Citation Graph (0, 0)][DBLP]
    INDC, 1992, pp:293-307 [Conf]
  10. Tomi Janhunen
    Capturing Stationary and Regular Extensions with Reiter's Extensions. [Citation Graph (0, 0)][DBLP]
    JELIA, 2000, pp:102-117 [Conf]
  11. Tomi Janhunen
    On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription. [Citation Graph (0, 0)][DBLP]
    JELIA, 1998, pp:216-232 [Conf]
  12. Tomi Janhunen, Emilia Oikarinen
    Testing the Equivalence of Logic Programs under Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:493-504 [Conf]
  13. Tomi Janhunen, Emilia Oikarinen
    Capturing Parallel Circumscription with Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:134-146 [Conf]
  14. Tomi Janhunen, Ilkka Niemelä
    A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:211-222 [Conf]
  15. Tomi Janhunen, Ilkka Niemelä, Patrik Simons, Jia-Huai You
    Unfolding Partiality and Disjunctions in Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:411-422 [Conf]
  16. Tomi Janhunen, Ilkka Niemelä
    GNT - A Solver for Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:331-335 [Conf]
  17. Tomi Janhunen, Emilia Oikarinen
    LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:336-340 [Conf]
  18. Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy
    Platypus: A Platform for Distributed Answer Set Solving. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:227-239 [Conf]
  19. Tomi Janhunen
    On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:93-106 [Conf]
  20. Tomi Janhunen
    Separating Disbeliefs from Beliefs in Autoepistemic Reasoning. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:132-151 [Conf]
  21. Tomi Janhunen
    Classifying Semi-Normal Default Logic on the Basis of its Expressive Power. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:19-33 [Conf]
  22. Emilia Oikarinen, Tomi Janhunen
    Verifying the Equivalence of Logic Programs in the Disjunctive Case. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:180-193 [Conf]
  23. Emilia Oikarinen, Tomi Janhunen
    circ2dlp - Translating Circumscription into Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:405-409 [Conf]
  24. Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran
    Modularity Aspects of Disjunctive Stable Models. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:175-187 [Conf]
  25. Tomi Janhunen
    Evaluating the effect of semi-normality on the expressiveness of defaults. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:144, n:1-2, pp:233-250 [Journal]
  26. Tomi Janhunen
    On the intertranslatability of non-monotonic logics. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:27, n:1-4, pp:79-128 [Journal]
  27. Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
    Unfolding Partiality and Disjunctions in Stable Model Semantics [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  28. Tomi Janhunen
    Some (in)translatability results for normal logic programs and propositional theories. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2006, v:16, n:1-2, pp:35-86 [Journal]
  29. Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
    Unfolding partiality and disjunctions in stable model semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:1, pp:1-37 [Journal]
  30. Emilia Oikarinen, Tomi Janhunen
    A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2007, pp:440-441 [Conf]
  31. Tomi Janhunen, Emilia Oikarinen
    Automated verification of weak equivalence within the SMODELS system [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  32. Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. [Citation Graph (, )][DBLP]


  33. Modular Equivalence in General. [Citation Graph (, )][DBLP]


  34. On Testing Answer-Set Programs. [Citation Graph (, )][DBLP]


  35. Removing Redundancy from Answer Set Programs. [Citation Graph (, )][DBLP]


  36. Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. [Citation Graph (, )][DBLP]


  37. A Module-Based Framework for Multi-language Constraint Modeling. [Citation Graph (, )][DBLP]


  38. Computing Stable Models via Reductions to Difference Logic. [Citation Graph (, )][DBLP]


  39. Achieving compositionality of the stable model semantics for Smodels programs [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002