Home
General
People
Courses
Research
Services

Publications of Hans Tompits

Journals

Reasoning about Evolving Nonmonotonic Knowledge Bases.
ACM Transactions on Computational Logic, 6(2):389-440, 2005.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)


On Computing Solutions to Belief Change Scenarios.
Journal of Logic and Computation, 14:801-826, 2004.
(Together with James P. Delgrande, Torsten Schaub, and Stefan Woltran.)


A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning.
Computational Intelligence, 20(2):308--334, 2004.
(Together with James P. Delgrande, Torsten Schaub, and Kewen Wang.)


Reasoning Methods for Personalization on the Semantic Web.
Annals of Mathematics, Computing & Teleinformatics (AMCT), 2(1):1--24, 2004.
(Together with Grigoris Antoniou, Matteo Baldoni, Cristina Baroglio, Viviana Patti , Robert Baumgartner, Thomas Eiter, Marcus Herzog, Roman Schindlauer, François Bry, Sebastian Schaffert, Nicola Henze, and Wolfgang May.)


A Framework for Compiling Preferences in Logic Programs.
Theory and Practice of Logic Programming, 3(2):129--188, 2003.
(Together with James P. Delgrande and Torsten Schaub.)


On Different Proof-Search Strategies for Orthologic.
Studia Logica, 73:131--152, 2003.
(Together with Uwe Egly.)


Expressing Default Abduction Problems as Quantified Boolean Formulas.
AI Communications, 16:89--105, 2003.

On Properties of Update Sequences Based on Causal Rejection.
Theory and Practice of Logic Programming, 2(6):711--768, 2002.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)


Using Methods of Declarative Logic Programming for Intelligent Information Agents.
Theory and Practice of Logic Programming, 2(6):645--710, 2002.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)


Proof-Complexity Results for Nonmonotonic Reasoning.
ACM Transactions on Computational Logic, 2(3):340-387, 2001.
(Together with Uwe Egly.)


A Survey of Non-Monotonic Reasoning.
Open Systems & Information Dynamics, 3(3):369-395, 1995.


Contributions in Books

Representing Paraconsistent Reasoning via Quantified Propositional Logic.
In: L. Bertossi, A. Hunter and T. Schaub (eds.), Inconsistency Tolerance, pp. 84-118. Springer, 2005.
(Together with Philippe Besnard, Torsten Schaub, and Stefan Woltran.)

Download paper at SpringerLink.

Declarative Update Policies for Nonmonotonic Knowledge Bases.
In: J. Chomicki, G. Saake, and R. van der Meyden (eds.), Logics for Emerging Applications of Databases. Springer, 2003.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)

Download paper at SpringerLink.

Some Strengths of Nonmonotonic Reasoning.
In: S. Hölldobler (ed.), Intellectics and Computational Logic. Papers in Honor of Wolfgang Bibel. Kluwer, 2000.
(Together with Uwe Egly.)



Conferences

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
Proceedings of the Twentyfirst International Conference on Logic Programming (ICLP 2005), pp. 189-203. Springer LNCS 3668, 2005.
(Together with Stefan Woltran.)

Preliminary version in: Proceedings of the Annual Meeting of WASP, the European Working Group on Answer Set Programming (ASP 2005). Bath, 2005.

A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming.
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 90-96, 2005.
(Together with Thomas Eiter, Giovambattista Ianni, and Roman Schindlauer.)


On Solution Correspondences in Answer-Set Programming.
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 97-102, 2005.
(Together with Thomas Eiter and Stefan Woltran.)


Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case.
Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 695-700. AAAI Press, 2005.
(Together with Thomas Eiter, Michael Fink, and Stefan Woltran.)


Nonmonotonic Description Logic Programs: Implementation and Experiments
Proceedings of the Eleventh International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), pp. 511-527. Springer LNCS 3452, 2005.
(Together with Thomas Eiter, Giovambattista Ianni, and Roman Schindlauer.)

Download paper at SpringerLink.

Combining Answer Set Programming with Description Logics for the Semantic Web.
Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 141-151. AAAI Press, 2004.
(Together with Thomas Eiter, Thomas Lukasiewicz, and Roman Schindlauer.)


