Non-elementary Speed-Ups in Default Reasoning. - Uwe Egly; Hans Tompits (ECSQARU-FAPR, 1997)

Is Non-Monotonic Reasoning Always Harder? - Uwe Egly; Hans Tompits (LPNMR, 1997)

A Sequent Calculus for Intuitionistic Default Logic. - Uwe Egly; Hans Tompits (WLP, 1997)

On Proof Complexity of Circumscription. - Uwe Egly; Hans Tompits (TABLEAUX, 1998)

A Web-based Tutoring Tool for Calculating Default Logic Extensions. - Uwe Egly; Michael Fink 001; Axel Polleres; Hans Tompits (WebNet, 1999)

Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. - Uwe Egly; Thomas Eiter; Hans Tompits; Stefan Woltran (AAAI/IAAI, 2000)

Some Strengths of Nonmonotonic Reasoning. - Uwe Egly; Hans Tompits (Intellectics and Computational Logic, 2000)

Logic Programs with Compiled Preferences. - James P. Delgrande; Torsten Schaub; Hans Tompits (ECAI, 2000)

A Compilation of Brewka and Eiter's Approach to Prioritization. - James P. Delgrande; Torsten Schaub; Hans Tompits (JELIA, 2000)

Considerations on Updates of Logic Programs. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (JELIA, 2000)

Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. - Uwe Egly; Thomas Eiter; Volker Klotz; Hans Tompits; Stefan Woltran (WLP, 2000)

Implementing Default Reasoning Using Quantified Boolean Formulae. - Uwe Egly; Thomas Eiter; Hans Tompits; Stefan Woltran (WLP, 2000)

A Compiler for Ordered Logic Programs - James P. Delgrande; Torsten Schaub; Hans Tompits (CoRR, 2000)

QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks - Uwe Egly; Thomas Eiter; Hans Tompits; Stefan Woltran (CoRR, 2000)

Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. - Uwe Egly; Thomas Eiter; Volker Klotz; Hans Tompits; Stefan Woltran (Answer Set Programming, 2001)

On Computing Solutions to Belief Change Scenarios. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (ECSQARU, 2001)

Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. - David Pearce 001; Hans Tompits; Stefan Woltran (EPIA, 2001)

A Framework for Declarative Update Specifications in Logic Programs. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (IJCAI, 2001)

plp: A Generic Compiler for Ordered Logic Programs. - James P. Delgrande; Torsten Schaub; Hans Tompits (LPNMR, 2001)

An Update Front-End for Extended Logic Programs. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (LPNMR, 2001)

Proof-complexity results for nonmonotonic reasoning. - Uwe Egly; Hans Tompits (ACM Trans. Comput. Log., 2001)

A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. - David Pearce 001; Vladimir Sarsakov; Torsten Schaub; Hans Tompits; Stefan Woltran (ICLP, 2002)

A Generic Approach for Knowledge-Based Information-Site Selection. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (KR, 2002)

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. - Philippe Besnard; Torsten Schaub; Hans Tompits; Stefan Woltran (Paraconsistent Computational Logic, 2002)

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. - Thomas Eiter; Volker Klotz; Hans Tompits; Stefan Woltran (TABLEAUX, 2002)

On Properties of Update Sequences Based on Causal Rejection. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (Theory Pract. Log. Program., 2002)

Using Methods of Declarative Logic Programming for Intelligent Information Agents. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (Theory Pract. Log. Program., 2002)

Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (Answer Set Programming, 2003)

Declarative Update Policies for Nonmonotonic Knowledge Bases. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (Logics for Emerging Applications of Databases, 2003)

Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. - Philippe Besnard; Torsten Schaub; Hans Tompits; Stefan Woltran (ECSQARU, 2003)

Comparing Different Prenexing Strategies for Quantified Boolean Formulas. - Uwe Egly; Martina Seidl; Hans Tompits; Stefan Woltran; Michael Zolda (SAT, 2003)

Expressing default abduction problems as quantified Boolean formulas. - Hans Tompits (AI Commun., 2003)

On Different Proof-Search Strategies for Orthologic. - Uwe Egly; Hans Tompits (Stud Logica, 2003)

A Framework for Compiling Preferences in Logic Programs. - James P. Delgrande; Torsten Schaub; Hans Tompits (Theory Pract. Log. Program., 2003)

On Acyclic and Head-Cycle Free Nested Logic Programs. - Thomas Linke; Hans Tompits; Stefan Woltran (ICLP, 2004)

Domain-Specific Preferences for Causal Reasoning and Planning. - James P. Delgrande; Torsten Schaub; Hans Tompits (KR, 2004)

