Here are some papers which are online available.

(For others, search the KBS Group Technical Reports or send email request.

• Reasoning with Parsimonious and Moderately Grounded Expansions

Thomas Eiter and Georg Gottlob.
Fundamenta Informaticae , 17(1,2):31–53, 1992. (.pdf).  

• Identifying the Minimal Transversals of A Hypergraph and Related Problems

Thomas Eiter and Georg Gottlob.
Technical Report CD-TR 91/16, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1991.(.ps.gz), (.dvi)
Shortened version appeared in: SIAM Journal on Computing, 24(6):1278-1304, 1995. (.ps.gz),

• The Complexity of Logic-Based Abduction

Thomas Eiter and Georg Gottlob
Technical Report CD-TR 92/35, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1992. (.ps.gz), (.dvi)
Appeared revised in: Journal of the ACM,42(1):3-42, 1995. (.ps.gz),

• Exact Transversal Hypergraphs and Application to Boolean μ-Functions

Thomas Eiter
Technical Report CD-TR 92/38, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1992.
Journal of Symbolic Computation,17:215-225, 1994. (.ps.gz), (.pdf)

• Generating Boolean μ-Expressions

Thomas Eiter
Technical Report CD-TR 94/71, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1994.
Acta Informatica,32(2):171-187, 1995. (.ps.gz), (.dvi)

• On the Computational Cost of Disjunctive Logic Programming: Propositional Case

Thomas Eiter and Georg Gottlob
Annals of Mathematics and Artificial Intelligence, 15(3/4):289-323, 1995. (.pdf), (.dvi)

• Recognizing Renamable Generalized Propositional Horn Formulas is NP-complete

Thomas Eiter, Pekka Kilpeläinen, and Heikki Mannila
Discrete Applied Mathematics, 59(1):23-31, 1995. Preprint (.ps.gz), (.pdf)

• Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems

Thomas Eiter, Georg Gottlob, and Yuri Gurevich
Technical Report CD-TR 95/77, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1995. (.ps.gz), (.dvi)
Appeared in: Annals of Pure and Applied Logic, 78(1):111-125, 1996. (.ps.gz),

• Curb Your Theory ! A circumscriptive approach for inclusive interpretation of disjunctive information

Thomas Eiter, Georg Gottlob, and Yuri Gurevich
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 634-639. Morgan Kaufman, 1993. (.ps.gz), (.dvi)

• The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

Thomas Eiter and Georg Gottlob
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 526-531. Morgan Kaufman, 1993. (.ps.gz), (.dvi)
Full paper appeared in: Journal of Computer and System Sciences, 53(3):497-512, 1996. (.ps.gz),

• Querying Disjunctive Databases Through Nonmonotonic Logics

Thomas Eiter and Piero Bonatti
Proceedings 5th Intl Conference on Database Theory (ICDT-95), pages 68-81, LNCS 893, © Springer, 1995. (.ps.gz), (.dvi)
Full paper appeared in: Theoretical Computer Science,160:321-363, 1996. (.ps.gz)

• Default Logic as a Query Language

Marco Cadoli, Thomas Eiter and Georg Gottlob
Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), pages 99-108. Morgan Kaufmann, 1994. (.ps.gz), (.dvi)
Extended paper appeared in: IEEE Transactions on Knowledge and Data Engineering, 9(3):448-463, 1997. (.ps.gz),

• Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics

Thomas Eiter and Georg Gottlob
Proceedings of the Tenth International Logic Programming Symposium (ILPS-93), pages 266-278. MIT Press, 1993. (.ps.gz), (.dvi)

• Complexity Aspects of Various Semantics for Disjunctive Databases

Thomas Eiter and Georg Gottlob
Proceedings of the Twelth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-93), pp. 158-176. ACM Press, 1993. (.ps.gz), (.dvi)

• Adding Disjunction to Datalog

Thomas Eiter, Georg Gottlob, and Heikki Mannila
Proceedings of the Thirteenth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-94), pp. 267-278. ACM Press, 1994. (.ps.gz), (.dvi)

• Disjunctive Datalog

Thomas Eiter, Georg Gottlob, and Heikki Mannila
ACM Transactions on Databases, 22(3):364-417, September 1997. (.ps.gz)

• Semantics and Complexity for Abduction from Default Logic

Thomas Eiter, Georg Gottlob, and Nicola Leone
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 870-876. AAAI Press, 1995. (.ps.gz), (.dvi)
Full paper: Artificial Intelligence, 90(1-2):177-222, 1997. (.ps.gz), (.dvi)

