Hans Tompits

159 papers A* 19A 5B 36C 3Misc 2Journal 49Unranked 43
YearRankTypeTitle / Venue / Authors
2024 — conf
On Different Symbolic Music Representations for Algorithmic Composition Approaches Based on Neural Sequence Models.
AI*IA
Felix Schön, Hans Tompits
2023 — conf
PAUL-2: An Upgraded Transformer-Based Redesign of the Algorithmic Composer PAUL.
AI*IA
Felix Schön, Hans Tompits
2023 — conf
ReConf: An Automatic Context-Based Software Reconfiguration Tool for Autonomous Vehicles Using Answer-Set Programming.
AI*IA
Tobias Kain, Hans Tompits
2023 J jnl
Sequent-type rejection systems for finite-valued non-deterministic logics.
J. Appl. Non Class. Logics
Martin Gius, Hans Tompits
2022 Misc conf
PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels.
EPIA
Felix Schön, Hans Tompits
2021 J jnl
Beyond Uniform Equivalence between Answer-set Programs.
ACM Trans. Comput. Log.
Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
2021 A conf
C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles.
DATE
Tobias Kain, Hans Tompits, Timo Frederik Horeis, Johannes Heinrich, Julian-Steffen Müller, Fabian Plinke, Hendrik Decke, Marcel Aguirre Mehlhorn
2020 — conf
Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics.
ICLP Technical Communications
Tobias Geibinger, Hans Tompits
2020 J jnl
Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic.
Axioms
Sopo Pkhakadze, Hans Tompits
2020 — conf
Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles.
ASD@DATE
Tobias Kain, Philipp Mundhenk, Julian-Steffen Müller, Hans Tompits, Maximilian Wesche, Hendrik Decke
2019 B conf
A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur.
LPNMR
Sopo Pkhakadze, Hans Tompits
2019 B conf
Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs.
JELIA
Tobias Geibinger, Hans Tompits
2019 B conf
\mathsf Uhura : An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language.
JELIA
Tobias Kain, Hans Tompits
2018 — conf
A Tableau Calculus for a Multi-modal Logic of Dishonesty.
AI*IA
Sanja Pavlovic, Hans Tompits
2018 J jnl
A many-sorted variant of Japaridze's polymodal provability logic.
Log. J. IGPL
Gerald Berger, Lev D. Beklemishev, Hans Tompits
2018 J jnl
Local Redundancy in SAT: Generalizations of Blocked Clauses.
Log. Methods Comput. Sci.
Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2018 J jnl
Stepwise debugging of answer-set programs.
Theory Pract. Log. Program.
Johannes Oetsch, Jörg Pührer, Hans Tompits
2017 — conf
An Approach for Representing Answer Sets in Natural Language.
DECLARE
Min Fang, Hans Tompits
2017 B conf
Blocked Clauses in First-Order Logic.
LPAR
Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere
2017 J jnl
Blocked Clauses in First-Order Logic.
CoRR
Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere
2017 A* conf
Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?
IJCAI
Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2017 J jnl
Local Redundancy in SAT: Generalizations of Blocked Clauses.
CoRR
Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2017 J jnl
Stepwise Debugging of Answer-Set Programs.
CoRR
Johannes Oetsch, Jörg Pührer, Hans Tompits
2017 B conf
\mathsf Harvey : A System for Random Testing in ASP.
LPNMR
Alexander Greßler, Johannes Oetsch, Hans Tompits
2016 A conf
Super-Blocked Clauses.
IJCAR
Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2015 — conf
On Structural Analysis of Non-Ground Answer-Set Programs.
ICLP (Technical Communications)
Benjamin Kiesl, Peter Schüller, Hans Tompits
2014 J jnl
Modularity Aspects of Disjunctive Stable Models.
CoRR
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran
2013 J jnl
A Model-Theoretic Approach to Belief Change in Answer Set Programming.
ACM Trans. Comput. Log.
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2013 — ed.
Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers
INAP/WLP
Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf
2013 J jnl
Model-based recasting in answer-set programming.
J. Appl. Non Class. Logics
Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits, Stefan Woltran
2013 — conf
On Axiomatic Rejection for the Description Logic
KDPD
Gerald Berger, Hans Tompits
2013 J jnl
SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support.
Theory Pract. Log. Program.
Paula-Andra Busoniu, Johannes Oetsch, Jörg Pührer, Peter Skocovsky, Hans Tompits
2012 — conf
An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions.
ICLP (Technical Communications)
Johannes Oetsch, Jörg Pührer, Hans Tompits
2012 J jnl
Annotating Answer-Set Programs in LANA?
CoRR
Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits
2012 J jnl
Annotating answer-set programs in Lana.
Theory Pract. Log. Program.
Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits
2012 B conf
Guided Merging of Sequence Diagrams.
SLE
Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits
2012 A* conf
On the Small-Scope Hypothesis for Testing Answer-Set Programs.
KR
Johannes Oetsch, Michael Prischink, Jörg Pührer, Martin Schwengerer, Hans Tompits
2012 — conf
Stepwise Debugging of Description-Logic Programs.
Correct Reasoning
Johannes Oetsch, Jörg Pührer, Hans Tompits
2012 — conf
Towards Scenario-Based Testing of UML Diagrams.
TAP@TOOLS
Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer
2011 J jnl
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination.
ACM Trans. Comput. Log.
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2011 J jnl
Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming
CoRR
Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 B conf
Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence.
LPNMR
Johannes Oetsch, Hans Tompits
2011 J jnl
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs
CoRR
Christian Kloimüllner, Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 — conf
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs.
INAP/WLP
Christian Kloimüllner, Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 B conf
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison.
LPNMR
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 B conf
Stepping through an Answer-Set Program.
LPNMR
Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 — conf
The SeaLion has Landed: An IDE for Answer-Set Programming - Preliminary Report.
INAP/WLP
Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 J jnl
The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary Report
CoRR
Johannes Oetsch, Jörg Pührer, Hans Tompits
2011 — conf
Towards Semantics-Aware Merge Support in Optimistic Model Versioning.
MoDELS (Workshops)
Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer
2011 B conf
VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology.
LPNMR
Johannes Oetsch, Jörg Pührer, Martina Seidl, Hans Tompits, Patrick Zwickl
2010 J jnl
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
CoRR
Johannes Oetsch, Jörg Pührer, Hans Tompits
2010 J jnl
Catching the Ouroboros: On debugging non-ground answer-set programs.
Theory Pract. Log. Program.
Johannes Oetsch, Jörg Pührer, Hans Tompits
2010 — conf
Methods and Methodologies for Developing Answer-Set Programs - Project Description.
ICLP (Technical Communications)
Johannes Oetsch, Jörg Pührer, Hans Tompits
2010 A conf
On Testing Answer-Set Programs.
ECAI
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits
2010 J jnl
The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs
CoRR
Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits
2010 J jnl
The system Kato: Detecting cases of plagiarism for answer-set programs.
Theory Pract. Log. Program.
Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits
2009 J jnl
A general approach to belief change in answer set programming
CoRR
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2009 B conf
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection.
LPNMR
Jörg Pührer, Hans Tompits
2009 J jnl
Characterising equilibrium logic and nested logic programs: Reductions and complexity
CoRR
David Pearce, Hans Tompits, Stefan Woltran
2009 J jnl
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Theory Pract. Log. Program.
David Pearce, Hans Tompits, Stefan Woltran
2009 B conf
Merging Logic Programs under Answer Set Semantics.
ICLP
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2009 J jnl
Modularity Aspects of Disjunctive Stable Models.
J. Artif. Intell. Res.
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran
2009 B conf
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions.
LPNMR
Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
2008 A* conf
A Meta-Programming Technique for Debugging Answer-Set Programs.
AAAI
Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits
2008 — conf
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets.
FoIKS
Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran
2008 A* conf
Belief Revision of Logic Programs under Answer Set Semantics.
KR
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2008 J jnl
Combining answer set programming with description logics for the Semantic Web.
Artif. Intell.
Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
2008 B conf
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence.
ICLP
Jörg Pührer, Hans Tompits, Stefan Woltran
2008 A* conf
Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic.
KR
Jos de Bruijn, Thomas Eiter, Hans Tompits
2008 J jnl
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination
CoRR
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2008 A* conf
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction.
KR
Wolfgang Faber, Hans Tompits, Stefan Woltran
2008 B conf
Program Correspondence under the Answer-Set Semantics: The Non-ground Case.
ICLP
Johannes Oetsch, Hans Tompits
2007 J jnl
A General Framework for Expressing Preferences in Causal Reasoning and Planning.
J. Log. Comput.
James P. Delgrande, Torsten Schaub, Hans Tompits
2007 B conf
A Preference-Based Framework for Updating Logic Programs.
LPNMR
James P. Delgrande, Torsten Schaub, Hans Tompits
2007 J jnl
A knowledge-based approach for selecting information sources.
Theory Pract. Log. Program.
Thomas Eiter, Michael Fink, Hans Tompits
2007 — conf
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report.
CENT
Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran
2007 A* conf
Complexity Results for Checking Equivalence of Stratified Logic Programs.
IJCAI
Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
2007 B conf
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.
LPNMR
Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran
2007 B conf
Debugging ASP Programs by Means of ASP.
LPNMR
Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran
2007 A* conf
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination.
IJCAI
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2007 A* conf
Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection.
AAAI
Johannes Oetsch, Hans Tompits, Stefan Woltran
2007 B conf
Modularity Aspects of Disjunctive Stable Models.
LPNMR
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran
2007 — conf
Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report.
CENT
David Pearce, Hans Tompits, Stefan Woltran
2007 — conf
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT.
INAP/WLP
Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
2007 — conf
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics.
INAP/WLP
Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran
2006 — ed.
20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006
WLP
Michael Fink, Hans Tompits, Stefan Woltran
2006 J jnl
A Knowledge-Based Approach for Selecting Information Sources
CoRR
Thomas Eiter, Michael Fink, Hans Tompits
2006 — conf
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results.
WLP
Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
2006 B conf
Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning.
ESWC
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
2006 — conf
Forgetting in Managing Rules and Ontologies.
Web Intelligence
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang
2006 C conf
On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules.
KSEM
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2006 — conf
Reasoning with Rules and Ontologies.
Reasoning Web
Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits
2006 A* conf
Replacements in Non-Ground Answer-Set Programming.
KR
Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
2006 — conf
Replacements in Non-Ground Answer-Set Programming.
WLP
Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
2006 B conf
ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics.
JELIA
Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran
2006 — conf
dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics.
Web Intelligence
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
2006 — conf
dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework.
WLP
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
2005 A* conf
A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming.
IJCAI
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
2005 A* conf
On Solution Correspondences in Answer-Set Programming.
IJCAI
Thomas Eiter, Hans Tompits, Stefan Woltran
2005 J jnl
Reasoning about evolving nonmonotonic knowledge bases.
ACM Trans. Comput. Log.
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2005 — conf
Representing Paraconsistent Reasoning via Quantified Propositional Logic.
Inconsistency Tolerance
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
2005 A* conf
Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case.
AAAI
Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
2005 — conf
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
Answer Set Programming
Hans Tompits, Stefan Woltran
2005 B conf
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
ICLP
Hans Tompits, Stefan Woltran
2004 J jnl
A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning.
Comput. Intell.
James P. Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang
2004 A* conf
Combining Answer Set Programming with Description Logics for the Semantic Web.
KR
Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
2004 A* conf
Domain-Specific Preferences for Causal Reasoning and Planning.
ICAPS
James P. Delgrande, Torsten Schaub, Hans Tompits
2004 A* conf
Domain-Specific Preferences for Causal Reasoning and Planning.
KR
James P. Delgrande, Torsten Schaub, Hans Tompits
2004 B conf
Nonmonotonic Description Logic Programs: Implementation and Experiments.
LPAR
Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
2004 B conf
On Acyclic and Head-Cycle Free Nested Logic Programs.
ICLP
Thomas Linke, Hans Tompits, Stefan Woltran
2004 J jnl
On Computing Belief Change Operations using Quantified Boolean Formulas.
J. Log. Comput.
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2004 A* conf
On Eliminating Disjunctions in Stable Logic Programming.
KR
Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
2004 — conf
On acyclic and head-cycle free nested logic programs.
NMR
Thomas Linke, Hans Tompits, Stefan Woltran
2004 B conf
Simplifying Logic Programs Under Uniform and Strong Equivalence.
LPNMR
Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
2004 — conf
Well-Founded Semantics for Description Logic Programs in the Semantic Web.
RuleML
Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
2004 B conf
nlp: A Compiler for Nested Logic Programming.
LPNMR
Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
2003 J jnl
A Framework for Compiling Preferences in Logic Programs.
Theory Pract. Log. Program.
James P. Delgrande, Torsten Schaub, Hans Tompits
2003 A conf
Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
SAT
Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
2003 — conf
Declarative Update Policies for Nonmonotonic Knowledge Bases.
Logics for Emerging Applications of Databases
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2003 — conf
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation.
Answer Set Programming
Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
2003 J jnl
Expressing default abduction problems as quantified Boolean formulas.
AI Commun.
Hans Tompits
2003 J jnl
On Different Proof-Search Strategies for Orthologic.
Stud Logica
Uwe Egly, Hans Tompits
2003 C conf
Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
ECSQARU
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
2002 J jnl
A Framework for Compiling Preferences in Logic Programs
CoRR
James P. Delgrande, Torsten Schaub, Hans Tompits
2002 A* conf
A Generic Approach for Knowledge-Based Information-Site Selection.
KR
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2002 J jnl
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
CoRR
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
2002 B conf
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report.
ICLP
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
2002 — conf
A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report.
NMR
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran
2002 B conf
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
TABLEAUX
Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
2002 J jnl
On Properties of Update Sequences Based on Causal Rejection.
Theory Pract. Log. Program.
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2002 B conf
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
JELIA
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
2002 — conf
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
Paraconsistent Computational Logic
Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran
2002 J jnl
Reasoning about Evolving Nonmonotonic Knowledge Bases
CoRR
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2002 J jnl
Using Methods of Declarative Logic Programming for Intelligent Information Agents.
Theory Pract. Log. Program.
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2001 A* conf
A Framework for Declarative Update Specifications in Logic Programs.
IJCAI
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2001 B conf
An Update Front-End for Extended Logic Programs.
LPNMR
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2001 — conf
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Answer Set Programming
Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
2001 Misc conf
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions.
EPIA
David Pearce, Hans Tompits, Stefan Woltran
2001 C conf
On Computing Solutions to Belief Change Scenarios.
ECSQARU
James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
2001 J jnl
On Properties of Update Sequences Based on Causal Rejection
CoRR
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2001 J jnl
Proof-complexity results for nonmonotonic reasoning.
ACM Trans. Comput. Log.
Uwe Egly, Hans Tompits
2001 B conf
Reasoning about Evolving Nonmonotonic Knowledge Bases.
LPAR
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2001 J jnl
Using Methods of Declarative Logic Programming for Intelligent Information Agents
CoRR
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2001 B conf
plp: A Generic Compiler for Ordered Logic Programs.
LPNMR
James P. Delgrande, Torsten Schaub, Hans Tompits
2000 B conf
A Compilation of Brewka and Eiter's Approach to Prioritization.
JELIA
James P. Delgrande, Torsten Schaub, Hans Tompits
2000 J jnl
A Compiler for Ordered Logic Programs
CoRR
James P. Delgrande, Torsten Schaub, Hans Tompits
2000 B conf
Considerations on Updates of Logic Programs.
JELIA
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
2000 — conf
Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.
WLP
Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
2000 — conf
Implementing Default Reasoning Using Quantified Boolean Formulae.
WLP
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
2000 J jnl
Logic Programs with Compiled Preferences
CoRR
James P. Delgrande, Torsten Schaub, Hans Tompits
2000 A conf
Logic Programs with Compiled Preferences.
ECAI
James P. Delgrande, Torsten Schaub, Hans Tompits
2000 J jnl
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
CoRR
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
2000 — conf
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.
AAAI/IAAI
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
2000 — conf
Some Strengths of Nonmonotonic Reasoning.
Intellectics and Computational Logic
Uwe Egly, Hans Tompits
1999 — conf
A Web-based Tutoring Tool for Calculating Default Logic Extensions.
WebNet
Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits
1998 B conf
On Proof Complexity of Circumscription.
TABLEAUX
Uwe Egly, Hans Tompits
1997 — conf
A Sequent Calculus for Intuitionistic Default Logic.
WLP
Uwe Egly, Hans Tompits
1997 B conf
Is Non-Monotonic Reasoning Always Harder?
LPNMR
Uwe Egly, Hans Tompits
1997 — conf
Non-elementary Speed-Ups in Default Reasoning.
ECSQARU-FAPR
Uwe Egly, Hans Tompits