| 2008 |
|---|
| 55 | EE | Reinhard Pichler,
Axel Polleres,
Fang Wei,
Stefan Woltran:
dRDF: Entailment for Domain-Restricted RDF.
ESWC 2008: 200-214 |
| 54 | EE | 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 |
| 53 | EE | Stefan Woltran:
A common view on strong, uniform, and other notions of equivalence in answer-set programming.
TPLP 8(2): 217-234 (2008) |
| 2007 |
|---|
| 52 | | David Pearce,
Axel Polleres,
Agustín Valverde,
Stefan Woltran:
Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), Tempe, AZ, May 14, 2007
CEUR-WS.org 2007 |
| 51 | | 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 |
| 50 | EE | Stefan Woltran:
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming.
CENT 2007 |
| 49 | EE | Martin Gebser,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report.
CENT 2007 |
| 48 | EE | David Pearce,
Hans Tompits,
Stefan Woltran:
Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report.
CENT 2007 |
| 47 | EE | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
Complexity Results for Checking Equivalence of Stratified Logic Programs.
IJCAI 2007: 330-335 |
| 46 | EE | 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 |
| 45 | EE | Tomi Janhunen,
Emilia Oikarinen,
Hans Tompits,
Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models.
LPNMR 2007: 175-187 |
| 44 | EE | 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 |
| 43 | EE | Thomas Eiter,
Michael Fink,
Stefan Woltran:
Semantical characterizations and complexity of equivalences in answer set programming.
ACM Trans. Comput. Log. 8(3): (2007) |
| 42 | EE | 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) |
| 41 | EE | Stefan Woltran:
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
CoRR abs/0712.0948: (2007) |
| 2006 |
|---|
| 40 | EE | Michael Fink,
Hans Tompits,
Stefan Woltran:
20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006
Technische Universität Wien, Austria 2006 |
| 39 | EE | Uwe Egly,
Stefan Woltran:
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas.
COMMA 2006: 133-144 |
| 38 | | Uwe Egly,
Martina Seidl,
Stefan Woltran:
A Solver for QBFs in Nonprenex Form.
ECAI 2006: 477-481 |
| 37 | EE | Thomas Eiter,
Patrick Traxler,
Stefan Woltran:
An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs.
JELIA 2006: 477-480 |
| 36 | EE | 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 |
| 35 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Patrick Traxler,
Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming.
KR 2006: 340-351 |
| 34 | EE | Thomas Eiter,
Michael Fink,
Hans Tompits,
Patrick Traxler,
Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming.
WLP 2006: 145-153 |
| 33 | EE | 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 |
| 2005 |
|---|
| 32 | | 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 |
| 31 | EE | Hans Tompits,
Stefan Woltran:
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
Answer Set Programming 2005 |
| 30 | EE | Hans Tompits,
Stefan Woltran:
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
ICLP 2005: 189-203 |
| 29 | EE | Thomas Eiter,
Hans Tompits,
Stefan Woltran:
On Solution Correspondences in Answer-Set Programming.
IJCAI 2005: 97-102 |
| 28 | EE | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Representing Paraconsistent Reasoning via Quantified Propositional Logic.
Inconsistency Tolerance 2005: 84-118 |
| 27 | EE | Uwe Egly,
Reinhard Pichler,
Stefan Woltran:
On deciding subsumption problems.
Ann. Math. Artif. Intell. 43(1): 255-294 (2005) |
| 26 | EE | Thomas Eiter,
Michael Fink,
Stefan Woltran:
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
CoRR abs/cs/0502078: (2005) |
| 2004 |
|---|
| 25 | EE | Thomas Linke,
Hans Tompits,
Stefan Woltran:
On Acyclic and Head-Cycle Free Nested Logic Programs.
ICLP 2004: 225-239 |
| 24 | EE | Stefan Woltran:
Characterizations for Relativized Notions of Equivalence in Answer Set Programming.
JELIA 2004: 161-173 |
| 23 | | 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 |
| 22 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
On Eliminating Disjunctions in Stable Logic Programming.
KR 2004: 447-458 |
| 21 | EE | Vladimir Sarsakov,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
nlp: A Compiler for Nested Logic Programming.
LPNMR 2004: 361-364 |
| 20 | EE | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
Simplifying Logic Programs Under Uniform and Strong Equivalence.
LPNMR 2004: 87-99 |
| 19 | EE | Thomas Linke,
Hans Tompits,
Stefan Woltran:
On acyclic and head-cycle free nested logic programs.
NMR 2004: 267-275 |
| 18 | EE | 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) |
| 2003 |
|---|
| 17 | EE | 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 |
| 16 | EE | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation.
Answer Set Programming 2003 |
| 15 | EE | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
ECSQARU 2003: 528-539 |
| 14 | EE | Uwe Egly,
Martina Seidl,
Hans Tompits,
Stefan Woltran,
Michael Zolda:
Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
SAT 2003: 214-228 |
| 2002 |
|---|
| 13 | EE | 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 |
| 12 | EE | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
JELIA 2002: 320-331 |
| 11 | | 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 |
| 10 | EE | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
Paraconsistent Computational Logic 2002: 1-15 |
| 9 | EE | Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
TABLEAUX 2002: 100-114 |
| 8 | EE | 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 |
|---|
| 7 | EE | Uwe Egly,
Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Answer Set Programming 2001 |
| 6 | EE | James P. Delgrande,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
On Computing Solutions to Belief Change Scenarios.
ECSQARU 2001: 510-521 |
| 5 | EE | David Pearce,
Hans Tompits,
Stefan Woltran:
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions.
EPIA 2001: 306-320 |
| 2000 |
|---|
| 4 | | 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 |
| 3 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.
AAAI/IAAI 2000: 417-422 |
| 2 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
Implementing Default Reasoning Using Quantified Boolean Formulae.
WLP 2000: 223-228 |
| 1 | EE | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
CoRR cs.AI/0003037: (2000) |