• Abduction From Logic Programs: Semantics and Complexity

Thomas Eiter, Georg Gottlob, and Nicola Leone
Theoretical Computer Science,189(1-2):129-177, 1997. (.ps.gz), (.dvi)

• The Diagnosis Frontend of the DLV System

Thomas Eiter, Wolfgang Faber, Nicola Leone, and Gerald Pfeifer
The European Journal on Artificial Intelligence (AI Communications),12(1-2):99–111, 1997 © IOS Press. (.ps.gz).
Extended Paper: Technical Report DBAI-TR-98-20, Institut für Informationssysteme, TU Vienna, Austria, 1998. (.ps.gz)

• Computing Non-ground Representations of Stable Models

Thomas Eiter, James Lu, and V.S. Subrahmanian
Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), pp. 198-217, LNCS 1265, © Springer, 1997. (.ps.gz), (.pdf)

• A First-Order Representation of Stable Models

Thomas Eiter, James Lu, and V.S. Subrahmanian
The European Journal on Artificial Intelligence (AI Communications),11(1):53–73, 1998 © IOS Press. (.ps.gz)

• Modular Logic Programming and Generalized Quantifiers

Thomas Eiter, Georg Gottlob, and Helmuth Veith
Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), pp. 290-309, LNCS 1265, © Springer, 1997. (.ps.gz)
Extended Paper: Technical Report CD-TR 97/111, Institut für Informationssysteme, TU Vienna, Austria, 1997. (.ps.gz) (.dvi)

• Generalized Quantifiers in Logic Programs

Thomas Eiter, Georg Gottlob, and Helmuth Veith
Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-en-Provence, France, August 11-22, 1997, pp. 72-98, LNCS 1754, © Springer, 2000. (.ps.gz)

• The Complexity Class Theta^p_2: Recent Results and Applications in AI and Modal Logic

Thomas Eiter and Georg Gottlob
Proceedings of the 11th International Symposium on Fundamentals of Computation Theory (FCT ‘97), pp. 1–18, LNCS 1279, © Springer, 1997. (.ps.gz)

• On the Complexity of Data Disjunctions

Thomas Eiter and Helmuth Veith
Technical Report DBAI-TR-99-29, Institut für Informationssysteme, TU Vienna, Austria, 1999. (.ps.gz)
Appeared revised in: Theoretical Computer Science, 288(1):101-128, 2002. (preprint, .ps.gz)

• Enhancing Model Checking in Verification by AI Techniques

Francesco Buccafurri, Thomas Eiter, Georg Gottlob, and Nicola Leone
Artificial Intelligence, 112(1-2):57-104, 1999. (preprint, .ps.gz)

• On ACTL Formulas Having Linear Counterexamples

Francesco Buccafurri, Thomas Eiter, Georg Gottlob, and Nicola Leone
Journal of Computer and System Sciences, 62(3):463-515, 2001. (preprint, .ps.gz)
Preliminary Technical Report INFSYS RR-1843-99-01, TU Vienna, Austria, 1999. (.ps.gz)

• An Efficient Method for Eliminating Varying Predicates from a Circumscription

Marco Cadoli, Thomas Eiter and Georg Gottlob
Artificial Intelligence,54:397-410, 1992. (.ps.gz), (.dvi)

• On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals

Thomas Eiter and Georg Gottlob
Proceedings of the Eleventh ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-92), pp. 261-273. ACM Press, 1992. (.ps.gz), (.dvi)
Full paper: Artificial Intelligence,57(2-3):227-270, 1992. (.ps.gz), (.dvi)

• Preferred Answer Sets for Extended Logic Programs

Gerd Brewka and Thomas Eiter
Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pp. 86-97. Morgan Kaufmann, 1998. (.ps.gz), (.dvi)
Full paper: Artificial Intelligence,109(1-2):297-356, 1999. (.ps.gz), (.dvi)

• Prioritizing Default Logic

Gerd Brewka and Thomas Eiter
In S.Hölldobler, editor, Intellectics and Computational Logic - Papers in Honor of Wolfgang Bibel, pages 27-45. ISBN 0-7923-6261-6, © Kluwer Academic Publishers, 2000. (.ps.gz), (.dvi)

• Distance Measures for Point Sets and Their Computation

Thomas Eiter and Heikki Mannila
Technical Report CD-TR 94/60, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1994.
Acta Informatica,34(2):109-133, 1997. (.ps.gz), (.dvi)

• Computing Discrete Frechet Distance

