| 2022 | EPIA | PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels. | Felix Schn, Hans Tompits |
| 2021 | DATE | C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles. | Tobias Kain, Hans Tompits, Timo Frederik Horeis, Johannes Heinrich, Julian-Steffen Mller, Fabian Plinke, Hendrik Decke, Marcel Aguirre Mehlhorn |
| 2020 | DATE | Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles. | Tobias Kain, Philipp Mundhenk, Julian-Steffen Mller, Hans Tompits, Maximilian Wesche, Hendrik Decke |
| 2019 | JELIA | Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. | Tobias Geibinger, Hans Tompits |
| 2019 | JELIA | \mathsf Uhura : An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language. | Tobias Kain, Hans Tompits |
| 2019 | LPNMR | A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur. | Sopo Pkhakadze, Hans Tompits |
| 2017 | IJCAI | Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? | Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere |
| 2017 | LPAR | Blocked Clauses in First-Order Logic. | Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere |
| 2017 | LPNMR | \mathsf Harvey : A System for Random Testing in ASP. | Alexander Greler, Johannes Oetsch, Hans Tompits |
| 2016 | CADE | Super-Blocked Clauses. | Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere |
| 2015 | ICLP | On Structural Analysis of Non-Ground Answer-Set Programs. | Benjamin Kiesl, Peter Schller, Hans Tompits |
| 2012 | ICLP | An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. | Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2012 | KR | On the Small-Scope Hypothesis for Testing Answer-Set Programs. | Johannes Oetsch, Michael Prischink, Jrg Phrer, Martin Schwengerer, Hans Tompits |
| 2012 | SLE | Guided Merging of Sequence Diagrams. | Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits |
| 2012 | TAP | Towards Scenario-Based Testing of UML Diagrams. | Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer |
| 2011 | LPNMR | Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. | Tomi Janhunen, Ilkka Niemel, Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2011 | LPNMR | VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology. | Johannes Oetsch, Jrg Phrer, Martina Seidl, Hans Tompits, Patrick Zwickl |
| 2011 | LPNMR | Stepping through an Answer-Set Program. | Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2011 | LPNMR | Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. | Johannes Oetsch, Hans Tompits |
| 2011 | MODELS | Towards Semantics-Aware Merge Support in Optimistic Model Versioning. | Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer |
| 2010 | ECAI | On Testing Answer-Set Programs. | Tomi Janhunen, Ilkka Niemel, Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2010 | ICLP | Methods and Methodologies for Developing Answer-Set Programs - Project Description. | Johannes Oetsch, Jrg Phrer, Hans Tompits |
| 2009 | ICLP | Merging Logic Programs under Answer Set Semantics. | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2009 | LPNMR | ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
| 2009 | LPNMR | Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. | Jrg Phrer, Hans Tompits |
| 2008 | AAAI | A Meta-Programming Technique for Debugging Answer-Set Programs. | Martin Gebser, Jrg Phrer, Torsten Schaub, Hans Tompits |
| 2008 | ICLP | Program Correspondence under the Answer-Set Semantics: The Non-ground Case. | Johannes Oetsch, Hans Tompits |
| 2008 | ICLP | Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. | Jrg Phrer, Hans Tompits, Stefan Woltran |
| 2008 | KR | Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. | Jos de Bruijn, Thomas Eiter, Hans Tompits |
| 2008 | KR | Belief Revision of Logic Programs under Answer Set Semantics. | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2008 | KR | Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. | Wolfgang Faber, Hans Tompits, Stefan Woltran |
| 2007 | AAAI | Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. | Johannes Oetsch, Hans Tompits, Stefan Woltran |
| 2007 | IJCAI | Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. | Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits |
| 2007 | IJCAI | Complexity Results for Checking Equivalence of Stratified Logic Programs. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Debugging ASP Programs by Means of ASP. | Martin Brain, Martin Gebser, Jrg Phrer, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | A Preference-Based Framework for Updating Logic Programs. | James P. Delgrande, Torsten Schaub, Hans Tompits |
| 2007 | LPNMR | Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. | Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. | Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Modularity Aspects of Disjunctive Stable Models. | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. | David Pearce, Hans Tompits, Stefan Woltran |
| 2006 | JELIA | ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
| 2006 | KR | Replacements in Non-Ground Answer-Set Programming. | Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran |
| 2006 | KSEM | On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. | Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits |
| 2005 | AAAI | Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2005 | ICLP | Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. | Hans Tompits, Stefan Woltran |
| 2005 | IJCAI | A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. | Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits |
| 2005 | IJCAI | On Solution Correspondences in Answer-Set Programming. | Thomas Eiter, Hans Tompits, Stefan Woltran |
| 2004 | ICLP | On Acyclic and Head-Cycle Free Nested Logic Programs. | Thomas Linke, Hans Tompits, Stefan Woltran |
| 2004 | KR | Domain-Specific Preferences for Causal Reasoning and Planning. | James P. Delgrande, Torsten Schaub, Hans Tompits |
| 2004 | KR | On Eliminating Disjunctions in Stable Logic Programming. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2004 | KR | Combining Answer Set Programming with Description Logics for the Semantic Web. | Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits |
| 2004 | LPAR | Nonmonotonic Description Logic Programs: Implementation and Experiments. | Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits |
| 2004 | LPNMR | Simplifying Logic Programs Under Uniform and Strong Equivalence. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2004 | LPNMR | nlp: A Compiler for Nested Logic Programming. | Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2003 | ECSQARU | Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2003 | SAT | Comparing Different Prenexing Strategies for Quantified Boolean Formulas. | Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda |
| 2002 | ICLP | A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. | David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2002 | JELIA | Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2002 | KR | A Generic Approach for Knowledge-Based Information-Site Selection. | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits |
| 2002 | TABLEAUX | Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. | Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran |
| 2001 | ECSQARU | On Computing Solutions to Belief Change Scenarios. | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2001 | EPIA | Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. | David Pearce, Hans Tompits, Stefan Woltran |
| 2001 | IJCAI | A Framework for Declarative Update Specifications in Logic Programs. | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits |
| 2001 | LPAR | Reasoning about Evolving Nonmonotonic Knowledge Bases. | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits |
| 2001 | LPNMR | plp: A Generic Compiler for Ordered Logic Programs. | James P. Delgrande, Torsten Schaub, Hans Tompits |
| 2001 | LPNMR | An Update Front-End for Extended Logic Programs. | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits |
| 2000 | AAAI | Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. | Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran |
| 2000 | ECAI | Logic Programs with Compiled Preferences. | James P. Delgrande, Torsten Schaub, Hans Tompits |
| 2000 | JELIA | A Compilation of Brewka and Eiter's Approach to Prioritization. | James P. Delgrande, Torsten Schaub, Hans Tompits |
| 2000 | JELIA | Considerations on Updates of Logic Programs. | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits |
| 1998 | TABLEAUX | On Proof Complexity of Circumscription. | Uwe Egly, Hans Tompits |
| 1997 | ECSQARU | Non-elementary Speed-Ups in Default Reasoning. | Uwe Egly, Hans Tompits |
| 1997 | LPNMR | Is Non-Monotonic Reasoning Always Harder? | Uwe Egly, Hans Tompits |