On Eliminating Disjunctions in Stable Logic Programming.
Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 447-458. AAAI Press, 2004.
(Together with Thomas Eiter, Michael Fink, and Stefan Woltran.)


Domain-Specific Preferences for Causal Reasoning and Planning.
Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 673-682. AAAI Press, 2004.
(Together with James P. Delgrande and Torsten Schaub.)


On Acyclic and Head-cycle Free Nested Logic Programs.
Proceedings of the Twentieth International Conference on Logic Programming (ICLP 2004), pp. 225-239. Springer LNCS 3132, 2004.
(Together with Thomas Linke and Stefan Woltran.)

Download paper at SpringerLink.
Preliminary version in: Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 267-275, 2004.

Simplifying Logic Programs under Uniform and Strong Equivalence.
Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), pp. 87-99. Springer LNAI 2923, 2004.
(Together with Thomas Eiter, Michael Fink, and Stefan Woltran.)

Download paper at SpringerLink.

nlp: A Compiler for Nested Logic Programming.
Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), pp. 361-364. Springer LNAI 2923, 2004.
(Together with Vladimir Sarsakov, Torsten Schaub, and Stefan Woltran.)

Download paper at SpringerLink.

Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
Proceedings of the Sixth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2003), pp. 370-378. Springer LNAI 2919, 2004.
(Together with Uwe Egly, Martina Seidl, Stefan Woltran, and Michael Zolda.)

Download paper at SpringerLink.

Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
Proceedings of the Seventh European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2003), pp. 528-539. Springer LNAI 2711, 2003.
(Together with Philippe Besnard, Torsten Schaub, and Stefan Woltran.)

Download paper at SpringerLink.
Preliminary version in: Proceedings of the Third World Congress on Paraconsistency (WCP3), 2003.

A Generic Approach for Knowledge-Based Information-Site Selection.
Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 49-60, 2002.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)

Download extended Technical Report INFSYS RR-1843-03-14, December 2003.

A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report.
Proceedings of the International Conference on Logic Programming (ICLP 2002), pp. 405-420. Springer LNCS 2401, 2002.
(Together with David Pearce, Vladimir Sarsakov, Torsten Schaub, and Stefan Woltran.)

Download paper at SpringerLink.
Also in: Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning (NMR 2002).

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA 2002), pp. 320-331. Springer LNAI 2424, 2002.
(Together with Philippe Besnard, Torsten Schaub, and Stefan Woltran.)

Download paper at SpringerLink.
Preliminary version in: Proceedings of the ICLP 2002 Workshop on Paraconsistent Computational Logic (PCL 2002), 2002.

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
Proceedings of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2002), pp. 100-114. Springer LNAI 2381, 2002.
(Together with Thomas Eiter, Volker Klotz, and Stefan Woltran.)

Download paper at SpringerLink.

A Framework for Declarative Update Specifications in Logic Programs.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, Washington, USA, pp. 649-654. Morgan Kaufmann, 2001.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)


Reasoning about Evolving Nonmonotonic Knowledge Bases.
Proceedings of the Eighth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2001), pp. 407-421. Springer LNAI 2250, 2001.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)

Download paper at SpringerLink.

On Computing Solutions to Belief Change Scenarios.
Proceedings of the Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2001), pp. 510-521. Springer LNAI 2143, 2001.
(Together with James P. Delgrande, Torsten Schaub, and Stefan Woltran.)

Download paper at SpringerLink.

plp: A Generic Compiler for Ordered Logic Programs.
Proceedings of the Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001), pp. 411-415. Springer LNAI 2173, 2001.
(Together with James P. Delgrande and Torsten Schaub.)

Download paper at SpringerLink.

An Update Front-End for Extended Logic Programs.
Proceedings of the Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001), pp. 397-401. Springer LNAI 2173, 2001.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)

Download paper at SpringerLink.

Encodings for Equilibrium Logic and Logic Programs with Nested Expressions.
Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA 2001), pp. 306-320. Springer LNAI 2258, 2001.
(Together with David Pearce and Stefan Woltran.)

Download paper at SpringerLink.