Thomas Eiter and Heikki Mannila
Technical Report CD-TR 94/64, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1994. (.ps.gz), (.pdf)

• On the Partial Semantics for Disjunctive Deductive Databases

Thomas Eiter, Nicola Leone, and Domenico Sacca
Technical Report CD-TR 95/82, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1995. (.ps.gz), (.dvi)
Appeared revised in: Annals of Mathematics and Artificial Intelligence, 19(1/2):59-96, 1997. (.ps.gz), (.dvi)

• Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases

Thomas Eiter, Nicola Leone, and Domenico Sacca
Technical Report CD-TR 95/83, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1995. (.ps.gz), (.dvi)
Appeared revised in: Theoretical Computer Science,206(1-1):181-218, 1998. (.ps.gz)

• On the Indiscernibility of Individuals in Logic Programming

Thomas Eiter, Georg Gottlob, and Nicola Leone
Technical Report CD-TR 96/101, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1996. (.ps.gz), (.dvi)
Appeared revised in: Journal of Logic and Computation, 7(6):805-824, 1997. (.ps.gz), (.pdf).

• Assumption Sets for Extended Logic Programs

Thomas Eiter, Nicola Leone, and David Pearce
In: JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday . Amsterdam University Press, 1999. (ISBN 90 5629 104 1)
(.pdf), (.ps.gz)

• Computing Intersections of Horn Theories for Reasoning with Models

Thomas Eiter, Kazuhisa Makino, and Toshihide Ibaraki
Proceedings Fifteenth National Conference on Artificial Intelligence (AAAI ‘98), July 26-30, 1998, Madison, Wisconsin, pages 292–297. © AAAI Press, 1998. (.ps.gz)
Full paper: Artificial Intelligence, 110(1-2):57-101, 1999. Preprint (.ps.gz),

• Note on the Complexity of Some Eigenvector Problems

Thomas Eiter and Georg Gottlob
Technical Report CD-TR 95/89, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1995. (.ps.gz), (.dvi)

• Complexity Results for Some Eigenvector Problems

Thomas Eiter and Georg Gottlob
International Journal of Computer Mathematics, 76(1/2):59-74, 2000. (.ps.gz), (.pdf)

• Bidual Horn Functions and Extensions

Thomas Eiter, Kazuhisa Makino, and Toshihide Ibaraki
Discrete Applied Mathematics, 96/97:55-88, 1999. Preprint (.ps.gz), (.pdf). Selected for the special volume Discrete Applied Mathematics, Editors’ Choice, Edition 1999.

• Recognition and Dualization of Disguised Bidual Horn Functions

Thomas Eiter, Kazuhisa Makino, and Toshihide Ibaraki
Information Processing Letters, 82(6):283-291, 2002. Preprint (.ps.gz), (.pdf),

• On the Difference of Horn Theories

Thomas Eiter, Kazuhisa Makino, and Toshihide Ibaraki
Proceedings Sixteenth Symposium on Theoretical Aspects of Computing (STACS ‘99), pages 448-457, LNCS 1563, © Springer, 1999. (.ps.gz), (.dvi)
Full paper (preprint): Journal of Computer and System Sciences, 61(3):487-507, 2000. (.ps.gz), (.dvi)

• Decision Lists and Related Boolean Functions

Thomas Eiter, Kazuhisa Makino, and Toshihide Ibaraki
Theoretical Computer Science, 270(1-2):493-524, 2002. Preprint(.ps.gz), (.pdf)

• Existential Second-Order Logic over Strings

Thomas Eiter and Georg Gottlob, and Yuri Gurevich
Journal of the ACM,47(1):77–131, 2000. (.ps.gz)

• Second-Order Logic over Strings: Regular and Non-Regular Fragments

Thomas Eiter, Georg Gottlob, and Thomas Schwentick
Proceedings Fifth International Conference on Developments in Language Theory (DLT 2001), LNCS, 2295, pages 37–56. © Springer, 2002. (.ps.gz)

• Extension of the Relational Algebra to Probabilistic Complex Values

Thomas Eiter, Thomas Lukasiewicz, and Michael Walter
Proceedings International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2000), Burg (Spreewald), Germany, Feb. 14-17, pages 94–115, LNCS 1762, © Springer, 2000. (.ps.gz), (.pdf)

• A Data Model and Algebra for Probabilistic Complex Values

Thomas Eiter, Thomas Lukasiewicz, and Michael Walter
Annals of Mathematics and Artificial Intelligence, 33(2-4):205-252, 2001. © Kluwer Academic Publishers. (Preliminary Technical Report)