On Eliminating Disjunctions in Stable Logic Programming. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (KR, 2004)

Combining Answer Set Programming with Description Logics for the Semantic Web. - Thomas Eiter; Thomas Lukasiewicz; Roman Schindlauer; Hans Tompits (KR, 2004)

Nonmonotonic Description Logic Programs: Implementation and Experiments. - Thomas Eiter; Giovambattista Ianni; Roman Schindlauer; Hans Tompits (LPAR, 2004)

Simplifying Logic Programs Under Uniform and Strong Equivalence. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (LPNMR, 2004)

nlp: A Compiler for Nested Logic Programming. - Vladimir Sarsakov; Torsten Schaub; Hans Tompits; Stefan Woltran (LPNMR, 2004)

Well-Founded Semantics for Description Logic Programs in the Semantic Web. - Thomas Eiter; Thomas Lukasiewicz; Roman Schindlauer; Hans Tompits (RuleML, 2004)

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. - James P. Delgrande; Torsten Schaub; Hans Tompits; Kewen Wang 001 (Comput. Intell., 2004)

On Computing Belief Change Operations using Quantified Boolean Formulas. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (J. Log. Comput., 2004)

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (AAAI, 2005)

Representing Paraconsistent Reasoning via Quantified Propositional Logic. - Philippe Besnard; Torsten Schaub; Hans Tompits; Stefan Woltran (Inconsistency Tolerance, 2005)

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. - Hans Tompits; Stefan Woltran (ICLP, 2005)

A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. - Thomas Eiter; Giovambattista Ianni; Roman Schindlauer; Hans Tompits (IJCAI, 2005)

On Solution Correspondences in Answer-Set Programming. - Thomas Eiter; Hans Tompits; Stefan Woltran (IJCAI, 2005)

Reasoning about evolving nonmonotonic knowledge bases. - Thomas Eiter; Michael Fink 001; Giuliana Sabbatini; Hans Tompits (ACM Trans. Comput. Log., 2005)

Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. - Thomas Eiter; Giovambattista Ianni; Roman Schindlauer; Hans Tompits (ESWC, 2006)

ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (JELIA, 2006)

Replacements in Non-Ground Answer-Set Programming. - Thomas Eiter; Michael Fink 001; Hans Tompits; Patrick Traxler; Stefan Woltran (KR, 2006)

On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. - Jos de Bruijn; Thomas Eiter; Axel Polleres; Hans Tompits (KSEM, 2006)

Reasoning with Rules and Ontologies. - Thomas Eiter; Giovambattista Ianni; Axel Polleres; Roman Schindlauer; Hans Tompits (Reasoning Web, 2006)

dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. - Thomas Eiter; Giovambattista Ianni; Roman Schindlauer; Hans Tompits (Web Intelligence, 2006)

Forgetting in Managing Rules and Ontologies. - Thomas Eiter; Giovambattista Ianni; Roman Schindlauer; Hans Tompits; Kewen Wang 001 (Web Intelligence, 2006)

dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. - Thomas Eiter; Giovambattista Ianni; Roman Schindlauer; Hans Tompits (WLP, 2006)

A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (WLP, 2006)

Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. - Johannes Oetsch; Hans Tompits; Stefan Woltran (AAAI, 2007)

Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. - Jos de Bruijn; Thomas Eiter; Axel Polleres; Hans Tompits (IJCAI, 2007)

Complexity Results for Checking Equivalence of Stratified Logic Programs. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (IJCAI, 2007)

Debugging ASP Programs by Means of ASP. - Martin Brain; Martin Gebser; Jörg Pührer; Torsten Schaub; Hans Tompits; Stefan Woltran (LPNMR, 2007)

A Preference-Based Framework for Updating Logic Programs. - James P. Delgrande; Torsten Schaub; Hans Tompits (LPNMR, 2007)

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. - Michael Fink 001; Reinhard Pichler; Hans Tompits; Stefan Woltran (LPNMR, 2007)

Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. - Martin Gebser; Torsten Schaub; Hans Tompits; Stefan Woltran (CENT, 2007)

Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. - David Pearce 001; Hans Tompits; Stefan Woltran (CENT, 2007)

spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. - Martin Gebser; Jörg Pührer; Torsten Schaub; Hans Tompits; Stefan Woltran (INAP/WLP, 2007)

Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (INAP/WLP, 2007)

A General Framework for Expressing Preferences in Causal Reasoning and Planning. - James P. Delgrande; Torsten Schaub; Hans Tompits (J. Log. Comput., 2007)

