Hans Tompits

Orcid: 0000-0001-5673-2460

Affiliations:
  • TU Wien, Vienna, Austria


According to our database1, Hans Tompits authored at least 131 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Sequent-type rejection systems for finite-valued non-deterministic logics.
J. Appl. Non Class. Logics, October, 2023

PAUL-2: An Upgraded Transformer-Based Redesign of the Algorithmic Composer PAUL.
Proceedings of the AIxIA 2023 - Advances in Artificial Intelligence, 2023

ReConf: An Automatic Context-Based Software Reconfiguration Tool for Autonomous Vehicles Using Answer-Set Programming.
Proceedings of the AIxIA 2023 - Advances in Artificial Intelligence, 2023

2022
PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels.
Proceedings of the Progress in Artificial Intelligence, 2022

2021
Beyond Uniform Equivalence between Answer-set Programs.
ACM Trans. Comput. Log., 2021

C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2021

2020
Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics.
Proceedings of the Proceedings 36th International Conference on Logic Programming (Technical Communications), 2020

Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic.
Axioms, 2020

Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles.
Proceedings of the 2nd International Workshop on Autonomous Systems Design, 2020

2019
A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

\mathsf Uhura : An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

2018
Stepwise debugging of answer-set programs.
Theory Pract. Log. Program., 2018

Local Redundancy in SAT: Generalizations of Blocked Clauses.
Log. Methods Comput. Sci., 2018

A many-sorted variant of Japaridze's polymodal provability logic.
Log. J. IGPL, 2018

A Tableau Calculus for a Multi-modal Logic of Dishonesty.
Proceedings of the AI*IA 2018 - Advances in Artificial Intelligence, 2018

2017
\mathsf Harvey : A System for Random Testing in ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

Blocked Clauses in First-Order Logic.
Proceedings of the LPAR-21, 2017

An Approach for Representing Answer Sets in Natural Language.
Proceedings of the Declarative Programming and Knowledge Management, 2017

Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Super-Blocked Clauses.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015
On Structural Analysis of Non-Ground Answer-Set Programs.
Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Cork, Ireland, August 31, 2015

2013
SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support.
Theory Pract. Log. Program., 2013

A Model-Theoretic Approach to Belief Change in Answer Set Programming.
ACM Trans. Comput. Log., 2013

Model-based recasting in answer-set programming.
J. Appl. Non Class. Logics, 2013

On Axiomatic Rejection for the Description Logic <i>ALC</i>.
Proceedings of the Declarative Programming and Knowledge Management, 2013

2012
Annotating answer-set programs in Lana.
Theory Pract. Log. Program., 2012

Towards Scenario-Based Testing of UML Diagrams.
Proceedings of the Tests and Proofs - 6th International Conference, 2012

Guided Merging of Sequence Diagrams.
Proceedings of the Software Language Engineering, 5th International Conference, 2012

On the Small-Scope Hypothesis for Testing Answer-Set Programs.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

Stepwise Debugging of Description-Logic Programs.
Proceedings of the Correct Reasoning, 2012

2011
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination.
ACM Trans. Comput. Log., 2011

Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming
CoRR, 2011

Towards Semantics-Aware Merge Support in Optimistic Model Versioning.
Proceedings of the Models in Software Engineering, 2011

Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Stepping through an Answer-Set Program.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

The SeaLion has Landed: An IDE for Answer-Set Programming - Preliminary Report.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

2010
Catching the Ouroboros: On debugging non-ground answer-set programs.
Theory Pract. Log. Program., 2010

The system Kato: Detecting cases of plagiarism for answer-set programs.
Theory Pract. Log. Program., 2010

Methods and Methodologies for Developing Answer-Set Programs - Project Description.
Proceedings of the Technical Communications of the 26th International Conference on Logic Programming, 2010

On Testing Answer-Set Programs.
Proceedings of the ECAI 2010, 2010

2009
Characterising equilibrium logic and nested logic programs: Reductions and complexity<sup>, </sup>.
Theory Pract. Log. Program., 2009

Modularity Aspects of Disjunctive Stable Models.
J. Artif. Intell. Res., 2009

A general approach to belief change in answer set programming
CoRR, 2009

Characterising equilibrium logic and nested logic programs: Reductions and complexity
CoRR, 2009

Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Merging Logic Programs under Answer Set Semantics.
Proceedings of the Logic Programming, 25th International Conference, 2009

2008
Combining answer set programming with description logics for the Semantic Web.
Artif. Intell., 2008

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Belief Revision of Logic Programs under Answer Set Semantics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence.
Proceedings of the Logic Programming, 24th International Conference, 2008

Program Correspondence under the Answer-Set Semantics: The Non-ground Case.
Proceedings of the Logic Programming, 24th International Conference, 2008

Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

A Meta-Programming Technique for Debugging Answer-Set Programs.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
A knowledge-based approach for selecting information sources.
Theory Pract. Log. Program., 2007