• Probabilistic Object Bases

Thomas Eiter, James J. Lu, Thomas Lukasiewicz, and V. S. Subrahmanian
ACM Transactions on Databases, 26(3):264–312, 2001. (.ps.gz) (.pdf)
Longer Technical Report (containing all proofs).

• Declarative Problem-Solving Using the DLV System

Thomas Eiter, Wolfgang Faber, Nicola Leone and Gerald Pfeifer
In: Logic-Based Artificial Intelligence, J. Minker (editor), © Kluwer Academic Publishers, 2000.
preprint (.ps.gz)

• The DLV System for Knowledge Representation and Reasoning

Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello
ACM Transactions on Computational Logic, to appear. (.ps)
Preliminary Technical Report .

• Planning under Incomplete Knowledge

Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres
Proceedings First International Conference on Computational Logic (CL-2000), Knowledge Representation and Non-monotonic Reasoning Stream, pages 807-821, LNCS/LNAI 1861, © Springer, 2000. (.ps.gz), (.dvi)

• A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity

Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres
ACM Transactions on Computational Logic, to appear. (.ps)
Corresponding Technical Report .

• A Logic Programming Approach to Knowledge-State Planning, II: The DLV-K System

Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres
Artificial Intelligence , 144(1-2):157-211, 2003. (.ps.gz)
Corresponding Technical Report .

• Declarative Planning and Knowledge Representation in an Action Language

Thomas Eiter, Wolfgang Faber, Gerald Pfeifer, and Axel Polleres
Preprint. (.ps.gz) Appeared in: Intelligent Techniques for Planning, Ioannis Vlahavas and Dimitris Vrakas (eds), pp. 1–34. Idea Group, Inc., 2005.

• Default Reasoning from Conditional Knowledge Bases: Complexity and Tractable Cases

Thomas Eiter and Thomas Lukasiewicz
Full paper: Artificial Intelligence, 124(2):169-241, 2000. Preprint (.ps.gz), (.pdf)

• Complexity and Expressive Power of Logic Programming

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov
Proceedings Twelth IEEE International Conference on Computational Complexity (CCC ‘97), pages 82-101. IEEE Computer Society Press, 1997. (.ps.gz)
Full (largely extended) paper: ACM Computing Surveys, 33(3):374-425, 2001. (.ps.gz)
Technical Report version with detailed Index

• Solving Advanced Reasoning Tasks using Quantified Boolean Formulas

Uwe Egly and Thomas Eiter and Hans Tompits and Stefan Woltran
Proceedings Seventeenth National Conference on Artificial Intelligence (AAAI ‘00), July 30-August 3, 2000, Austin, Texas, pages 417–422; © AAAI Press, 2000. (.ps.gz)

• On the Complexity of Theory Curbing

Thomas Eiter and Georg Gottlob
Proceedings 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000), Reunion Island, France, 2000, pages 1-19 LNCS, 1955, pages 1-19. © Springer. (.ps.gz), (.pdf)

• Propositional Circumscription and Extended Closed World Reasoning are Pi^p_2-complete

Thomas Eiter and Georg Gottlob
Theoretical Computer Science, 114:231–245, 1993. Preprint (.ps.gz), (.dvi)

• Complexity of Nested Circumscription and Abnormality

Marco Cadoli, Thomas Eiter, and Georg Gottlob
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 169–174. Morgan Kaufmann, 2001. (.ps.gz), (.dvi)
Full paper (revised and extended): ACM Transactions on Computational Logic, to appear. (.ps)
Corresponding Preliminary Technical Report .

• Complexity Results for Structure-Based Causality

Thomas Eiter and Thomas Lukasiewicz
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 35-40. (Honored with the Distinguished Paper Award.) Morgan Kaufmann, 2001. (.ps.gz), (.dvi)

• Matchmaking for Structured Objects

Thomas Eiter, Daniel Veit, Jörg P. Müller, and Martin Schneider
Proceedings Third International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2001), pages 186-194, LNCS 2114, pages 186-194. © Springer, 2001. (.ps.gz), (.pdf)

• A Framework for Declarative Update Specifications in Logic Programs

Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 649-654. Morgan Kaufmann, 2001. (.ps.gz), (.dvi)
Extended paper

• Deontic Action Programs

