| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran |
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran |
Towards fixed-parameter tractable algorithms for abstract argumentation. |
Artif. Intell. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcello Balduccini, Stefan Woltran |
Special issue on answer set programming. |
AI Commun. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran |
Strong Equivalence of Qualitative Optimization Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Michael Morak, Clemens Nopp, Stefan Woltran |
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran |
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Stefan Woltran |
On the Intertranslatability of Argumentation Semantics. |
J. Artif. Intell. Res. (JAIR) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilia Oikarinen, Stefan Woltran |
Characterizing strong equivalence for argumentation frameworks. |
Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran |
Parametric Properties of Ideal Semantics. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gerhard Brewka, Paul E. Dunne, Stefan Woltran |
Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sarah Alice Gaggl, Stefan Woltran |
Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. |
ECSQARU |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Faber, Stefan Woltran |
Manifold Answer-Set Programs and Their Applications. |
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
A New Tree-Decomposition Based Algorithm for Answer Set Programming. |
ICTAI |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Stefan Woltran |
Complexity of semi-stable and stage semantics in argumentation frameworks. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Woltran |
Strong Equivalence in Argumentation. |
CLIMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Woltran |
The Complexity of Handling Minimal Solutions in Logic-Based Abduction. |
ECAI |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
Counting and Enumeration Problems with Bounded Treewidth. |
LPAR (Dakar) |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran |
Minimising RDF Graphs under Rules and Constraints Revisited. |
AMW |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
A Dynamic-Programming Based ASP-Solver. |
JELIA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran |
Sets of Boolean Connectives That Make Argumentation Easier. |
JELIA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran |
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. |
RR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Woltran |
Equivalence between Extended Datalog Programs - A Brief Survey. |
Datalog |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Brewka, Stefan Woltran |
Abstract Dialectical Frameworks. |
KR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran |
Towards Fixed-Parameter Tractable Algorithms for Argumentation. |
KR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Emilia Oikarinen, Stefan Woltran |
Characterizing Strong Equivalence for Argumentation Frameworks. |
KR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran |
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. |
KR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran |
Representing Preferences Among Sets. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
Multicut Algorithms via Tree Decompositions. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Stefan Szeider, Stefan Woltran |
Reasoning in Argumentation Frameworks of Bounded Clique-Width. |
COMMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Alice Gaggl, Stefan Woltran |
cf2 Semantics Revisited. |
COMMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Egly, Martina Seidl, Stefan Woltran |
A solver for QBFs in negation normal form. |
Constraints |
2009 |
DBLP DOI BibTeX RDF |
Negation normal form, Solver, QBFs |
| 1 | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
A general approach to belief change in answer set programming |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Pearce, Hans Tompits, Stefan Woltran |
Characterising equilibrium logic and nested logic programs: Reductions and complexity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Miroslaw Truszczynski, Stefan Woltran |
Relativized hyperequivalence of logic programs for modular programming |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran |
Modularity Aspects of Disjunctive Stable Models. |
J. Artif. Intell. Res. (JAIR) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Besnard, Anthony Hunter, Stefan Woltran |
Encoding deductive argumentation in quantified Boolean formulae. |
Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Pearce, Hans Tompits, Stefan Woltran |
Characterising equilibrium logic and nested logic programs: Reductions and complexity, . |
TPLP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslaw Truszczynski, Stefan Woltran |
Relativized hyperequivalence of logic programs for modular programming. |
TPLP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Jakl, Reinhard Pichler, Stefan Woltran |
Answer-Set Programming with Bounded Treewidth. |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
Merging Logic Programs under Answer Set Semantics. |
ICLP |
2009 |
DBLP DOI BibTeX RDF |
strong equivalence, answer set programming, belief merging |
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
Belief Revision with Bounded Treewidth. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Faber, Stefan Woltran |
Manifold Answer-Set Programs for Meta-reasoning. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran |
Alternation as a programming paradigm. |
PPDP |
2009 |
DBLP DOI BibTeX RDF |
integration of paradigms, language extension, alternation |
| 1 | Miroslaw Truszczynski, Stefan Woltran |
Hyperequivalence of logic programs with respect to supported models. |
Ann. Math. Artif. Intell. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68N17, 68Q17, 68T30 |
| 1 | Stefan Woltran |
A common view on strong, uniform, and other notions of equivalence in answer-set programming. |
TPLP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran |
dRDF: Entailment for Domain-Restricted RDF. |
ESWC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
Fast Counting with Bounded Treewidth. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslaw Truszczynski, Stefan Woltran |
Relativized Hyperequivalence of Logic Programs for Modular Programming. |
ICLP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Egly, Sarah Alice Gaggl, Stefan Woltran |
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. |
ICLP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Pührer, Hans Tompits, Stefan Woltran |
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. |
ICLP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslaw Truszczynski, Stefan Woltran |
Hyperequivalence of Programs and Operators. |
ISAIM |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran |
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. |
FoIKS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
Belief Revision of Logic Programs under Answer Set Semantics. |
KR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Faber, Hans Tompits, Stefan Woltran |
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. |
KR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Miroslaw Truszczynski, Stefan Woltran |
Hyperequivalence of Logic Programs with Respect to Supported Models. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stefan Woltran |
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Stefan Woltran |
Semantical characterizations and complexity of equivalences in answer set programming. |
ACM Trans. Comput. Log. |
2007 |
DBLP DOI BibTeX RDF |
strong equivalence, uniform equivalence, computational complexity, program optimization, stable models, Answer set semantics |
| 1 | Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran |
Complexity results for answer set programming with bounded predicate arities and implications. |
Ann. Math. Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68N17, 68Q17 |
| 1 | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
Complexity Results for Checking Equivalence of Stratified Logic Programs. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
CENT |
2007 |
DBLP BibTeX RDF |
|
| 1 | David Pearce, Hans Tompits, Stefan Woltran |
Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. |
CENT |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran |
Debugging ASP Programs by Means of ASP. |
LPNMR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Woltran |
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. |
CENT |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran |
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. |
CENT |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran |
Modularity Aspects of Disjunctive Stable Models. |
LPNMR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran |
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. |
LPNMR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. |
INAP/WLP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Egly, Martina Seidl, Stefan Woltran |
A Solver for QBFs in Nonprenex Form. |
ECAI |
2006 |
DBLP BibTeX RDF |
|
| 1 | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. |
JELIA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Patrick Traxler, Stefan Woltran |
An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. |
JELIA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran |
Replacements in Non-Ground Answer-Set Programming. |
KR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran |
Replacements in Non-Ground Answer-Set Programming. |
WLP |
2006 |
DBLP BibTeX RDF |
|
| 1 | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. |
WLP |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Fink, Hans Tompits, Stefan Woltran (eds.) |
20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006 |
WLP |
2006 |
DBLP BibTeX RDF |
|
| 1 | Uwe Egly, Stefan Woltran |
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. |
COMMA |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Stefan Woltran |
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Uwe Egly, Reinhard Pichler, Stefan Woltran |
On deciding subsumption problems. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
equational problems, satisfiability, subsumption, QBFs |
| 1 | Thomas Eiter, Hans Tompits, Stefan Woltran |
On Solution Correspondences in Answer-Set Programming. |
IJCAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Hans Tompits, Stefan Woltran |
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. |
ICLP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
Representing Paraconsistent Reasoning via Quantified Propositional Logic. |
Inconsistency Tolerance |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Tompits, Stefan Woltran |
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. |
Answer Set Programming |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
On Computing Belief Change Operations using Quantified Boolean Formulas. |
J. Log. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Linke, Hans Tompits, Stefan Woltran |
On Acyclic and Head-Cycle Free Nested Logic Programs. |
ICLP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Woltran |
Characterizations for Relativized Notions of Equivalence in Answer Set Programming. |
JELIA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
Simplifying Logic Programs Under Uniform and Strong Equivalence. |
LPNMR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran |
nlp: A Compiler for Nested Logic Programming. |
LPNMR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
On Eliminating Disjunctions in Stable Logic Programming. |
KR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Thomas Linke, Hans Tompits, Stefan Woltran |
On acyclic and head-cycle free nested logic programs. |
NMR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. |
ECSQARU |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda |
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. |
Answer Set Programming |
2003 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. |
JELIA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")