A knowledge-based approach for selecting information sources. - Thomas Eiter; Michael Fink 001; Hans Tompits (Theory Pract. Log. Program., 2007)

A Meta-Programming Technique for Debugging Answer-Set Programs. - Martin Gebser; Jörg Pührer; Torsten Schaub; Hans Tompits (AAAI, 2008)

Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. - Martin Gebser; Torsten Schaub; Hans Tompits; Stefan Woltran (FoIKS, 2008)

Program Correspondence under the Answer-Set Semantics: The Non-ground Case. - Johannes Oetsch; Hans Tompits (ICLP, 2008)

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. - Jörg Pührer; Hans Tompits; Stefan Woltran (ICLP, 2008)

Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. - Jos de Bruijn; Thomas Eiter; Hans Tompits (KR, 2008)

Belief Revision of Logic Programs under Answer Set Semantics. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (KR, 2008)

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. - Wolfgang Faber 001; Hans Tompits; Stefan Woltran (KR, 2008)

Combining answer set programming with description logics for the Semantic Web. - Thomas Eiter; Giovambattista Ianni; Thomas Lukasiewicz; Roman Schindlauer; Hans Tompits (Artif. Intell., 2008)

Merging Logic Programs under Answer Set Semantics. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (ICLP, 2009)

ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (LPNMR, 2009)

Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. - Jörg Pührer; Hans Tompits (LPNMR, 2009)

Characterising equilibrium logic and nested logic programs: Reductions and complexity - David Pearce 001; Hans Tompits; Stefan Woltran (CoRR, 2009)

A general approach to belief change in answer set programming - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (CoRR, 2009)

Modularity Aspects of Disjunctive Stable Models. - Tomi Janhunen; Emilia Oikarinen; Hans Tompits; Stefan Woltran (J. Artif. Intell. Res., 2009)

Characterising equilibrium logic and nested logic programs: Reductions and complexity, . - David Pearce 001; Hans Tompits; Stefan Woltran (Theory Pract. Log. Program., 2009)

On Testing Answer-Set Programs. - Tomi Janhunen; Ilkka Niemelä; Johannes Oetsch; Jörg Pührer; Hans Tompits (ECAI, 2010)

Methods and Methodologies for Developing Answer-Set Programs - Project Description. - Johannes Oetsch; Jörg Pührer; Hans Tompits (ICLP (Technical Communications), 2010)

The system Kato: Detecting cases of plagiarism for answer-set programs. - Johannes Oetsch; Jörg Pührer; Martin Schwengerer; Hans Tompits (Theory Pract. Log. Program., 2010)

Catching the Ouroboros: On debugging non-ground answer-set programs. - Johannes Oetsch; Jörg Pührer; Hans Tompits (Theory Pract. Log. Program., 2010)

Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. - Christian Kloimüllner; Johannes Oetsch; Jörg Pührer; Hans Tompits (INAP/WLP, 2011)

The SeaLion has Landed: An IDE for Answer-Set Programming - Preliminary Report. - Johannes Oetsch; Jörg Pührer; Hans Tompits (INAP/WLP, 2011)

Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. - Tomi Janhunen; Ilkka Niemelä; Johannes Oetsch; Jörg Pührer; Hans Tompits (LPNMR, 2011)

VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology. - Johannes Oetsch; Jörg Pührer; Martina Seidl; Hans Tompits; Patrick Zwickl (LPNMR, 2011)

Stepping through an Answer-Set Program. - Johannes Oetsch; Jörg Pührer; Hans Tompits (LPNMR, 2011)

Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. - Johannes Oetsch; Hans Tompits (LPNMR, 2011)

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 (MoDELS (Workshops), 2011)

Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming - Johannes Oetsch; Jörg Pührer; Hans Tompits (CoRR, 2011)

Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. - Jos de Bruijn; Thomas Eiter; Axel Polleres; Hans Tompits (ACM Trans. Comput. Log., 2011)

Stepwise Debugging of Description-Logic Programs. - Johannes Oetsch; Jörg Pührer; Hans Tompits (Correct Reasoning, 2012)

An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. - Johannes Oetsch; Jörg Pührer; Hans Tompits (ICLP (Technical Communications), 2012)

On the Small-Scope Hypothesis for Testing Answer-Set Programs. - Johannes Oetsch; Michael Prischink; Jörg Pührer; Martin Schwengerer; Hans Tompits (KR, 2012)

Guided Merging of Sequence Diagrams. - Magdalena Widl; Armin Biere; Petra Brosch; Uwe Egly; Marijn Heule; Gerti Kappel; Martina Seidl; Hans Tompits (SLE, 2012)