Thomas Eiter and V.S. Subrahmanian
In T. Polle, T. Ripke, and K.-D. Schewe", editors, Fundamentals of Information Systems: Selected Papers presented at the 7th International Workshop on Foundations of Models and Languages for Data and Objects (FoMLaDO 98), October 5-8, 1998, Timmel, Germany", pages 37-54. ISBN 0-7923-8450-4, © Kluwer Academic Publishers, 1999. (.ps.gz), (.dvi)

• Heterogeneous Active Agents, I: Semantics

Thomas Eiter, V.S. Subrahmanian and Georg Pick
Artificial Intelligence, 108(1-2):179-255, 1999. Preprint (.ps.gz)

• Heterogeneous Active Agents, II: Algorithms and Complexity

Thomas Eiter and V.S. Subrahmanian
Artificial Intelligence, 108(1-2):257-307, 1999. Preprint (.ps.gz)

• Heterogeneous Active Agents, III: Polynomially Implementable Agents

Thomas Eiter and V.S. Subrahmanian
Artificial Intelligence, 117(1):107-167, 2000. Preprint (.ps.gz)
 
 
The papers on heterogeneous active agents are covered in the combrehensive book:
 

Heterogeneous Agent Systems: Theory and Implementation
V.S. Subrahmanian, P. Bonatti, J. Dix, T. Eiter, S. Kraus, F. Ozcan and R. Ross
640 pages, MIT Press, 2000. ISBN: 0262194368
sample version
 

• Error-Tolerant Agents

Thomas Eiter, Viviana Mascardi and V.S. Subrahmanian
Computational Logic: From Logic Programming into the Future, A. Kakas and F. Sadri (eds), pages 586-625, LNCS/LNAI 2407, pages 586-625. © Springer, 2002. (.ps.gz), (.pdf)

• A Comparison of Environments for Developing Software Agents

Thomas Eiter and Viviana Mascardi
The European Journal on Artificial Intelligence (AI Communications), 15:169-197, 2002. © IOS Press. (Preprint .ps.gz)
Preliminary Technical Report
 

• Using Methods of Declarative Logic Programming for Intelligent Information Agents

Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits
Theory and Practice of Logic Programming, 2(6):645–719. (abstract + paper)
 

• On Properties of Update Sequences Based on Causal Rejection

Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits
Theory and Practice of Logic Programming, 2(6):721-777, 2002. (abstract + paper)
 

• Reasoning about Evolving Nonmonotonic Knowledge Bases

Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits
Proceedings 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001), Havana, Cuba, December 2001, pages 407–421, LNCS 2250, © Springer. (.ps.gz), (.pdf)
Full paper (revised and extended): ACM Transactions on Computational Logic, to appear. (.ps.gz) (.pdf)
Corresponding Preliminary Technical Report .
 

• Complexity Results for Explanations in the Structural-Model Approach

Thomas Eiter and Thomas Lukasiewicz
Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR~2002), Toulouse, France, pages 49-60. Morgan Kaufmann, 2002. (.ps.gz), (.pdf)
Full paper: Artificial Intelligence, 154(1-2):145-198, 2004. (.ps.gz), (.pdf) (Preprint)
 

• A Generic Approach for Knowledge-Based Information-Site Selection

Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits
Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR~2002), Toulouse, France, pages 459–469. Morgan Kaufmann, 2002. (.ps.gz), (.pdf)
 

• New Results on Monotone Dualization and Generating Hypergraph Transversals

Thomas Eiter, Georg Gottlob, and Kazuhisa Makino
Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), May 19-21, 2002, Montreal, Quebec, Canada, pages 14–22. © ACM Press, 2002. (.ps.gz), (.pdf)
Full paper: SIAM Journal on Computing, 32(2):514-537, 2003. (.ps.gz) (Preprint).

• On Computing all Abductive Explanations

Thomas Eiter and Kazuhisa Makino
Proceedings Eighteenth National Conference on Artificial Intelligence (AAAI ‘02), July 28 – August 1, 2002, Edmonoton, Alberta (Canada). (Honored with the Distinguished Paper Award.) © AAAI Press, 2002. (.pdf), (.ps.gz)
 

• Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks

Thomas Eiter and Volker Klotz and Hans Tompits and Stefan Woltran
Proceedings International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), Copenhagen, Denmark, July 30 - August 1, 2002, pages 100-114, LNCS 2381, pages 100-114. © Springer, 2002. (.ps.gz)
 

• Causes and Explanations in the Structural-Model Approach: Tractable Cases

Thomas Eiter and Thomas Lukasiewicz
Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI-2002), August 1 - 4, 2002, Edmonton, Alberta, Canada, pages 146-153. (.ps.gz), (.pdf)
 