A General Framework for Expressing Preferences in Causal Reasoning and Planning.
J. Log. Comput., 2007

Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2007

spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2007

Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report.
Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), 2007

Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report.
Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), 2007

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

A Preference-Based Framework for Updating Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Debugging ASP Programs by Means of ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Complexity Results for Checking Equivalence of Stratified Logic Programs.
Proceedings of the IJCAI 2007, 2007

Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination.
Proceedings of the IJCAI 2007, 2007

Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results.
Proceedings of the 20th Workshop on Logic Programming, 2006

dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework.
Proceedings of the 20th Workshop on Logic Programming, 2006

Replacements in Non-Ground Answer-Set Programming.
Proceedings of the 20th Workshop on Logic Programming, 2006

Forgetting in Managing Rules and Ontologies.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Reasoning with Rules and Ontologies.
Proceedings of the Reasoning Web, 2006

On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules.
Proceedings of the Knowledge Science, 2006

ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning.
Proceedings of the Semantic Web: Research and Applications, 2006

2005
Reasoning about evolving nonmonotonic knowledge bases.
ACM Trans. Comput. Log., 2005

On Solution Correspondences in Answer-Set Programming.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
Proceedings of the Logic Programming, 21st International Conference, 2005

Representing Paraconsistent Reasoning via Quantified Propositional Logic.
Proceedings of the Inconsistency Tolerance [result from a Dagstuhl seminar], 2005

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case.
Proceedings of the Proceedings, 2005

2004
On Computing Belief Change Operations using Quantified Boolean Formulas.
J. Log. Comput., 2004

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning.
Comput. Intell., 2004

Well-Founded Semantics for Description Logic Programs in the Semantic Web.
Proceedings of the Rules and Rule Markup Languages for the Semantic Web: Third International Workshop, 2004

On acyclic and head-cycle free nested logic programs.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

nlp: A Compiler for Nested Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Simplifying Logic Programs Under Uniform and Strong Equivalence.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Nonmonotonic Description Logic Programs: Implementation and Experiments.
Proceedings of the Logic for Programming, 2004

Combining Answer Set Programming with Description Logics for the Semantic Web.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

On Eliminating Disjunctions in Stable Logic Programming.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Domain-Specific Preferences for Causal Reasoning and Planning.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

2003
A Framework for Compiling Preferences in Logic Programs.
Theory Pract. Log. Program., 2003

On Different Proof-Search Strategies for Orthologic.
Stud Logica, 2003

Expressing default abduction problems as quantified Boolean formulas.
AI Commun., 2003

Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2003

Declarative Update Policies for Nonmonotonic Knowledge Bases.
Proceedings of the Logics for Emerging Applications of Databases [outcome of a Dagstuhl seminar], 2003

Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation.
Proceedings of the Answer Set Programming, 2003

2002
Using Methods of Declarative Logic Programming for Intelligent Information Agents.
Theory Pract. Log. Program., 2002

On Properties of Update Sequences Based on Causal Rejection.
Theory Pract. Log. Program., 2002

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
Proceedings of the Paraconsistent Computational Logic, 2002

A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

A Generic Approach for Knowledge-Based Information-Site Selection.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

2001
Proof-complexity results for nonmonotonic reasoning.
ACM Trans. Comput. Log., 2001

An Update Front-End for Extended Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

plp: A Generic Compiler for Ordered Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

A Framework for Declarative Update Specifications in Logic Programs.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Encodings for Equilibrium Logic and Logic Programs with Nested Expressions.
Proceedings of the Progress in Artificial Intelligence, 2001

On Computing Solutions to Belief Change Scenarios.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2001

Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Proceedings of the Answer Set Programming, 2001

2000
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
CoRR, 2000

A Compiler for Ordered Logic Programs
CoRR, 2000

Implementing Default Reasoning Using Quantified Boolean Formulae.
Proceedings of the 14. Workshop Logische Programmierung, 2000

Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.
Proceedings of the WLP 2000, 2000

Considerations on Updates of Logic Programs.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 2000

A Compilation of Brewka and Eiter's Approach to Prioritization.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 2000

Logic Programs with Compiled Preferences.
Proceedings of the ECAI 2000, 2000

Some Strengths of Nonmonotonic Reasoning.
Proceedings of the Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), 2000

Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
A Web-based Tutoring Tool for Calculating Default Logic Extensions.
Proceedings of WebNet 99, 1999

1998
On Proof Complexity of Circumscription.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1998

1997
A Sequent Calculus for Intuitionistic Default Logic.
Proceedings of the Twelfth Workshop Logic Programming, 1997

Is Non-Monotonic Reasoning Always Harder?
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Non-elementary Speed-Ups in Default Reasoning.
Proceedings of the Qualitative and Quantitative Practical Reasoning, 1997


  Loading...