Towards Scenario-Based Testing of UML Diagrams. - Petra Brosch; Uwe Egly; Sebastian Gabmeyer; Gerti Kappel; Martina Seidl; Hans Tompits; Magdalena Widl; Manuel Wimmer (TAP@TOOLS, 2012)

Annotating answer-set programs in Lana. - Marina De Vos; Doga Gizem Kisa; Johannes Oetsch; Jörg Pührer; Hans Tompits (Theory Pract. Log. Program., 2012)

On Axiomatic Rejection for the Description Logic ALC. - Gerald Berger; Hans Tompits (KDPD, 2013)

Model-based recasting in answer-set programming. - Thomas Eiter; Michael Fink 001; Jörg Pührer; Hans Tompits; Stefan Woltran (J. Appl. Non Class. Logics, 2013)

A Model-Theoretic Approach to Belief Change in Answer Set Programming. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (ACM Trans. Comput. Log., 2013)

SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support. - Paula-Andra Busoniu; Johannes Oetsch; Jörg Pührer; Peter Skocovsky; Hans Tompits (Theory Pract. Log. Program., 2013)

On Structural Analysis of Non-Ground Answer-Set Programs. - Benjamin Kiesl; Peter Schüller; Hans Tompits (ICLP (Technical Communications), 2015)

Super-Blocked Clauses. - Benjamin Kiesl; Martina Seidl; Hans Tompits; Armin Biere (IJCAR, 2016)

Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? - Benjamin Kiesl; Martina Seidl; Hans Tompits; Armin Biere (IJCAI, 2017)

An Approach for Representing Answer Sets in Natural Language. - Min Fang; Hans Tompits (DECLARE, 2017)

Blocked Clauses in First-Order Logic. - Benjamin Kiesl; Martin Suda 001; Martina Seidl; Hans Tompits; Armin Biere (LPAR, 2017)

mathsf Harvey : A System for Random Testing in ASP. - Alexander Greßler; Johannes Oetsch; Hans Tompits (LPNMR, 2017)

A Tableau Calculus for a Multi-modal Logic of Dishonesty. - Sanja Pavlovic; Hans Tompits (AI*IA, 2018)

A many-sorted variant of Japaridze's polymodal provability logic. - Gerald Berger; Lev D. Beklemishev; Hans Tompits (Log. J. IGPL, 2018)

Local Redundancy in SAT: Generalizations of Blocked Clauses. - Benjamin Kiesl; Martina Seidl; Hans Tompits; Armin Biere (Log. Methods Comput. Sci., 2018)

Stepwise debugging of answer-set programs. - Johannes Oetsch; Jörg Pührer; Hans Tompits (Theory Pract. Log. Program., 2018)

Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. - Tobias Geibinger; Hans Tompits (JELIA, 2019)

mathsf Uhura : An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language. - Tobias Kain; Hans Tompits (JELIA, 2019)

A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur. - Sopo Pkhakadze; Hans Tompits (LPNMR, 2019)

Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles. - Tobias Kain; Philipp Mundhenk; Julian-Steffen Müller; Hans Tompits; Maximilian Wesche; Hendrik Decke (ASD@DATE, 2020)

Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic. - Sopo Pkhakadze; Hans Tompits (Axioms, 2020)

Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics. - Tobias Geibinger; Hans Tompits (ICLP Technical Communications, 2020)

C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles. - Tobias Kain; Hans Tompits; Timo Frederik Horeis; Johannes Heinrich; Julian-Steffen Müller; Fabian Plinke; Hendrik Decke; Marcel Aguirre Mehlhorn (DATE, 2021)

Beyond Uniform Equivalence between Answer-set Programs. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (ACM Trans. Comput. Log., 2021)

PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels. - Felix Schön; Hans Tompits (EPIA, 2022)

ReConf: An Automatic Context-Based Software Reconfiguration Tool for Autonomous Vehicles Using Answer-Set Programming. - Tobias Kain; Hans Tompits (AI*IA, 2023)

PAUL-2: An Upgraded Transformer-Based Redesign of the Algorithmic Composer PAUL. - Felix Schön; Hans Tompits (AI*IA, 2023)

Sequent-type rejection systems for finite-valued non-deterministic logics. - Martin Gius; Hans Tompits (J. Appl. Non Class. Logics, 2023)

On Different Symbolic Music Representations for Algorithmic Composition Approaches Based on Neural Sequence Models. - Felix Schön; Hans Tompits (AI*IA, 2024)