• Answer Set Planning under Action Costs

Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres
Proceedings 8th European Conference on Logics in Artificial Intelligence (JELIA 2002), LNCS/LNAI 2424, pages 186–197. © Springer, 2002. (.ps.gz), (.pdf).
Full paper: Journal of Artificial Intelligence Research , 19:25-71, 2003. (.ps.gz)
Corresponding Technical Report .
 

• Hypergraph Transversal Computation and Related Problems in Logic and AI

Thomas Eiter and Georg Gottlob
Proceedings 8th European Conference on Logics in Artificial Intelligence (JELIA 2002), LNCS/LNAI 2424, pages 549–564. © Springer, 2003. (.ps.gz), (.pdf)
 

• Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming

Thomas Eiter, Wolfgang Faber, Nicola Leone, and Gerald Pfeifer
Theory and Practice of Logic Programming, 3(4-5):463-498. (.ps.gz)
Corresponding Technical Report .
 

• Declarative Update Policies for Nonmonotonic Knowledge Bases

Thomas Eiter, Michael Fink, Giuliana Sabbatini, and Hans Tompits
In: Logics for Emerging Applications of Databases, Jan Chomicki, Gunther Saake, and Ron van der Meyden, editors, chapter 3, pages 85-129. © Springer, 2003.
Preliminary version  final version
 

• Probabilistic Reasoning about Actions in Nonmonotonic Causal Theories

Thomas Eiter and Thomas Lukasiewicz
Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI-2003), August 7-10, 2003, Acapulco, Mexico, pages 192-199. (.ps.gz), (.pdf)
 

• Generating all Abductive Explanations for Queries on Propositional Horn Theories

Thomas Eiter and Kazuhisa Makino
Proceedings 12th Annual Conference of the EACSL (CSL 2003), M. Baaz and J. Makowsky, editors, August 25 - 30 2003, Vienna, Austria, LNCS 2803, pages 197-211. © Springer, 2003. (.pdf), (.ps.gz)
 

• Abduction and the Dualization Problem

Thomas Eiter and Kazuhisa Makino
Proceedings 6th Conference on Discovery Science (DS 2003), October 17-19, 2003, Hokkaido, Japan LNCS 2843, pages 1-20. © Springer, 2003. (.pdf), (.ps.gz)
 

• Monitoring Agents using Declarative Planning

Jürgen Dix, Thomas Eiter, Michael Fink, Axel Polleres, and Yingqian Zhang
Proceedings 26th German Conference on Artificial Intelligence (KI 2003). September 15 - 18, University of Hamburg, Germany, LNCS/LNAI 2821, pages 646–660. © Springer, 2003. (.ps.gz), (.pdf).
Full paper: Fundamenta Informaticae , 57(2-4):345–370, 2003. (.ps.gz)
Corresponding Technical Report .
 

• Uniform Equivalence of Logic Programs under the Stable Model Semantics

Thomas Eiter and Michael Fink
Proceedings 19th International Conference on Logic Programming (ICLP 2003), Mumbai, India, December 9-13 2003, LNCS 2916, pages 224–238. © Springer. (.ps.gz), (.pdf)
 

• Efficient Evaluation of Logic Programs for Querying Data Integration Systems

Thomas Eiter, Michael Fink, Gianluigi Greco, and Domenico Lembo
Proceedings 19th International Conference on Logic Programming (ICLP 2003), Mumbai, India, December 2003, LNCS 2916, pages 163–177. © Springer. (.ps.gz), (.pdf)
 

• Towards Automated Integration of Guess and Check Programs in Answer Set Programming

Thomas Eiter and Axel Polleres
Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), LNCS 2923, pages 100-113. © Springer, 2004. (.ps.gz) (.pdf)
Preliminary version: Transforming coNP Checks to Answer Set Computation by Meta-Interpretation
Informal Proc. 2003 Joint Conference on Declarative Programming (APPIA-GULP-PRODE 2003), September 3-5, 2003, Reggio Calabria Italy. (.ps.gz), (.pdf)
Full paper: Theory and Practice of Logic Programming, to appear. (abstract + paper), Local Technical Report (.ps.gz)
 

• Simplifying Logic Programs under Uniform and Strong Equivalence

Thomas Eiter, Michael Fink, Hans Tompits, and Stefan Woltran
Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), LNCS 2923, pages 87-99. © Springer, 2004. (.ps.gz) (.pdf)
 

• Polynomial Time Algorithm for Constructing k-Maintainable Policies

