Selected Publications by Stefan Woltran

Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
ACM Transactions on Computational Logic 8(3), 2007.
(Together with Thomas Eiter and Michael Fink)

Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity
Technical Report GIA 2007-01-12.
Accepted for publication in Theory and Practice of Logic Programming.
(Together with David Pearce and Hans Tompits)

Complexity Results for Checking Equivalence of Stratified Logic Programs
In: Proceedings 20th International Joint Conference on Artificial Intelligence (IJCAI 07).
(Together with Thomas Eiter, Michael Fink, and Hans Tompits)

Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection.
In: Proceedings 22nd National Conference on Artificial Intelligence (AAAI 07).
(Together with Johannes Oetsch and Hans Tompits)
(.ps.gz)

Replacements in Non-Ground Answer-Set Programming
Proceedings 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 06).
(Together with Thomas Eiter, Michael Fink, Hans Tompits, and Patrick Traxler)
Corrected Version: (.ps.gz)

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
In: Proceedings of the 21st International Conference on Logic Programming (ICLP 05).
(Together with Hans Tompits)

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case
In: Proceedings 20th National Conference on Artificial Intelligence (AAAI 05).
(Together with Thomas Eiter, Michael Fink, and Hans Tompits)
(.ps.gz)

On Solution Correspondences in Answer-Set Programming
In: Proceedings Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 05).
(Together with Thomas Eiter and Hans Tompits)

On Deciding Subsumption Problems
Annals of Mathematics and Artificial Intelligence, 43(1-4):255-294, 2005.
Short Version: Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT-02).
(Together with Uwe Egly and Reinhard Pichler)

On Computing Belief Change Operations using Quantified Boolean Formulas
Journal of Logic and Computation}, 14(6):801-826, 2004.
Short Version: In: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2001).
(Together with James P. Delgrande, Torsten Schaub, and Hans Tompits)

Characterizations for Relativized Notions of Equivalence in Answer Set Programming.
In: Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04).

On Acyclic and Head-Cycle Free Nested Logic Programs.
In: Proceedings of the 20th International Conference on Logic Programming (ICLP-04).
(Together with Thomas Linke and Hans Tompits)

On Eliminating Disjunctions in Stable Logic Programming .
In: Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR-04).
(Together with Thomas Eiter, Michael Fink, and Hans Tompits)
(.ps.gz)

Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming.
In: Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR-04).
(Together with Thomas Eiter, Wolfgang Faber, Michael Fink, and Gerald Pfeifer)
(.ps.gz)

Simplifying Logic Programs Under Uniform and Strong Equivalence.
In: Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-04).
(Together with Thomas Eiter, Michael Fink, and Hans Tompits)

Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
In: Proceedings of the Sixth International Symposium on the Theory and Applications of Satisfiability Testing (SAT-03).
(Together with Uwe Egly, Martina Seidl, Hans Tompits, and Michael Zolda)

Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
In: Proceedings of the 7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2003).
(Together with Philippe Besnard, Torsten Schaub, and Hans Tompits)

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
In: Proceedings of the 8th European Conference on Artificial Intelligence (JELIA),
also appeared in: Proceedings of the ICLP'02 Workshop on Paraconsistent Computational Logic (PCL).
(Together with Philippe Besnard, Torsten Schaub, and Hans Tompits)

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
In: Proceedings of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-02).
(Together with Thomas Eiter, Volker Klotz, and Hans Tompits)

On Quantifier Shifting for Quantified Boolean Formulas
In: Proceedings of the Second International Workshop on Quantified Boolean Formulae (QBF-02).
(Together with Uwe Egly and Hans Tompits)
(.ps.gz)

A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report.
Proceedings of the 18th International Conference on Logic Programming (ICLP-02),
also appeared in: Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning (NMR-02).
(Together with David Pearce, Vladimir Sarsakov, Torsten Schaub, and Hans Tompits)

Encodings for Equilibrium Logic and Logic Programs with Nested Expressions.
In: Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA'01).
(Together with David Pearce and Hans Tompits)

A Toolbox for Abduction: Preliminary Report.
In: Proceedings of the IJCAR-Workshop Theory and Application of Quantified Boolean Formulas (QBF'2001).
(Together with Uwe Egly, Thomas Eiter, Volker Klotz, and Hans Tompits)
(.ps.gz)

Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
In: Proceedings of the AAAI 2001 Spring Symposium on Answer Set Programming.
(Together with Uwe Egly, Thomas Eiter, Volker Klotz, and Hans Tompits)
(.ps.gz)

Solving Advanced Reasoning Tasks using Quantified Boolean Formulas.
In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI'2000).
(Together with Uwe Egly, Thomas Eiter, and Hans Tompits)
(.ps.gz)

QUIP-A Tool for Computing Nonmonotonic Reasoning Tasks.
In: Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000).
(Together with Uwe Egly, Thomas Eiter, and Hans Tompits)
(.ps.gz)