The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan Woltran: [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. 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]
  4. 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]
  5. Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran
    Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2003, 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. 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]
  8. Uwe Egly, Martina Seidl, Stefan Woltran
    A Solver for QBFs in Nonprenex Form. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:477-481 [Conf]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. Thomas Eiter, Hans Tompits, Stefan Woltran
    On Solution Correspondences in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:97-102 [Conf]
  16. 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]
  17. 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]
  18. Thomas Eiter, Patrick Traxler, Stefan Woltran
    An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:477-480 [Conf]
  19. 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]
  20. Stefan Woltran
    Characterizations for Relativized Notions of Equivalence in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:161-173 [Conf]
  21. Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran
    Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:377-387 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. Uwe Egly, Reinhard Pichler, Stefan Woltran
    On deciding subsumption problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:255-294 [Journal]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. Thomas Eiter, Michael Fink, Stefan Woltran
    Semantical Characterizations and Complexity of Equivalences in Answer Set Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  44. Thomas Eiter, Michael Fink, Stefan Woltran
    Semantical characterizations and complexity of equivalences in answer set programming. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:3, pp:- [Journal]

  45. Hyperequivalence of Logic Programs with Respect to Supported Models. [Citation Graph (, )][DBLP]


  46. Representing Preferences Among Sets. [Citation Graph (, )][DBLP]


  47. Multicut Algorithms via Tree Decompositions. [Citation Graph (, )][DBLP]


  48. Strong Equivalence in Argumentation. [Citation Graph (, )][DBLP]


  49. The Complexity of Handling Minimal Solutions in Logic-Based Abduction. [Citation Graph (, )][DBLP]


  50. dRDF: Entailment for Domain-Restricted RDF. [Citation Graph (, )][DBLP]


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


  52. Relativized Hyperequivalence of Logic Programs for Modular Programming. [Citation Graph (, )][DBLP]


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


  54. ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. [Citation Graph (, )][DBLP]


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


  56. Answer-Set Programming with Bounded Treewidth. [Citation Graph (, )][DBLP]


  57. A Dynamic-Programming Based ASP-Solver. [Citation Graph (, )][DBLP]


  58. Sets of Boolean Connectives That Make Argumentation Easier. [Citation Graph (, )][DBLP]


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


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


  61. Towards Fixed-Parameter Tractable Algorithms for Argumentation. [Citation Graph (, )][DBLP]


  62. Characterizing Strong Equivalence for Argumentation Frameworks. [Citation Graph (, )][DBLP]


  63. Abstract Dialectical Frameworks. [Citation Graph (, )][DBLP]


  64. Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. [Citation Graph (, )][DBLP]


  65. Fast Counting with Bounded Treewidth. [Citation Graph (, )][DBLP]


  66. A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. [Citation Graph (, )][DBLP]


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


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


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


  70. Manifold Answer-Set Programs for Meta-reasoning. [Citation Graph (, )][DBLP]


  71. Belief Revision with Bounded Treewidth. [Citation Graph (, )][DBLP]


  72. Alternation as a programming paradigm. [Citation Graph (, )][DBLP]


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


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


  75. Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. [Citation Graph (, )][DBLP]


  76. Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. [Citation Graph (, )][DBLP]


  77. Minimising RDF Graphs under Rules and Constraints Revisited. [Citation Graph (, )][DBLP]


  78. Encoding deductive argumentation in quantified Boolean formulae. [Citation Graph (, )][DBLP]


  79. Complexity results for answer set programming with bounded predicate arities and implications. [Citation Graph (, )][DBLP]


  80. Hyperequivalence of logic programs with respect to supported models. [Citation Graph (, )][DBLP]


  81. A solver for QBFs in negation normal form. [Citation Graph (, )][DBLP]


  82. A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming [Citation Graph (, )][DBLP]


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


  84. Relativized hyperequivalence of logic programs for modular programming [Citation Graph (, )][DBLP]


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


Search in 0.005secs, Finished in 0.008secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002