Chitta Baral and Thomas Eiter
Proceedings 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), Whistler, British Columbia, Canada, June 3-7, 2004.
Reprinted in: Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), June 2-5, Whistler, British Columbia, Canada, 2004, pages 720-730. (.ps.gz) (.pdf)
 

• On Eliminating Disjunctions in Stable Logic Programming

Thomas Eiter, Hans Tompits, and Stefan Woltran
Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), June 2-5, Whistler, British Columbia, Canada, 2004, pages 447-458. (.ps.gz) (.pdf)
 

• Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming

Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, and Stefan Woltran
Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), June 2-5, Whistler, British Columbia, Canada, 2004, pages 377-387. (.ps.gz) (.pdf)
 

• Combining Answer Set Programming with Description Logics for the Semantic Web

Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), June 2-5, Whistler, British Columbia, Canada, 2004, pages 141-151. (.ps.gz) (.pdf)
 

• Well-founded Semantics for Description Logic Programs in the Semantic Web

Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
Proceedings RuleML 2004 Workshop, ISWC Conference, Hiroshima, Japan, November 2004, LNCS 3323, pages 81-97, © Springer, 2004. (.ps.gz) (.pdf)
 

• Plan Reversals for Recovery in Execution Monitoring

Thomas Eiter, Esra Erdem, and Wolfgang Faber
Proceedings Workshop on Nonmonotonic Reasoning (NMR-2004), Action and Causality Track, June 6-8, Whistler, British Columbia, Canada, 2004, pages 147-154. (.ps.gz) (.pdf)
 

• Semantical Characterizations and Complexity of Equivalences in Answer Set Programming

Thomas Eiter, Michael Fink, and Stefan Woltran
ACM Transactions on Computational Logic, to appear. (.ps)
Corresponding Technical Report .
 

• Nonmonotonic Description Logic Programs: Implementation and Experiments

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
Proceedings 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2004), March 14-18, 2005, Montevideo, Uruguay, LNCS 3452, pages 511-527, © Springer, 2005. (.ps.gz) (.pdf)
 

• Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case

Thomas Eiter, Michael Fink, Hans Tompits, and Stefan Woltran
Proceedings 20th National Conference on Artificial Intelligence (AAAI ‘05), July 9–13, 2005, Pittsburgh, Pennsylvania (USA), pp. 695-700. © AAAI Press, 2005. (.pdf), (.ps.gz)
 

• Using SAT and LP to Design Polynomial-Time Algorithms for Planning in Non-deterministic Domains

Chitta Baral, Thomas Eiter, and Jicheng Zhao
Proceedings 20th National Conference on Artificial Intelligence (AAAI ‘05), July 9–13, 2005, Pittsburgh, Pennsylvania (USA), pp. 578–583. © AAAI Press, 2005. (.pdf), (.ps.gz)
 

• The INFOMIX System for Advanced Integration of Incomplete and Inconsistent Data

Nicola Leone, Gianluigi Greco, Giovambattista Ianni, Vincenzino Lio, Giorgio Terracina, Thomas Eiter, Wolfgang Faber, Michael Fink, Georg Gottlob, Riccardo Rosati, Domenico Lembo, Maurizio Lenzerini, Marco Ruzzi, Edyta Kalka, Bartosz Nowicki, and Witold Staniszkis
Proceedings ACM SIGMOD Conference 2005 (SIGMOD 2005), June 13-16, 2005, Baltimore, Maryland, USA, pp. 915-917. © ACM, 2005. Preprint (.pdf), (.ps.gz)
 

• A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pages 90-96. Professional Book Center, 2005. (.ps.gz), (.pdf)
 

• On Solution Correspondences in Answer-Set Programming

Thomas Eiter, Hans Tompits, Stefan Woltran
Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pages 97-102. Professional Book Center, 2005. (.ps.gz), (.pdf)
 

• Updating Action Domain Descriptions

Thomas Eiter, Esra Erdem, Michael Fink, and Ján Senko
Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pages 418-423. Professional Book Center, 2005. (.ps.gz), (.pdf)
 

• Data Integration and Answer Set Programming

Thomas Eiter
Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), LNCS 3662, pages 13-25. © Springer, 2005. (.ps.gz) (.pdf)
 

• Testing Strong Equivalence of Datalog Programs: Implementation and Examples

Thomas Eiter, Wolfgang Faber, and Patrick Traxler
Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), LNCS 3662, pages 437–441. © Springer, 2005. (.ps.gz) (.pdf)
 

• KMonitor – A Tool for Monitoring Plan Execution in Action Theories

