Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stefan Woltran
2010 – today
- 2013
[i14]Günther Charwat, Johannes Peter Wallner, Stefan Woltran: Utilizing ASP for Generating and Visualizing Argumentation Frameworks. CoRR abs/1301.1388 (2013)- 2012
- [j17]Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran: Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186: 1-37 (2012)
- [j16]Bernhard Bliem, Michael Morak, Stefan Woltran: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. TPLP 12(4-5): 445-464 (2012)
- [c90]Ringo Baumann, Gerhard Brewka, Wolfgang Dvorák, Stefan Woltran: Parameterized Splitting: A Simple Modification-Based Approach. Correct Reasoning 2012: 57-71
- [c89]Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126
- [c88]Michael Morak, Stefan Woltran: Preprocessing of Complex Non-Ground Rules in Answer Set Programming. ICLP (Technical Communications) 2012: 247-258
- [c87]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran: Belief Revision within Fragments of Propositional Logic. KR 2012
- [c86]Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran: Complexity-Sensitive Decision Procedures for Abstract Argumentation. KR 2012
- [c85]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran: Strong Equivalence of Qualitative Optimization Problems. KR 2012
- [c84]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144
- [c83]Wolfgang Dvorák, Stefan Szeider, Stefan Woltran: Abstract Argumentation via Monadic Second Order Logic. SUM 2012: 85-98
- [e3]Bart Verheij, Stefan Szeider, Stefan Woltran (Eds.): Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012. Frontiers in Artificial Intelligence and Applications 245, IOS Press 2012, ISBN 978-1-61499-110-6
- [i13]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012)
- [i12]Bernhard Bliem, Michael Morak, Stefan Woltran: D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming. CoRR abs/1210.1931 (2012)
- [i11]Mario Alviano, Wolfgang Faber, Stefan Woltran: Complexity of super-coherence problems in ASP. CoRR abs/1212.5895 (2012)
- 2011
- [j15]Emilia Oikarinen, Stefan Woltran: Characterizing strong equivalence for argumentation frameworks. Artif. Intell. 175(14-15): 1985-2009 (2011)
- [j14]Marcello Balduccini, Stefan Woltran: Special issue on answer set programming. AI Commun. 24(2): 105-106 (2011)
- [j13]Wolfgang Dvorák, Stefan Woltran: On the Intertranslatability of Argumentation Semantics. J. Artif. Intell. Res. (JAIR) 41: 445-475 (2011)
- [c82]Wolfgang Faber, Stefan Woltran: Manifold Answer-Set Programs and Their Applications. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 44-63
- [c81]Mario Alviano, Wolfgang Faber, Stefan Woltran: Complexity of Super-Coherence Problems in Answer Set Programming. CILC 2011: 131-145
- [c80]Sarah Alice Gaggl, Stefan Woltran: Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. ECSQARU 2011: 38-49
- [c79]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918
- [c78]Gerhard Brewka, Paul E. Dunne, Stefan Woltran: Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. IJCAI 2011: 780-785
- [c77]Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran: Parametric Properties of Ideal Semantics. IJCAI 2011: 851-856
- [i10]Wolfgang Dvorák, Michael Morak, Clemens Nopp, Stefan Woltran: dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. CoRR abs/1108.4804 (2011)
- [i9]Wolfgang Dvorák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran: Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. CoRR abs/1108.4942 (2011)
- [i8]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran: Strong Equivalence of Qualitative Optimization Problems. CoRR abs/1112.0791 (2011)
- 2010
- [j12]Wolfgang Dvorák, Stefan Woltran: Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11): 425-430 (2010)
- [c76]Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran: Representing Preferences Among Sets. AAAI 2010
- [c75]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran: Minimising RDF Graphs under Rules and Constraints Revisited. AMW 2010
- [c74]Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Multicut Algorithms via Tree Decompositions. CIAC 2010: 167-179
- [c73]
- [c72]Wolfgang Dvorák, Stefan Szeider, Stefan Woltran: Reasoning in Argumentation Frameworks of Bounded Clique-Width. COMMA 2010: 219-230
- [c71]
- [c70]Stefan Woltran: Equivalence between Extended Datalog Programs - A Brief Survey. Datalog 2010: 106-119
- [c69]Reinhard Pichler, Stefan Woltran: The Complexity of Handling Minimal Solutions in Logic-Based Abduction. ECAI 2010: 895-900
- [c68]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran: Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129
- [c67]Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A Dynamic-Programming Based ASP-Solver. JELIA 2010: 369-372
- [c66]
- [c65]Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran: Towards Fixed-Parameter Tractable Algorithms for Argumentation. KR 2010
- [c64]Emilia Oikarinen, Stefan Woltran: Characterizing Strong Equivalence for Argumentation Frameworks. KR 2010
- [c63]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010
- [c62]Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) 2010: 387-404
- [c61]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran: Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. RR 2010: 133-148
2000 – 2009
- 2009
- [j11]Philippe Besnard, Anthony Hunter, Stefan Woltran: Encoding deductive argumentation in quantified Boolean formulae. Artif. Intell. 173(15): 1406-1423 (2009)
- [j10]Uwe Egly, Martina Seidl, Stefan Woltran: A solver for QBFs in negation normal form. Constraints 14(1): 38-79 (2009)
- [j9]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. (JAIR) 35: 813-857 (2009)
- [j8]David Pearce, Hans Tompits, Stefan Woltran: Characterising equilibrium logic and nested logic programs: Reductions and complexity, . TPLP 9(5): 565-616 (2009)
- [j7]Miroslaw Truszczynski, Stefan Woltran: Relativized hyperequivalence of logic programs for modular programming. TPLP 9(6): 781-819 (2009)
- [c60]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Merging Logic Programs under Answer Set Semantics. ICLP 2009: 160-174
- [c59]Michael Jakl, Reinhard Pichler, Stefan Woltran: Answer-Set Programming with Bounded Treewidth. IJCAI 2009: 816-822
- [c58]Wolfgang Faber, Stefan Woltran: Manifold Answer-Set Programs for Meta-reasoning. LPNMR 2009: 115-128
- [c57]Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Belief Revision with Bounded Treewidth. LPNMR 2009: 250-263
- [c56]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. LPNMR 2009: 382-395
- [c55]Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran: Alternation as a programming paradigm. PPDP 2009: 61-72
- [i7]David Pearce, Hans Tompits, Stefan Woltran: Characterising equilibrium logic and nested logic programs: Reductions and complexity. CoRR abs/0906.2228 (2009)
- [i6]Miroslaw Truszczynski, Stefan Woltran: Relativized hyperequivalence of logic programs for modular programming. CoRR abs/0907.4128 (2009)
- [i5]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: A general approach to belief change in answer set programming. CoRR abs/0912.5511 (2009)
- 2008
- [j6]Miroslaw Truszczynski, Stefan Woltran: Hyperequivalence of logic programs with respect to supported models. Ann. Math. Artif. Intell. 53(1-4): 331-365 (2008)
- [j5]Stefan Woltran: A common view on strong, uniform, and other notions of equivalence in answer-set programming. TPLP 8(2): 217-234 (2008)
- [c54]Miroslaw Truszczynski, Stefan Woltran: Hyperequivalence of Logic Programs with Respect to Supported Models. AAAI 2008: 560-565
- [c53]Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran: dRDF: Entailment for Domain-Restricted RDF. ESWC 2008: 200-214
- [c52]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. FoIKS 2008: 24-41
- [c51]Jörg Pührer, Hans Tompits, Stefan Woltran: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. ICLP 2008: 561-575
- [c50]Miroslaw Truszczynski, Stefan Woltran: Relativized Hyperequivalence of Logic Programs for Modular Programming. ICLP 2008: 576-590
- [c49]Uwe Egly, Sarah Alice Gaggl, Stefan Woltran: ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. ICLP 2008: 734-738
- [c48]
- [c47]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Belief Revision of Logic Programs under Answer Set Semantics. KR 2008: 411-421
- [c46]Wolfgang Faber, Hans Tompits, Stefan Woltran: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443
- [c45]Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Fast Counting with Bounded Treewidth. LPAR 2008: 436-450
- 2007
- [j4]Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran: Complexity results for answer set programming with bounded predicate arities and implications. Ann. Math. Artif. Intell. 51(2-4): 123-165 (2007)
- [j3]Thomas Eiter, Michael Fink, Stefan Woltran: Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. Comput. Log. 8(3) (2007)
- [c44]Johannes Oetsch, Hans Tompits, Stefan Woltran: Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. AAAI 2007: 458-464
- [c43]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Complexity Results for Checking Equivalence of Stratified Logic Programs. IJCAI 2007: 330-335
- [c42]Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran: Debugging ASP Programs by Means of ASP. LPNMR 2007: 31-43
- [c41]Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran: Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135
- [c40]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT 2007
- [c39]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187
- [c38]David Pearce, Hans Tompits, Stefan Woltran: Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. CENT 2007
- [c37]Stefan Woltran: A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. CENT 2007
- [c36]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. INAP/WLP 2007: 241-246
- [c35]Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran: spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. INAP/WLP 2007: 247-252
- [e2]David Pearce, Axel Polleres, Agustín Valverde, Stefan Woltran (Eds.): Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), Tempe, AZ, May 14, 2007. CEUR Workshop Proceedings 265, CEUR-WS.org 2007
- [i4]Stefan Woltran: A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. CoRR abs/0712.0948 (2007)
- 2006
- [c34]Uwe Egly, Stefan Woltran: Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. COMMA 2006: 133-144
- [c33]
- [c32]Thomas Eiter, Patrick Traxler, Stefan Woltran: An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. JELIA 2006: 477-480
- [c31]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. JELIA 2006: 502-505
- [c30]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. KR 2006: 340-351
- [c29]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. WLP 2006: 145-153
- [c28]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. WLP 2006: 200-205
- [e1]Michael Fink, Hans Tompits, Stefan Woltran (Eds.): 20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006. INFSYS Research Report 1843-06-02, Technische Universität Wien, Austria 2006
- 2005
- [j2]Uwe Egly, Reinhard Pichler, Stefan Woltran: On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005)
- [c27]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. AAAI 2005: 695-700
- [c26]Hans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. Answer Set Programming 2005
- [c25]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance 2005: 84-118
- [c24]Hans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. ICLP 2005: 189-203
- [c23]Thomas Eiter, Hans Tompits, Stefan Woltran: On Solution Correspondences in Answer-Set Programming. IJCAI 2005: 97-102
- [i3]Thomas Eiter, Michael Fink, Stefan Woltran: Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. CoRR abs/cs/0502078 (2005)
- 2004
- [j1]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: On Computing Belief Change Operations using Quantified Boolean Formulas. J. Log. Comput. 14(6): 801-826 (2004)
- [c22]Thomas Linke, Hans Tompits, Stefan Woltran: On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP 2004: 225-239
- [c21]Stefan Woltran: Characterizations for Relativized Notions of Equivalence in Answer Set Programming. JELIA 2004: 161-173
- [c20]Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran: Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. KR 2004: 377-387
- [c19]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: On Eliminating Disjunctions in Stable Logic Programming. KR 2004: 447-458
- [c18]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004: 87-99
- [c17]Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: nlp: A Compiler for Nested Logic Programming. LPNMR 2004: 361-364
- [c16]Thomas Linke, Hans Tompits, Stefan Woltran: On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275
- 2003
- [c15]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. Answer Set Programming 2003
- [c14]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003
- [c13]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. ECSQARU 2003: 528-539
- [c12]Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228
- 2002
- [c11]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. ICLP 2002: 405-420
- [c10]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. JELIA 2002: 320-331
- [c9]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. NMR 2002: 57-66
- [c8]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. Paraconsistent Computational Logic 2002: 1-15
- [c7]Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002: 100-114
- [i2]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. CoRR cs.AI/0207071 (2002)
- 2001
- [c6]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001
- [c5]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: On Computing Solutions to Belief Change Scenarios. ECSQARU 2001: 510-521
- [c4]David Pearce, Hans Tompits, Stefan Woltran: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. EPIA 2001: 306-320
- 2000
- [c3]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000: 417-422
- [c2]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. 15. WLP 2000: 113-122
- [c1]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000: 223-228
- [i1]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks. CoRR cs.AI/0003037 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:44 CEST by the dblp team