Solving Advanced Reasoning Tasks using Quantified Boolean Formulas.
Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 417-422. AAAI/MIT Press, 2000.
(Together with Uwe Egly, Thomas Eiter, and Stefan Woltran.)


Logic Programs with Compiled Preferences.
Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI 2000), pp. 392-398. IOS Press, Amsterdam, 2000.
(Together with James P. Delgrande and Torsten Schaub.)
Preliminary version in: Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning (NMR 2000).


A Compilation of Brewka and Eiter's Approach to Prioritization.
Proceedings of the Seventh European Workshop on Logics in Artificial Intelligence (JELIA 2000), pp. 376-390. Springer LNAI 1919, 2000.
(Together with James P. Delgrande and Torsten Schaub.)

Download paper at SpringerLink.

Considerations on Updates of Logic Programs.
Proceedings of the Seventh European Workshop on Logics in Artificial Intelligence (JELIA 2000), pp. 2-20. Springer LNAI 1919, 2000.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)

Download paper at SpringerLink.

A Web-Based Tutoring Tool for Calculating Default Logic Extensions.
Proceedings of the World Conference on the WWW and Internet (WEBNET '99), 1999. AACE.
(Together with Uwe Egly, Michael Fink, and Axel Polleres.)


Gentzen-Like Methods in Quantum Logic.
Proceedings of the Eight International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX '99), Position Papers. Technical Report, Institute for Programming and Logics, University at Albany - SUNY, 1999.
(Together with Uwe Egly.)


On Proof Complexity of Circumscription.
Proceedings of the Seventh International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX '98), pp. 141-155. Springer LNAI 1397, 1998.
(Together with Uwe Egly.)


Non-elementary Speed-ups in Default Reasoning.
Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning (ECSQARU-FAPR '97), pp. 237-251. Springer LNAI 1244, 1997.
(Together with Uwe Egly.)


Is Non-Monotonic Reasoning Always Harder?
Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '97), pp. 60-75. Springer LNAI 1265, 1997.
(Together with Uwe Egly.)

Preliminary version in: Proceedings of the ECAI '96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Fachberichte Informatik 18-96, Universität Koblenz-Landau, Institut für Informatik, Rheinau 1, D-56075 Koblenz, Germany, pp. 24-28, 1996.


Symposia and Workshops

A General Framework for Expressing Preferences in Causal Reasoning and Planning.
Proceedings of the Seventh International Symposium on Logical Formalizations of Commonsense Reasoning (COMMONSENSE 2005). Korfu, 2005.
(Together with James P. Delgrande and Torsten Schaub.)


Well-Founded Semantics for Description Logic Programs in the Semantic Web.
Proceedings of the Second International Workshop on Rules and Rule Markup Languages for the Semantic Web (RuleML 2004), pp. 81-97. Springer LNCS 3323.
(Together with Thomas Eiter, Thomas Lukasiewicz, and Roman Schindlauer.)

Download paper at SpringerLink.

Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation.
Answer Set Programming: Advances in Theory and Implementation. The Annual meeting of WASP, the European Working Group on Answer Set Programming. Messina, Sicily, 26-28 September, 2003.
(Together with Thomas Eiter, Michael Fink, and Stefan Woltran.)


On Implementing Nested Logic Programs: Overview and Comparisons.
Proceedings of the Seventeenth Workshop on Logic Programming (WLP 2002). Technische Universität Dresden, Fakultät für Informatik, Technische Berichte TUD-F103-03, pp. 81-95, April 2003.
(Together with David Pearce, Vladimir Sarsakov, Torsten Schaub, and Stefan Woltran.)


Towards a Classification of Preference Handling Approaches in Nonmonotonic Reasoning.
Proceedings of the AAAI 2002 Workshop on Preferences in AI and CP: Symbolic Approaches, 2002.
(Together with James P. Delgrande, Torsten Schaub, and Kewen Wang.)


On Quantifier Shifting for Quantified Boolean Formulas
In: Proceedings of the Second International Workshop on Quantified Boolean Formulae (QBF 2002).
(Together with Uwe Egly and Stefan Woltran.)


Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Proceedings of the AAAI 2001 Spring Symposium on Answer Set Programming, pp. 417-422, 2001.
(Together with Uwe Egly, Thomas Eiter, Volker Klotz, and Stefan Woltran.)


A Toolbox for Abduction: Preliminary Report.
Proceedings of the IJCAR 2001 Workshop on Theory and Applications of Quantified Boolean Formulas, Technical Report DII 12/01, Dipartimento di Ingegneria dell'Informazione, Universita degli Studi di Siena, via Roma 56, 53100 Siena, Italy, pp. 29-39, 2001.
(Together with Uwe Egly, Volker Klotz, and Stefan Woltran.)


Declarative Knowledge Updates Through Agents.
In: Proceedings of the AISB 2001 Symposium on Adaptive Agents and Multi-Agent Systems, pp. 79-84, 2001.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)


Specifying Update Policies for Nonmonotonic Knowledge Bases.
Proceedings of the Fifth Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR 2001), Potsdam, Germany, 2001.
(Together with Thomas Eiter, Michael Fink, and Giuliana Sabbatini.)