Thomas Eiter, Michael Fink, and Ján Senko
Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), LNCS 3662, pages 416–421. © Springer, 2005. (.ps.gz) (.pdf)
 

• Data Integration: A Challenging ASP Application

Nicola Leone, Thomas Eiter, Wolfgang Faber, Michael Fink, Georg Gottlob, Luigi Granata, Gianluigi Greco, Edyta Kalka, Giovambattista Ianni, Domenico Lembo, Maurizio Lenzerini, Vincenzino Lio, Bartosz Nowicki, Riccardo Rosati, Marco Ruzzi, Witold Staniszkis, and Giorgio Terracina
Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), LNCS 3662, pages 379-383. © Springer, 2005. (SpringerLink)
 

• NLP-DL: A KR System for Coupling Nonmonotonic Logic Programs with Description Logics

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
4th International Semantic Web Conference (ISWC 2005), Galway, Ireland, November 2005. System Poster (.ps.gz) (.pdf)
 

• DLV-HEX: Dealing with Semantic Web under Answer-Set Programming

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
4th International Semantic Web Conference (ISWC 2005), Galway, Ireland, November 2005. System Poster (.ps.gz) (.pdf)
 

• Answer Set Programming and Agents

Jürgen Dix and Thomas Eiter
AgentLink News , 19:14–17, 2005. (.pdf)
 

• A Knowledge-Based Approach for Selecting Information Sources

Thomas Eiter, Michael Fink, and Hans Tompits Theory and Practice of Logic Programming, to appear.
Preliminary Technical Report (.ps.gz)
 

• A Knowledge-Based Videotheodolite Measurement System for Object Representation/Monitoring

Alexander Reiterer, Uwe Egly, Thomas Eiter, and Heribert Kahmen Advances in Engineering Software, 39:821–827, 2008. Special issue on AICC 2005,
(.pdf) , final version https://doi.org/10.1016/j.advengsoft.2007.05.003
 

• Hybrid Reasoning With Rules and Ontologies

Wlodzimierz Drabent, Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner, Thomas Lukasiewicz, anJan Maluszynski
Semantic Techniques for the Web: The REWERSE perspective, Francois Bry and Jan Maluszynski, editors, chapter 1, pp. 1-49, LNCS 5500, © Springer, 2009. Preprint version (.pdf)
 

• Simulating Production Rules Using ACTHEX

Thomas Eiter, Cristina Feier, and Michael Fink
Lifschitz Festschrift: Essays Dedicated to Vladimir Lifschitz on the Occasion of his 65th Birthday, Esra Erdem, Joohyung Lee, Yuliya Lierler, and David Pearce, editors, pp. 211-228, LNCS 7265, © Springer, 2012. Preprint version (.pdf)
 

• Eliminating Nonmonotonic DL-Atoms in Description Logic Programs

Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen, and Thomas Eiter
Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (RR 2013), pp. 168–182, LNCS 7994, © Springer, 2013. Preprint version (.pdf)
 

• Hex Semantics Via Approximation Fixpoint Theory

Christian Antic, Thomas Eiter, and Michael Fink
Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-13), pp. 102-115, LNCS 8148, © Springer, 2013. Preprint version (.pdf)
 

• Modular Paracoherent Answer Sets

Giovanni Amendola, Thomas Eiter, and Nicola Leone
Proceedings 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), LNCS/LNAI 8761, pages 457–471. © Springer, 2014. Preprint (.pdf)
 

• Exploiting Contextual Knowledge for Hybrid Classification of Visual Objects

Proceedings 15th European Conference on Logics in Artificial Intelligence (JELIA 2014), LNCS/LNAI 10021, pages 223–239. © Springer, 2016. Preprint (.pdf)
 

• Reactive Maintenance Policies Over Equalized States in Dynamic Environments

Zeynep Gozen Saribatur, Chitta Baral, and Thomas Eiter
Proceedings 18th Portuguese Conference on Artificial Intelligence (EPIA 2017), LNCS/LNAI 10423, pages 709–723. © Springer, 2017. Preprint (.pdf)
 

• A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective

Thomas Eiter and Gabriele Kern-Isberner KI – Künstliche Intelligenz, 31(1):9–33, 2019.
author accepted manuscript (.pdf)
 

• Progression for Monitoring in Temporal ASP

Davide Soldá, Ignacio D. Lopez-Miguel, Ezio Bartocci, and Thomas Eiter_European Conference on Artificial Intelligence, 2023. Uncorrected preprint (.pdf)_