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

Search the dblp DataBase

Title:
Author:
Hans Tompits: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:417-422 [Conf]
  2. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:695-700 [Conf]
  3. James P. Delgrande, Torsten Schaub, Hans Tompits
    Domain-Specific Preferences for Causal Reasoning and Planning. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2004, pp:63-72 [Conf]
  4. Hans Tompits, Stefan Woltran
    Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2005, pp:- [Conf]
  5. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  6. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2003, pp:- [Conf]
  7. Uwe Egly, Hans Tompits
    Some Strengths of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    Intellectics and Computational Logic, 2000, pp:125-141 [Conf]
  8. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
    Representing Paraconsistent Reasoning via Quantified Propositional Logic. [Citation Graph (0, 0)][DBLP]
    Inconsistency Tolerance, 2005, pp:84-118 [Conf]
  9. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Declarative Update Policies for Nonmonotonic Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    Logics for Emerging Applications of Databases, 2003, pp:85-129 [Conf]
  10. James P. Delgrande, Torsten Schaub, Hans Tompits
    Logic Programs with Compiled Preferences. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:464-468 [Conf]
  11. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
    Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2003, pp:528-539 [Conf]
  12. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
    On Computing Solutions to Belief Change Scenarios. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2001, pp:510-521 [Conf]
  13. Uwe Egly, Hans Tompits
    Non-elementary Speed-Ups in Default Reasoning. [Citation Graph (0, 0)][DBLP]
    ECSQARU-FAPR, 1997, pp:237-251 [Conf]
  14. David Pearce, Hans Tompits, Stefan Woltran
    Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. [Citation Graph (0, 0)][DBLP]
    EPIA, 2001, pp:306-320 [Conf]
  15. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. [Citation Graph (0, 0)][DBLP]
    ESWC, 2006, pp:273-287 [Conf]
  16. Thomas Linke, Hans Tompits, Stefan Woltran
    On Acyclic and Head-Cycle Free Nested Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2004, pp:225-239 [Conf]
  17. David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
    A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:405-420 [Conf]
  18. Hans Tompits, Stefan Woltran
    Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2005, pp:189-203 [Conf]
  19. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    A Framework for Declarative Update Specifications in Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:649-654 [Conf]
  20. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:90-96 [Conf]
  21. Thomas Eiter, Hans Tompits, Stefan Woltran
    On Solution Correspondences in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:97-102 [Conf]
  22. Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
    Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:304-309 [Conf]
  23. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Complexity Results for Checking Equivalence of Stratified Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:330-335 [Conf]
  24. James P. Delgrande, Torsten Schaub, Hans Tompits
    A Compilation of Brewka and Eiter's Approach to Prioritization. [Citation Graph (0, 0)][DBLP]
    JELIA, 2000, pp:376-390 [Conf]
  25. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
    Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:320-331 [Conf]
  26. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Considerations on Updates of Logic Programs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2000, pp:2-20 [Conf]
  27. Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
    ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:502-505 [Conf]
  28. James P. Delgrande, Torsten Schaub, Hans Tompits
    Domain-Specific Preferences for Causal Reasoning and Planning. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:673-682 [Conf]
  29. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    A Generic Approach for Knowledge-Based Information-Site Selection. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:459-469 [Conf]
  30. Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
    Replacements in Non-Ground Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:340-351 [Conf]
  31. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    On Eliminating Disjunctions in Stable Logic Programming. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:447-458 [Conf]
  32. Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
    Combining Answer Set Programming with Description Logics for the Semantic Web. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:141-151 [Conf]
  33. Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
    On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. [Citation Graph (0, 0)][DBLP]
    KSEM, 2006, pp:1-22 [Conf]
  34. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about Evolving Nonmonotonic Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:407-421 [Conf]
  35. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    Nonmonotonic Description Logic Programs: Implementation and Experiments. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:511-527 [Conf]
  36. Uwe Egly, Hans Tompits
    Is Non-Monotonic Reasoning Always Harder? [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:60-75 [Conf]
  37. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    An Update Front-End for Extended Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:397-401 [Conf]
  38. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Simplifying Logic Programs Under Uniform and Strong Equivalence. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:87-99 [Conf]
  39. James P. Delgrande, Torsten Schaub, Hans Tompits
    plp: A Generic Compiler for Ordered Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:411-415 [Conf]
  40. Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
    nlp: A Compiler for Nested Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:361-364 [Conf]
  41. Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran
    Debugging ASP Programs by Means of ASP. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:31-43 [Conf]
  42. James P. Delgrande, Torsten Schaub, Hans Tompits
    A Preference-Based Framework for Updating Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:71-83 [Conf]
  43. Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran
    Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:123-135 [Conf]
  44. 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]
  45. Thomas Linke, Hans Tompits, Stefan Woltran
    On acyclic and head-cycle free nested logic programs. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:267-275 [Conf]
  46. David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
    A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:57-66 [Conf]
  47. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
    Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. [Citation Graph (0, 0)][DBLP]
    Paraconsistent Computational Logic, 2002, pp:1-15 [Conf]
  48. Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
    Well-Founded Semantics for Description Logic Programs in the Semantic Web. [Citation Graph (0, 0)][DBLP]
    RuleML, 2004, pp:81-97 [Conf]
  49. Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits
    Reasoning with Rules and Ontologies. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2006, pp:93-127 [Conf]
  50. Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
    Comparing Different Prenexing Strategies for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:214-228 [Conf]
  51. Uwe Egly, Hans Tompits
    On Proof Complexity of Circumscription. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1998, pp:141-155 [Conf]
  52. Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2002, pp:100-114 [Conf]
  53. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang
    Forgetting in Managing Rules and Ontologies. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2006, pp:411-419 [Conf]
  54. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2006, pp:1073-1074 [Conf]
  55. Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits
    A Web-based Tutoring Tool for Calculating Default Logic Extensions. [Citation Graph (0, 0)][DBLP]
    WebNet, 1999, pp:1251-1252 [Conf]
  56. Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
    A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. [Citation Graph (0, 0)][DBLP]
    WLP, 2006, pp:200-205 [Conf]
  57. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. [Citation Graph (0, 0)][DBLP]
    15. WLP, 2000, pp:113-122 [Conf]
  58. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    Implementing Default Reasoning Using Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    WLP, 2000, pp:223-228 [Conf]
  59. Uwe Egly, Hans Tompits
    A Sequent Calculus for Intuitionistic Default Logic. [Citation Graph (0, 0)][DBLP]
    WLP, 1997, pp:0-0 [Conf]
  60. Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
    Replacements in Non-Ground Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    WLP, 2006, pp:145-153 [Conf]
  61. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. [Citation Graph (0, 0)][DBLP]
    WLP, 2006, pp:206-210 [Conf]
  62. Hans Tompits
    Expressing default abduction problems as quantified Boolean formulas. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2003, v:16, n:2, pp:89-105 [Journal]
  63. James P. Delgrande, Torsten Schaub, Hans Tompits
    A Compiler for Ordered Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  64. James P. Delgrande, Torsten Schaub, Hans Tompits
    Logic Programs with Compiled Preferences [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  65. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  66. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    On Properties of Update Sequences Based on Causal Rejection [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  67. James P. Delgrande, Torsten Schaub, Hans Tompits
    A Framework for Compiling Preferences in Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  68. David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
    A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  69. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about Evolving Nonmonotonic Knowledge Bases [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  70. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Using Methods of Declarative Logic Programming for Intelligent Information Agents [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  71. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
    On Computing Belief Change Operations using Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2004, v:14, n:6, pp:801-826 [Journal]
  72. Uwe Egly, Hans Tompits
    On Different Proof-Search Strategies for Orthologic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2003, v:73, n:1, pp:131-152 [Journal]
  73. Uwe Egly, Hans Tompits
    Proof-complexity results for nonmonotonic reasoning. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2001, v:2, n:3, pp:340-387 [Journal]
  74. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about evolving nonmonotonic knowledge bases. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:2, pp:389-440 [Journal]
  75. James P. Delgrande, Torsten Schaub, Hans Tompits
    A Framework for Compiling Preferences in Logic Programs. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:2, pp:129-187 [Journal]
  76. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    On Properties of Update Sequences Based on Causal Rejection. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:6, pp:711-767 [Journal]
  77. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Using Methods of Declarative Logic Programming for Intelligent Information Agents. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:6, pp:645-709 [Journal]
  78. Johannes Oetsch, Hans Tompits, Stefan Woltran
    Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:458-464 [Conf]
  79. Thomas Eiter, Michael Fink, Hans Tompits
    A Knowledge-Based Approach for Selecting Information Sources [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  80. A Meta-Programming Technique for Debugging Answer-Set Programs. [Citation Graph (, )][DBLP]


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


  82. Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. [Citation Graph (, )][DBLP]


  83. Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. [Citation Graph (, )][DBLP]


  84. Program Correspondence under the Answer-Set Semantics: The Non-ground Case. [Citation Graph (, )][DBLP]


  85. Merging Logic Programs under Answer Set Semantics. [Citation Graph (, )][DBLP]


  86. Methods and Methodologies for Developing Answer-Set Programs - Project Description. [Citation Graph (, )][DBLP]


  87. Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. [Citation Graph (, )][DBLP]


  88. Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. [Citation Graph (, )][DBLP]


  89. Belief Revision of Logic Programs under Answer Set Semantics. [Citation Graph (, )][DBLP]


  90. Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. [Citation Graph (, )][DBLP]


  91. Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. [Citation Graph (, )][DBLP]


  92. ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. [Citation Graph (, )][DBLP]


  93. Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. [Citation Graph (, )][DBLP]


  94. spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. [Citation Graph (, )][DBLP]


  95. Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. [Citation Graph (, )][DBLP]


  96. Combining answer set programming with description logics for the Semantic Web. [Citation Graph (, )][DBLP]


  97. A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. [Citation Graph (, )][DBLP]


  98. Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination [Citation Graph (, )][DBLP]


  99. Characterising equilibrium logic and nested logic programs: Reductions and complexity [Citation Graph (, )][DBLP]


  100. A general approach to belief change in answer set programming [Citation Graph (, )][DBLP]


  101. The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs [Citation Graph (, )][DBLP]


  102. Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.018secs
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