The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Eiter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Eiter, Georg Gottlob
    On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. [Citation Graph (5, 30)][DBLP]
    PODS, 1992, pp:261-273 [Conf]
  2. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Default Logic as a Query Language. [Citation Graph (4, 0)][DBLP]
    KR, 1994, pp:99-108 [Conf]
  3. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Adding Disjunction to Datalog. [Citation Graph (4, 25)][DBLP]
    PODS, 1994, pp:267-278 [Conf]
  4. Thomas Eiter, Georg Gottlob
    On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. [Citation Graph (4, 0)][DBLP]
    Artif. Intell., 1992, v:57, n:2-3, pp:227-270 [Journal]
  5. Thomas Eiter, Georg Gottlob
    Identifying the Minimal Transversals of a Hypergraph and Related Problems. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1278-1304 [Journal]
  6. Thomas Eiter, Georg Gottlob
    Complexity Aspects of Various Semantics for Disjunctive Databases. [Citation Graph (3, 19)][DBLP]
    PODS, 1993, pp:158-167 [Conf]
  7. Piero A. Bonatti, Thomas Eiter
    Querying Disjunctive Databases Through Nonmonotonic Logics. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:321-363 [Journal]
  8. Thomas Eiter, Georg Gottlob
    Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:114, n:2, pp:231-245 [Journal]
  9. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
    Complexity and Expressive Power of Logic Programming. [Citation Graph (2, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:82-101 [Conf]
  10. Thomas Eiter, Nicola Leone, Domenico Saccà
    The Expressive Power of Partial Models in Disjunctive Deductive Databases. [Citation Graph (2, 0)][DBLP]
    Logic in Databases, 1996, pp:245-264 [Conf]
  11. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Disjunctive Datalog. [Citation Graph (2, 61)][DBLP]
    ACM Trans. Database Syst., 1997, v:22, n:3, pp:364-418 [Journal]
  12. Thomas Eiter, Georg Gottlob
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1993, pp:526-533 [Conf]
  13. Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello
    A Deductive System for Non-Monotonic Reasoning. [Citation Graph (1, 0)][DBLP]
    LPNMR, 1997, pp:364-375 [Conf]
  14. Thomas Eiter, Georg Gottlob
    Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. [Citation Graph (1, 0)][DBLP]
    ILPS, 1993, pp:266-278 [Conf]
  15. Thomas Eiter, Georg Gottlob
    The Complexity of Logic-Based Abduction. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:3-42 [Journal]
  16. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Default Logic as a Query Language. [Citation Graph (1, 37)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1997, v:9, n:3, pp:448-463 [Journal]
  17. Chitta Baral, Thomas Eiter, Jicheng Zhao
    Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:578-583 [Conf]
  18. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:417-422 [Conf]
  19. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:695-700 [Conf]
  20. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Computing Intersections of Horn Theories for Reasoning with Models. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:292-297 [Conf]
  21. Thomas Eiter, Kazuhisa Makino
    On Computing all Abductive Explanations. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:62-67 [Conf]
  22. Thomas Eiter, Kewen Wang
    Forgetting and Conflict Resolving in Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  23. Magdalena Ortiz, Diego Calvanese, Thomas Eiter
    Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  24. Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello
    The Architecture of a Disjunctive Deductive Database System. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1997, pp:141-152 [Conf]
  25. Thomas Eiter, Nicola Leone, Domenico Saccà
    Unfounded Sets and Partial Stable Models for Disjuntive Deductive Databases. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1996, pp:271-282 [Conf]
  26. Thomas Eiter, Axel Polleres
    Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 2003, pp:410-421 [Conf]
  27. Chitta Baral, Thomas Eiter
    A Polynomial Time Algorithm for Constructing k-Maintainable Policies. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2004, pp:111-121 [Conf]
  28. Thomas Eiter
    Abduction and the Dualization Problem. [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:1-2 [Conf]
  29. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  30. Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran
    Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2003, pp:- [Conf]
  31. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer
    Computing Preferred and Weakly Preferred Answer Sets by Meta Interpretation in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  32. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2003, pp:- [Conf]
  33. Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abdul Sattar, Kewen Wang
    LPForget: A System of Forgetting in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2006, pp:1101-1105 [Conf]
  34. Gerhard Brewka, Thomas Eiter
    Prioritizing Default Logic. [Citation Graph (0, 0)][DBLP]
    Intellectics and Computational Logic, 2000, pp:27-45 [Conf]
  35. Thomas Eiter, Viviana Mascardi, V. S. Subrahmanian
    Error-Tolerant Agents. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:586-625 [Conf]
  36. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    Planning under Incomplete Knowledge. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:807-821 [Conf]
  37. Thomas Eiter, Georg Gottlob
    Complexity of Propositional Knowledge Base Revision. [Citation Graph (0, 0)][DBLP]
    CNKBS, 1992, pp:38-40 [Conf]
  38. Thomas Eiter, Kazuhisa Makino
    Generating All Abductive Explanations for Queries on Propositional Horn Theories. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:197-211 [Conf]
  39. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Declarative Update Policies for Nonmonotonic Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    Logics for Emerging Applications of Databases, 2003, pp:85-129 [Conf]
  40. Thomas Eiter, Daniel Veit, Jörg P. Müller, Martin Schneider II
    Matchmaking for Structured Objects. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2001, pp:186-194 [Conf]
  41. Thomas Eiter, Nicola Leone, Domenico Saccà
    Partial Semantics for Disjunctive Deductive Databases. [Citation Graph (0, 0)][DBLP]
    DEXA, 1996, pp:564-573 [Conf]
  42. Thomas Eiter, Kazuhisa Makino
    Abduction and the Dualization Problem. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:1-20 [Conf]
  43. Thomas Eiter, Georg Gottlob, Thomas Schwentick
    Second-Order Logic over Strings: Regular and Non-regular Fragments. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:37-56 [Conf]
  44. Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko
    Resolving Conflicts in Action Descriptions. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:367-371 [Conf]
  45. Thomas Eiter, Georg Gottlob, Helmut Veith
    Generalized Quantifiers in Logic Programs. [Citation Graph (0, 0)][DBLP]
    ESSLLI, 1997, pp:72-98 [Conf]
  46. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. [Citation Graph (0, 0)][DBLP]
    ESWC, 2006, pp:273-287 [Conf]
  47. Thomas Eiter, Georg Gottlob
    The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:1-18 [Conf]
  48. Thomas Eiter, V. S. Subrahmanian
    Deontic Action Programs. [Citation Graph (0, 0)][DBLP]
    FMLDO, 1998, pp:37-54 [Conf]
  49. Thomas Eiter, Thomas Lukasiewicz, Michael Walter
    Extension of the Relational Algebra to Probabilistic Complex Values. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2000, pp:94-115 [Conf]
  50. Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello
    Progress Report on the Disjunctive Deductive Database System dlv. [Citation Graph (0, 0)][DBLP]
    FQAS, 1998, pp:148-163 [Conf]
  51. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Disjunctive Logic Programming over Finite Structures. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1994, pp:69-73 [Conf]
  52. Piero A. Bonatti, Thomas Eiter
    Querying Disjunctive Database Through Nonmonotonic Logics. [Citation Graph (0, 19)][DBLP]
    ICDT, 1995, pp:68-81 [Conf]
  53. Thomas Eiter, Michael Fink
    Uniform Equivalence of Logic Programs under the Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:224-238 [Conf]
  54. Thomas Eiter, Michael Fink, Gianluigi Greco, Domenico Lembo
    Efficient Evaluation of Logic Programs for Querying Data Integration Systems. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:163-177 [Conf]
  55. Thomas Eiter, Georg Gottlob
    Complexity Results for Logic-Based Abduction. [Citation Graph (0, 0)][DBLP]
    Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:29-44 [Conf]
  56. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Complexity of Nested Circumscription and Abnormality Theories. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:169-174 [Conf]
  57. Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko
    Updating Action Domain Descriptions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:418-423 [Conf]
  58. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    A Framework for Declarative Update Specifications in Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:649-654 [Conf]
  59. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:634-639 [Conf]
  60. Thomas Eiter, Georg Gottlob, Nicola Leone
    Semantics and Complexity of Abduction from Default Theories. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1995, pp:870-877 [Conf]
  61. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:90-96 [Conf]
  62. Thomas Eiter, Thomas Lukasiewicz
    Complexity Results for Structure-Based Causality. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:35-42 [Conf]
  63. Thomas Eiter, Hans Tompits, Stefan Woltran
    On Solution Correspondences in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:97-102 [Conf]
  64. Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
    Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:304-309 [Conf]
  65. Thomas Eiter, Esra Erdem, Wolfgang Faber
    On Reversing Actions: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:336-341 [Conf]
  66. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Complexity Results for Checking Equivalence of Stratified Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:330-335 [Conf]
  67. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Two-Face Horn Extensions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:112-121 [Conf]
  68. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:49-58 [Conf]
  69. Thomas Eiter, Georg Gottlob, Heikki Mannila
    Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
    IS/KI, 1994, pp:83-103 [Conf]
  70. Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko
    Comparing Action Descriptions Based on Semantic Preferences. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:124-137 [Conf]
  71. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    Answer Set Planning under Action Costs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:186-197 [Conf]
  72. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    The DLVK Planning System: Progress Report. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:541-544 [Conf]
  73. Thomas Eiter, Michael Fink, Ján Senko
    A Tool for Answering Queries on Action Descriptions. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:473-476 [Conf]
  74. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Considerations on Updates of Logic Programs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2000, pp:2-20 [Conf]
  75. Thomas Eiter, Georg Gottlob
    Hypergraph Transversal Computation and Related Problems in Logic and AI. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:549-564 [Conf]
  76. Thomas Eiter, Thomas Lukasiewicz
    New Tractable Cases in Default Reasoning from Conditional Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    JELIA, 2000, pp:313-328 [Conf]
  77. Thomas Eiter, Patrick Traxler, Stefan Woltran
    An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:477-480 [Conf]
  78. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Francesco Calimeri, Tina Dell'Armi, Thomas Eiter, Georg Gottlob, Giovambattista Ianni, Giuseppe Ielpa, Christoph Koch, Simona Perri, Axel Polleres
    The DLV System. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:537-540 [Conf]
  79. Jürgen Dix, Thomas Eiter, Michael Fink, Axel Polleres, Yingqian Zhang
    Monitoring Agents Using Declarative Planning. [Citation Graph (0, 0)][DBLP]
    KI, 2003, pp:646-660 [Conf]
  80. Gerhard Brewka, Thomas Eiter
    Preferred Answer Sets for Extended Logic Programs. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:86-97 [Conf]
  81. Chitta Baral, Thomas Eiter
    A Polynomial-Time Algorithm for Constructing k-Maintainable Policies. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:720-730 [Conf]
  82. Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran
    Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:377-387 [Conf]
  83. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    A Generic Approach for Knowledge-Based Information-Site Selection. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:459-469 [Conf]
  84. Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
    Replacements in Non-Ground Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:340-351 [Conf]
  85. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    On Eliminating Disjunctions in Stable Logic Programming. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:447-458 [Conf]
  86. Thomas Eiter, Thomas Lukasiewicz
    Complexity Results for Default Reasoning from Conditional Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:62-73 [Conf]
  87. Thomas Eiter, Thomas Lukasiewicz
    Complexity Results for Explanations in the Structural-Model Approach. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:49-60 [Conf]
  88. Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello
    The KR System dlv: Progress Report, Comparisons and Benchmarks. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:406-417 [Conf]
  89. Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
    Combining Answer Set Programming with Description Logics for the Semantic Web. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:141-151 [Conf]
  90. Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
    On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. [Citation Graph (0, 0)][DBLP]
    KSEM, 2006, pp:1-22 [Conf]
  91. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Existential Second-Order Logic over Strings. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:16-27 [Conf]
  92. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about Evolving Nonmonotonic Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:407-421 [Conf]
  93. Thomas Eiter, Georg Gottlob
    On the Complexity of Theory Curbing. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:1-19 [Conf]
  94. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    Nonmonotonic Description Logic Programs: Implementation and Experiments. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:511-527 [Conf]
  95. Thomas Eiter
    Data Integration and Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:13-25 [Conf]
  96. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    System Description: The DLVK Planning System. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:429-433 [Conf]
  97. Thomas Eiter, Michael Fink, Ján Senko
    KMonitor - A Tool for Monitoring Plan Execution in Action Theories. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:416-421 [Conf]
  98. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    An Update Front-End for Extended Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:397-401 [Conf]
  99. Thomas Eiter, Wolfgang Faber, Patrick Traxler
    Testing Strong Equivalence of Datalog Programs - Implementation and Examples. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:437-441 [Conf]
  100. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
    Simplifying Logic Programs Under Uniform and Strong Equivalence. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:87-99 [Conf]
  101. Thomas Eiter, Georg Gottlob, Nicola Leone
    Complexity Results for Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:1-14 [Conf]
  102. Thomas Eiter, Georg Gottlob, Helmut Veith
    Modular Logic Programming and Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:290-309 [Conf]
  103. Thomas Eiter, James J. Lu, V. S. Subrahmanian
    Computing Non-Ground Representations of Stable Models. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:198-217 [Conf]
  104. Thomas Eiter, Axel Polleres
    Towards Automated Integration of Guess and Check Programs in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:100-113 [Conf]
  105. 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, Giorgio Terracina
    Data Integration: a Challenging ASP Application. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:379-383 [Conf]
  106. Davy Van Nieuwenborgh, Thomas Eiter, Dirk Vermeir
    Conditional Planning with External Functions. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:214-227 [Conf]
  107. Thomas Eiter, Esra Erdem, Wolfgang Faber
    Plan reversals for recovery in execution monitoring. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:147-154 [Conf]
  108. Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits
    Well-Founded Semantics for Description Logic Programs in the Semantic Web. [Citation Graph (0, 0)][DBLP]
    RuleML, 2004, pp:81-97 [Conf]
  109. Robert Baumgartner, Thomas Eiter, Georg Gottlob, Marcus Herzog, Christoph Koch
    Information Extraction for the Semantic Web. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2005, pp:275-289 [Conf]
  110. Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits
    Reasoning with Rules and Ontologies. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2006, pp:93-127 [Conf]
  111. Nicola Leone, Thomas Eiter, Wolfgang Faber, Michael Fink, Georg Gottlob, Gianluigi Greco
    Boosting Information Integration: The INFOMIX System. [Citation Graph (0, 0)][DBLP]
    SEBD, 2005, pp:55-66 [Conf]
  112. 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, Witold Staniszkis
    The INFOMIX system for advanced integration of incomplete and inconsistent data. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2005, pp:915-917 [Conf]
  113. Thomas Eiter, Georg Gottlob
    The Complexity of Logic-Based Abduction. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:70-79 [Conf]
  114. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On Disguised Double Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:50-60 [Conf]
  115. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:467-477 [Conf]
  116. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New results on monotone dualization and generating hypergraph transversals. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:14-22 [Conf]
  117. Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2002, pp:100-114 [Conf]
  118. Thomas Eiter, Thomas Lukasiewicz
    Causes and Explanations in the Structural-Model Approach : Tractable Cases. [Citation Graph (0, 0)][DBLP]
    UAI, 2002, pp:146-153 [Conf]
  119. Thomas Eiter, Thomas Lukasiewicz
    Probabilistic Reasoning about Actions in Nonmonotonic Causal Theories. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:192-199 [Conf]
  120. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang
    Forgetting in Managing Rules and Ontologies. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2006, pp:411-419 [Conf]
  121. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2006, pp:1073-1074 [Conf]
  122. Simona Citrigno, Thomas Eiter, Wolfgang Faber, Georg Gottlob, Christoph Koch, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello
    The dlv System: Model Generator and Advanced Frontends (system description). [Citation Graph (0, 0)][DBLP]
    WLP, 1997, pp:0-0 [Conf]
  123. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran
    Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. [Citation Graph (0, 0)][DBLP]
    15. WLP, 2000, pp:113-122 [Conf]
  124. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    Implementing Default Reasoning Using Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    WLP, 2000, pp:223-228 [Conf]
  125. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    Using the dlv System for Planning and Diagnostic Reasoning. [Citation Graph (0, 0)][DBLP]
    WLP, 2000, pp:125-134 [Conf]
  126. Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
    Replacements in Non-Ground Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    WLP, 2006, pp:145-153 [Conf]
  127. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
    dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. [Citation Graph (0, 0)][DBLP]
    WLP, 2006, pp:206-210 [Conf]
  128. Thomas Eiter, Nicola Leone
    On Modularity Properties of Partial Semantics for Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    WLP, 1995, pp:217-226 [Conf]
  129. Thomas Eiter
    Generating Boolean mu-Expressions [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:2, pp:171-187 [Journal]
  130. Thomas Eiter, Heikki Mannila
    Distance Measures for Point Sets and their Computation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:2, pp:109-133 [Journal]
  131. Gerhard Brewka, Thomas Eiter
    Preferred Answer Sets for Extended Logic Programs. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:109, n:1-2, pp:297-356 [Journal]
  132. Francesco Buccafurri, Thomas Eiter, Georg Gottlob, Nicola Leone
    Enhancing Model Checking in Verification by AI Techniques. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:112, n:1-2, pp:57-104 [Journal]
  133. Marco Cadoli, Thomas Eiter, Georg Gottlob
    An Efficient Method for Eliminating Varying Predicates from a Circumscription. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:54, n:2, pp:397-410 [Journal]
  134. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    A logic programming approach to knowledge-state planning, II: The DLVK system. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:144, n:1-2, pp:157-211 [Journal]
  135. Thomas Eiter, Georg Gottlob, Nicola Leone
    Semantics and Complexity of Abduction from Default Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:90, n:1-2, pp:177-223 [Journal]
  136. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Computing Intersections of Horn Theories for Reasoning with Models. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:110, n:1, pp:57-101 [Journal]
  137. Thomas Eiter, Thomas Lukasiewicz
    Default reasoning from conditional knowledge bases: Complexity and tractable cases. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:124, n:2, pp:169-241 [Journal]
  138. Thomas Eiter, Thomas Lukasiewicz
    Complexity results for structure-based causality. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:142, n:1, pp:53-89 [Journal]
  139. Thomas Eiter, Thomas Lukasiewicz
    Complexity results for explanations in the structural-model approach. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:154, n:1-2, pp:145-198 [Journal]
  140. Thomas Eiter, Thomas Lukasiewicz
    Causes and explanations in the structural-model approach: Tractable cases. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:6-7, pp:542-580 [Journal]
  141. Thomas Eiter, V. S. Subrahmanian
    Heterogeneous Active Agents, II: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:108, n:1-2, pp:257-307 [Journal]
  142. Thomas Eiter, V. S. Subrahmanian, George Pick
    Heterogeneous Active Agents, I: Semantics. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:108, n:1-2, pp:179-255 [Journal]
  143. Thomas Eiter, V. S. Subrahmanian, Timothy J. Rogers
    Heterogeneous active agents, III: Polynomially implementable agents. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:117, n:1, pp:107-167 [Journal]
  144. Thomas Eiter, James J. Lu, V. S. Subrahmanian
    A First-Order Representation of Stable Models. [Citation Graph (0, 0)][DBLP]
    AI Commun., 1998, v:11, n:1, pp:53-73 [Journal]
  145. Thomas Eiter, Viviana Mascardi
    Comparing environments for developing software agents. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2002, v:15, n:4, pp:169-197 [Journal]
  146. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer
    The Diagnosis Frontend of the dlv System. [Citation Graph (0, 0)][DBLP]
    AI Commun., 1999, v:12, n:1-2, pp:99-111 [Journal]
  147. Thomas Eiter, Georg Gottlob
    On the Computational Cost of Disjunctive Logic Programming: Propositional Case. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:289-323 [Journal]
  148. Thomas Eiter, Nicola Leone, Domenico Saccà
    On the Partial Semantics for Disjunctive Deductive Databases. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:19, n:1-2, pp:59-96 [Journal]
  149. Thomas Eiter, Thomas Lukasiewicz, Michael Walter
    A data model and algebra for probabilistic complex values. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2001, v:33, n:2-4, pp:205-252 [Journal]
  150. Thomas Eiter, Klaus-Dieter Schewe
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:40, n:1-2, pp:1-3 [Journal]
  151. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:111-125 [Journal]
  152. Thomas Eiter, Wolfgang Faber, Christoph Koch, Nicola Leone, Gerald Pfeifer
    DLV - A System for Declarative Problem Solving [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  153. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran
    QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  154. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    On Properties of Update Sequences Based on Causal Rejection [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  155. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  156. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Complexity of Nested Circumscription and Nested Abnormality Theories [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  157. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about Evolving Nonmonotonic Knowledge Bases [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  158. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
    The DLV System for Knowledge Representation and Reasoning [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  159. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New Results on Monotone Dualization and Generating Hypergraph Transversals [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  160. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer
    Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  161. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Using Methods of Declarative Logic Programming for Intelligent Information Agents [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  162. Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
    Complexity and expressive power of logic programming. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2001, v:33, n:3, pp:374-425 [Journal]
  163. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Bidual Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:55-88 [Journal]
  164. Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila
    Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:1, pp:23-31 [Journal]
  165. Jürgen Dix, Thomas Eiter, Michael Fink, Axel Polleres, Yingqian Zhang
    Monitoring Agents using Declarative Planning. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:345-370 [Journal]
  166. Thomas Eiter, Georg Gottlob
    Reasoning with parsimonious and moderately grounded expansions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:17, n:1-2, pp:31-53 [Journal]
  167. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Double Horn Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:144, n:2, pp:155-190 [Journal]
  168. Thomas Eiter, Michael Schrefl, Markus Stumptner
    Sperrverfahren für B-Bäume im Vergleich. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1991, v:14, n:4, pp:183-200 [Journal]
  169. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Recognition and dualization of disguised bidual Horn functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:6, pp:283-291 [Journal]
  170. Thomas Eiter, Yuri Gurevich, Georg Gottlob
    Existential second-order logic over strings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:1, pp:77-131 [Journal]
  171. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    Answer Set Planning Under Action Costs. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2003, v:19, n:, pp:25-71 [Journal]
  172. Thomas Eiter, Domenico Lembo
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2005, v:3, n:1, pp:251-252 [Journal]
  173. Francesco Buccafurri, Thomas Eiter, Georg Gottlob, Nicola Leone
    On ACTL Formulas Having Linear Counterexamples. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:463-515 [Journal]
  174. Thomas Eiter, Georg Gottlob
    The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:497-512 [Journal]
  175. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:3, pp:478-507 [Journal]
  176. Thomas Eiter, Georg Gottlob
    Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:33, n:2, pp:167-178 [Journal]
  177. Thomas Eiter
    Exact Transversal Hypergraphs and Application to Boolean µ-Functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:17, n:3, pp:215-225 [Journal]
  178. Thomas Eiter, Georg Gottlob
    On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:1, pp:73-82 [Journal]
  179. Thomas Eiter, Georg Gottlob
    Mächtigkeit von Logikprogrammierung über Datenbanken. [Citation Graph (0, 0)][DBLP]
    KI, 1996, v:10, n:3, pp:32-39 [Journal]
  180. Thomas Eiter, Georg Gottlob, Nicola Leone
    On the Indiscernibility of Individuals in Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:6, pp:805-824 [Journal]
  181. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New Results on Monotone Dualization and Generating Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:514-537 [Journal]
  182. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:269-288 [Journal]
  183. Thomas Eiter, Georg Gottlob, Nicola Leone
    Abduction from Logic Programs: Semantics and Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:189, n:1-2, pp:129-177 [Journal]
  184. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Decision lists and related Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:493-524 [Journal]
  185. Thomas Eiter, Nicola Leone, Domenico Saccà
    Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:181-218 [Journal]
  186. Thomas Eiter, Helmut Veith
    On the complexity of data disjunctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:1, pp:101-128 [Journal]
  187. Thomas Eiter, Georg Gottlob
    Reasoning under minimal upper bounds in propositional logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:82-115 [Journal]
  188. Thomas Eiter, Leonid Libkin
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:371, n:3, pp:147- [Journal]
  189. Marco Cadoli, Thomas Eiter, Georg Gottlob
    Complexity of propositional nested circumscription and nested abnormality theories. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:2, pp:232-272 [Journal]
  190. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
    A logic programming approach to knowledge-state planning: Semantics and complexity. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:2, pp:206-263 [Journal]
  191. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Reasoning about evolving nonmonotonic knowledge bases. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:2, pp:389-440 [Journal]
  192. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
    The DLV system for knowledge representation and reasoning. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:3, pp:499-562 [Journal]
  193. Thomas Eiter, James J. Lu, Thomas Lukasiewicz, V. S. Subrahmanian
    Probabilistic object bases. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2001, v:26, n:3, pp:264-312 [Journal]
  194. Thomas Eiter, Leonid Libkin
    Introduction to special ICDT section. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:3, pp:769- [Journal]
  195. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer
    Computing preferred answer sets by meta-interpretation in answer set programming. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:4-5, pp:463-498 [Journal]
  196. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    On Properties of Update Sequences Based on Causal Rejection. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:6, pp:711-767 [Journal]
  197. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
    Using Methods of Declarative Logic Programming for Intelligent Information Agents. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:6, pp:645-709 [Journal]
  198. Thomas Eiter, Axel Polleres
    Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications. [Citation Graph (0, 0)][DBLP]
    TPLP, 2006, v:6, n:1-2, pp:23-60 [Journal]
  199. Diego Calvanese, Thomas Eiter, Magdalena Ortiz
    Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:391-396 [Conf]
  200. Gerhard Brewka, Thomas Eiter
    Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:385-390 [Conf]
  201. Magdalena Ortiz, Diego Calvanese, Thomas Eiter
    Data Complexity of Answering Unions of Conjunctive Queries in SHIQ. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2006, pp:- [Conf]
  202. Alexander Reiterer, Thomas Eiter
    A Distance-Based Method for the Evaluation of Interest point Detection Algorithms. [Citation Graph (0, 0)][DBLP]
    ICIP, 2006, pp:2745-2748 [Conf]
  203. Thomas Eiter
    Answer Set Programming for the Semantic Web. [Citation Graph (0, 0)][DBLP]
    ICLP, 2007, pp:23-26 [Conf]
  204. Mantas Simkus, Thomas Eiter
    \mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:514-530 [Conf]
  205. François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei
    Foundations of Rule-Based Query Answering. [Citation Graph (0, 0)][DBLP]
    Reasoning Web, 2007, pp:1-153 [Conf]
  206. Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko
    Comparing action descriptions based on semantic preferences. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:50, n:3-4, pp:273-304 [Journal]
  207. Thomas Eiter, Axel Polleres
    Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  208. Thomas Eiter, Michael Fink, Stefan Woltran
    Semantical Characterizations and Complexity of Equivalences in Answer Set Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  209. Thomas Eiter, Michael Fink, Hans Tompits
    A Knowledge-Based Approach for Selecting Information Sources [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  210. Thomas Eiter, Esra Erdem, Wolfgang Faber, Ján Senko
    A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:79, n:1-2, pp:25-69 [Journal]
  211. Thomas Eiter, Kazuhisa Makino
    On computing all abductive explanations from a propositional Horn theory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:5, pp:- [Journal]
  212. Thomas Eiter, Michael Fink, Stefan Woltran
    Semantical characterizations and complexity of equivalences in answer set programming. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:3, pp:- [Journal]

  213. Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses. [Citation Graph (, )][DBLP]


  214. Error Classification in Action Descriptions: A Heuristic Approach. [Citation Graph (, )][DBLP]


  215. Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities. [Citation Graph (, )][DBLP]


  216. The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. [Citation Graph (, )][DBLP]


  217. Exploiting Conjunctive Queries in Description Logic Programs. [Citation Graph (, )][DBLP]


  218. Conjunctive Query Answering in SH using Knots. [Citation Graph (, )][DBLP]


  219. New Results for Horn Cores and Envelopes of Horn Disjunctions. [Citation Graph (, )][DBLP]


  220. Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics. [Citation Graph (, )][DBLP]


  221. Realizing Default Logic over Description Logic Knowledge Bases. [Citation Graph (, )][DBLP]


  222. Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs. [Citation Graph (, )][DBLP]


  223. Combining Nonmonotonic Knowledge Bases with External Sources. [Citation Graph (, )][DBLP]


  224. SMS and ASP: Hype or TST?. [Citation Graph (, )][DBLP]


  225. Modular Nonmonotonic Logic Programming Revisited. [Citation Graph (, )][DBLP]


  226. Finding Similar or Diverse Solutions in Answer Set Programming. [Citation Graph (, )][DBLP]


  227. Regular Path Queries in Expressive Description Logics with Nominals. [Citation Graph (, )][DBLP]


  228. Decomposition of Declarative Knowledge Bases with External Functions. [Citation Graph (, )][DBLP]


  229. Query Answering in Description Logics with Transitive Roles. [Citation Graph (, )][DBLP]


  230. Bidirectional Answer Set Programs with Function Symbols. [Citation Graph (, )][DBLP]


  231. The mcs-ie System for Explaining Inconsistency in Multi-Context Systems. [Citation Graph (, )][DBLP]


  232. The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems. [Citation Graph (, )][DBLP]


  233. Decomposition of Distributed Nonmonotonic Multi-Context Systems. [Citation Graph (, )][DBLP]


  234. Query Answering in the Description Logic Horn-. [Citation Graph (, )][DBLP]


  235. Preference-Based Inconsistency Assessment in Multi-Context Systems. [Citation Graph (, )][DBLP]


  236. Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. [Citation Graph (, )][DBLP]


  237. Distributed Nonmonotonic Multi-Context Systems. [Citation Graph (, )][DBLP]


  238. Paracoherent Answer Set Programming. [Citation Graph (, )][DBLP]


  239. Finding Explanations of Inconsistency in Multi-Context Systems. [Citation Graph (, )][DBLP]


  240. Reasoning Using Knots. [Citation Graph (, )][DBLP]


  241. Argumentation Context Systems: A Framework for Abstract Group Argumentation. [Citation Graph (, )][DBLP]


  242. From Data Integration towards Knowledge Mediation. [Citation Graph (, )][DBLP]


  243. Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs. [Citation Graph (, )][DBLP]


  244. Rules and Ontologies for the Semantic Web. [Citation Graph (, )][DBLP]


  245. Answer Set Programming: A Primer. [Citation Graph (, )][DBLP]


  246. A Reasoner for Simple Conceptual Logic Programs. [Citation Graph (, )][DBLP]


  247. Query Answering in Description Logics: The Knots Approach. [Citation Graph (, )][DBLP]


  248. Combining answer set programming with description logics for the Semantic Web. [Citation Graph (, )][DBLP]


  249. Semantic forgetting in answer set programming. [Citation Graph (, )][DBLP]


  250. Maintenance goals of agents in a dynamic environment: Formulation and policy construction. [Citation Graph (, )][DBLP]


  251. Updating action domain descriptions. [Citation Graph (, )][DBLP]


  252. Complexity results for answer set programming with bounded predicate arities and implications. [Citation Graph (, )][DBLP]


  253. Exploiting conjunctive queries in description logic programs. [Citation Graph (, )][DBLP]


  254. Data complexity of answering conjunctive queries over SHIQ knowledge bases [Citation Graph (, )][DBLP]


  255. Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination [Citation Graph (, )][DBLP]


  256. Computational aspects of monotone dualization: A brief survey. [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002