On Mechanizing Modal Nonmonotonic Logics.
Proceedings of the Fifth Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR 2001), Potsdam, Germany, 2001.
(Together with Uwe Egly, Thomas Eiter, Rainer Feldmann, Volker Klotz, Stefan Schamberger, and Stefan Woltran.)


QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks.
Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning (NMR 2000).
(Together with Uwe Egly, Thomas Eiter, and Stefan Woltran.)

Download paper at the arXiv.org e-Print archive.

A Compiler for Ordered Logic Programs.
Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning (NMR 2000).
(Together with James P. Delgrande and Torsten Schaub.)

Download paper at the arXiv.org e-Print archive.

On Different Proof-Search Procedures for Orthologic (Extended Abstract).
In: Constructivism in Non-Classical Logics and Computer Science. Proceedings of the International Conference In Memoriam Pierangelo Miglioli, Mantova, Italy, September 30 - October 2, 2000.
(Together with Uwe Egly.)


Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.
Proceedings of the Fifteenth Workshop on Logic Programming and Constraint Systems (WLP 2000). GMD Report 110, pp. 113-122, 2000.
(Together with Uwe Egly, Thomas Eiter, Volker Klotz, and Stefan Woltran.)


Implementing Default Reasoning Using Quantified Boolean Formulae.
Proceedings of the Fourteenth Workshop on Logic Programming (WLP '99/00), 2000. Pages 223-225, GMD Report 90.
(Together with Uwe Egly, Thomas Eiter, and Stefan Woltran.)


Non-Elementary Speed-Ups of Proof Length in a Gentzen-Type Calculus for Default Logic.
Proceedings of the Third Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications (DGNMR '97), Max-Planck-Institut für Informatik, Im Stadtwald, Saarbrücken, Germany, pp. 139-148, 1997.
(Together with Uwe Egly.)


A Sequent Calculus for Intuitionistic Default Logic
Proceedings of the Twelfth Workshop on Logic Programming (WLP '97), 1997. Pages 69-79, Forschungsbericht PMS-FB-1997-10, Institut für Informatik, Ludwig-Maximilians-Universität München, Oettingenstraße 67, München.
(Together with Uwe Egly.)



Further Publications

Applying Reduction Techniques for Declarative Knowledge Representation and Reasoning.
Habilitation thesis, Institut für Informationssysteme, TU Wien, Austria, 2002.

On Proof Complexities of First-Order Nonmonotonic Logics.
PhD thesis, Institut für Informationssysteme, TU Wien, Austria, 1998.

Proceedings of the IJCAR 2001 Workshop on Theory and Applications of Quantified Boolean Formulas.
Technical Report DII 12/01, Dipartimento di Ingegneria dell'Informazione, Universita degli Studi di Siena, Italy, 2001.
(Together with Uwe Egly and Rainer Feldmann.)


Proceedings of the Thirteenth Workshop on Logic Programming (WLP '98).
Technical Report 1843-1998-10, Institut für Informationssysteme, Technische Universität Wien, 1998.
(Together with Uwe Egly.)



See also a list of my publications at our Technical Reports page.

Navigation:

Back to Homepage

tompits@kr.tuwien.ac.at