 | 2009 |
|---|
| 257 |       | Sergio Tessaris,
Enrico Franconi,
Thomas Eiter,
Claudio Gutierrez,
Siegfried Handschuh,
Marie-Christine Rousset,
Renate A. Schmidt:
Reasoning Web. Semantic Technologies for Information Systems, 5th International Summer School 2009, Brixen-Bressanone, Italy, August 30 - September 4, 2009, Tutorial Lectures
Springer 2009 |
| 256 | | Minh Dao-Tran,
Thomas Eiter,
Thomas Krennwallner:
Realizing Default Logic over Description Logic Knowledge Bases.
ECSQARU 2009: 602-613 |
| 255 | | Thomas Eiter,
Gerhard Brewka,
Minh Dao-Tran,
Michael Fink,
Giovambattista Ianni,
Thomas Krennwallner:
Combining Nonmonotonic Knowledge Bases with External Sources.
FroCos 2009: 18-42 |
| 254 | | Minh Dao-Tran,
Thomas Eiter,
Michael Fink,
Thomas Krennwallner:
Modular Nonmonotonic Logic Programming Revisited.
ICLP 2009: 145-159 |
| 253 | | Thomas Eiter,
Esra Erdem,
Halit Erdogan,
Michael Fink:
Finding Similar or Diverse Solutions in Answer Set Programming.
ICLP 2009: 342-356 |
| 252 | | Diego Calvanese,
Thomas Eiter,
Magdalena Ortiz:
Regular Path Queries in Expressive Description Logics with Nominals.
IJCAI 2009: 714-720 |
| 251 | | Thomas Eiter,
Michael Fink,
Thomas Krennwallner:
Decomposition of Declarative Knowledge Bases with External Functions.
IJCAI 2009: 752-758 |
| 250 | | Thomas Eiter,
Carsten Lutz,
Magdalena Ortiz,
Mantas Simkus:
Query Answering in Description Logics with Transitive Roles.
IJCAI 2009: 759-764 |
| 249 | | Thomas Eiter,
Mantas Simkus:
Bidirectional Answer Set Programs with Function Symbols.
IJCAI 2009: 765-771 |
| 248 | | Gerhard Brewka,
Thomas Eiter:
Argumentation Context Systems: A Framework for Abstract Group Argumentation.
LPNMR 2009: 44-57 |
| 247 | | Gerhard Brewka,
Thomas Eiter:
From Data Integration towards Knowledge Mediation.
LPNMR 2009: 610-612 |
| 246 | | Minh Dao-Tran,
Thomas Eiter,
Michael Fink,
Thomas Krennwallner:
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs.
LPNMR 2009: 87-100 |
| 245 | | Stijn Heymans,
Cristina Feier,
Thomas Eiter:
A Reasoner for Simple Conceptual Logic Programs.
RR 2009: 55-70 |
| 244 | | Thomas Eiter,
Giovambattista Ianni,
Thomas Krennwallner:
Answer Set Programming: A Primer.
Reasoning Web 2009: 40-110 |
| 243 | | Thomas Eiter,
Carsten Lutz,
Magdalena Ortiz,
Mantas Simkus:
Query Answering in Description Logics: The Knots Approach.
WoLLIC 2009: 26-36 |
| 242 | | Wlodzimierz Drabent,
Thomas Eiter,
Giovambattista Ianni,
Thomas Krennwallner,
Thomas Lukasiewicz,
Jan Maluszynski:
Hybrid Reasoning with Rules and Ontologies.
REWERSE 2009: 1-49 |
| 2008 |
|---|
| 241 |  | Magdalena Ortiz,
Mantas Simkus,
Thomas Eiter:
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses.
AAAI 2008: 504-510 |
| 240 | | Thomas Eiter,
Michael Fink,
Ján Senko:
Error Classification in Action Descriptions: A Heuristic Approach.
AAAI 2008: 905-910 |
| 239 | | Magdalena Ortiz,
Mantas Simkus,
Thomas Eiter:
Conjunctive Query Answering in SH using Knots.
Description Logics 2008 |
| 238 | | Thomas Eiter,
Kazuhisa Makino:
New Results for Horn Cores and Envelopes of Horn Disjunctions.
ECAI 2008: 60-64 |
| 237 | | Thomas Eiter:
SMS and ASP: Hype or TST?.
ICLP 2008: 77-82 |
| 236 | | Thomas Eiter,
Georg Gottlob,
Magdalena Ortiz,
Mantas Simkus:
Query Answering in the Description Logic Horn-.
JELIA 2008: 166-179 |
| 235 | | Jos de Bruijn,
Thomas Eiter,
Hans Tompits:
Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic.
KR 2008: 485-495 |
| 234 | | Thomas Eiter,
Magdalena Ortiz,
Mantas Simkus:
Reasoning Using Knots.
LPAR 2008: 377-390 |
| 233 | | Thomas Eiter,
Giovambattista Ianni,
Thomas Krennwallner,
Axel Polleres:
Rules and Ontologies for the Semantic Web.
Reasoning Web 2008: 1-53 |
| 232 | | Thomas Eiter,
Michael Fink,
Gianluigi Greco,
Domenico Lembo:
Repair localization for query answering from inconsistent databases.
ACM Trans. Database Syst. 33(2): (2008) |
| 231 | | Alexander Reiterer,
Uwe Egly,
Thomas Eiter,
Heribert Kahmen:
A knowledge-based videotheodolite measurement system for object representation/monitoring.
Advances in Engineering Software 39(10): 821-827 (2008) |
| 230 | | Thomas Eiter,
Giovambattista Ianni,
Thomas Krennwallner,
Roman Schindlauer:
Exploiting conjunctive queries in description logic programs.
Ann. Math. Artif. Intell. 53(1-4): 115-152 (2008) |
| 229 | | Chitta Baral,
Thomas Eiter,
Marcus Bjäreland,
Mutsumi Nakamura:
Maintenance goals of agents in a dynamic environment: Formulation and policy construction.
Artif. Intell. 172(12-13): 1429-1469 (2008) |
| 228 | | Thomas Eiter,
Giovambattista Ianni,
Thomas Lukasiewicz,
Roman Schindlauer,
Hans Tompits:
Combining answer set programming with description logics for the Semantic Web.
Artif. Intell. 172(12-13): 1495-1539 (2008) |
| 227 | | Thomas Eiter,
Kewen Wang:
Semantic forgetting in answer set programming.
Artif. Intell. 172(14): 1644-1672 (2008) |
| 226 | | Jos de Bruijn,
Thomas Eiter,
Axel Polleres,
Hans Tompits:
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination
CoRR abs/0811.0359: (2008) |
| 225 | | Thomas Eiter,
Kazuhisa Makino,
Georg Gottlob:
Computational aspects of monotone dualization: A brief survey.
Discrete Applied Mathematics 156(11): 2035-2049 (2008) |
| 224 | | Thomas Eiter,
Esra Erdem,
Wolfgang Faber:
Undoing the effects of action sequences.
J. Applied Logic 6(3): 380-415 (2008) |
| 223 | | Magdalena Ortiz,
Diego Calvanese,
Thomas Eiter:
Data Complexity of Query Answering in Expressive Description Logics via Tableaux.
J. Autom. Reasoning 41(1): 61-98 (2008) |
| 2007 |
|---|
| 222 | | Gerhard Brewka,
Thomas Eiter:
Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems.
AAAI 2007: 385-390 |
| 221 | | Diego Calvanese,
Thomas Eiter,
Magdalena Ortiz:
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach.
AAAI 2007: 391-396 |
| 220 | | Thomas Eiter,
Giovambattista Ianni,
Thomas Krennwallner,
Roman Schindlauer:
Exploiting Conjunctive Queries in Description Logic Programs.
Description Logics 2007 |
| 219 | | Thomas Eiter:
Answer Set Programming for the Semantic Web.
ICLP 2007: 23-26 |
| 218 | | Jos de Bruijn,
Thomas Eiter,
Axel Polleres,
Hans Tompits:
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination.
IJCAI 2007: 304-309 |
| 217 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
Complexity Results for Checking Equivalence of Stratified Logic Programs.
IJCAI 2007: 330-335 |
| 216 | | Thomas Eiter,
Esra Erdem,
Wolfgang Faber:
On Reversing Actions: Algorithms and Complexity.
IJCAI 2007: 336-341 |
| 215 | | Mantas Simkus,
Thomas Eiter:
\mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols.
LPAR 2007: 514-530 |
| 214 | | Davy Van Nieuwenborgh,
Thomas Eiter,
Dirk Vermeir:
Conditional Planning with External Functions.
LPNMR 2007: 214-227 |
| 213 | | 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.
Reasoning Web 2007: 1-153 |
| 212 | | Thomas Eiter,
Michael Fink,
Stefan Woltran:
Semantical characterizations and complexity of equivalences in answer set programming.
ACM Trans. Comput. Log. 8(3): (2007) |
| 211 | | Thomas Eiter,
Esra Erdem,
Michael Fink,
Ján Senko:
Comparing action descriptions based on semantic preferences.
Ann. Math. Artif. Intell. 50(3-4): 273-304 (2007) |
| 210 | | Thomas Eiter,
Wolfgang Faber,
Michael Fink,
Stefan Woltran:
Complexity results for answer set programming with bounded predicate arities and implications.
Ann. Math. Artif. Intell. 51(2-4): 123-165 (2007) |
| 209 | | Thomas Eiter,
Esra Erdem,
Wolfgang Faber,
Ján Senko:
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution.
Fundam. Inform. 79(1-2): 25-69 (2007) |
| 208 | | Thomas Eiter,
Kazuhisa Makino:
On computing all abductive explanations from a propositional Horn theory.
J. ACM 54(5): (2007) |
| 207 | | Thomas Eiter,
Michael Fink,
Hans Tompits:
A knowledge-based approach for selecting information sources.
TPLP 7(3): 249-300 (2007) |
| 206 | | Thomas Eiter,
Leonid Libkin:
Preface.
Theor. Comput. Sci. 371(3): 147 (2007) |
| 2006 |
|---|
| 205 | | Thomas Eiter,
Enrico Franconi,
Ralph Hodgson,
Susie Stephens:
Rules and Rule Markup Languages for the Semantic Web, Second International Conference, RuleML 2006, Athens, Georgia, USA, November 10-11, 2006, Proceedings
IEEE Computer Society 2006 |
| 204 | | Magdalena Ortiz,
Diego Calvanese,
Thomas Eiter:
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics.
AAAI 2006 |
| 203 | | Thomas Eiter,
Kewen Wang:
Forgetting and Conflict Resolving in Disjunctive Logic Programming.
AAAI 2006 |
| 202 | | Fu-Leung Cheng,
Thomas Eiter,
Nathan Robinson,
Abdul Sattar,
Kewen Wang:
LPForget: A System of Forgetting in Answer Set Programming.
Australian Conference on Artificial Intelligence 2006: 1101-1105 |
| 201 | | Magdalena Ortiz,
Diego Calvanese,
Thomas Eiter:
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ.
Description Logics 2006 |
| 200 | | Thomas Eiter,
Esra Erdem,
Michael Fink,
Ján Senko:
Resolving Conflicts in Action Descriptions.
ECAI 2006: 367-371 |
| 199 | | Thomas Eiter,
Giovambattista Ianni,
Roman Schindlauer,
Hans Tompits:
Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning.
ESWC 2006: 273-287 |
| 198 | | Alexander Reiterer,
Thomas Eiter:
A Distance-Based Method for the Evaluation of Interest point Detection Algorithms.
ICIP 2006: 2745-2748 |
| 197 | | Thomas Eiter,
Esra Erdem,
Michael Fink,
Ján Senko:
Comparing Action Descriptions Based on Semantic Preferences.
JELIA 2006: 124-137 |
| 196 | | Thomas Eiter,
Michael Fink,
Ján Senko:
A Tool for Answering Queries on Action Descriptions.
JELIA 2006: 473-476 |
| 195 | | Thomas Eiter,
Patrick Traxler,
Stefan Woltran:
An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs.
JELIA 2006: 477-480 |
| 194 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Patrick Traxler,
Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming.
KR 2006: 340-351 |
| 193 | | Jos de Bruijn,
Thomas Eiter,
Axel Polleres,
Hans Tompits:
On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules.
KSEM 2006: 1-22 |
| 192 | | Thomas Eiter,
Giovambattista Ianni,
Axel Polleres,
Roman Schindlauer,
Hans Tompits:
Reasoning with Rules and Ontologies.
Reasoning Web 2006: 93-127 |
| 191 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Patrick Traxler,
Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming.
WLP 2006: 145-153 |
| 190 | | Thomas Eiter,
Giovambattista Ianni,
Roman Schindlauer,
Hans Tompits:
dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework.
WLP 2006: 206-210 |
| 189 | | Thomas Eiter,
Giovambattista Ianni,
Roman Schindlauer,
Hans Tompits:
dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics.
Web Intelligence 2006: 1073-1074 |
| 188 | | Thomas Eiter,
Giovambattista Ianni,
Roman Schindlauer,
Hans Tompits,
Kewen Wang:
Forgetting in Managing Rules and Ontologies.
Web Intelligence 2006: 411-419 |
| 187 | | Nicola Leone,
Gerald Pfeifer,
Wolfgang Faber,
Thomas Eiter,
Georg Gottlob,
Simona Perri,
Francesco Scarcello:
The DLV system for knowledge representation and reasoning.
ACM Trans. Comput. Log. 7(3): 499-562 (2006) |
| 186 | | Thomas Eiter,
Leonid Libkin:
Introduction to special ICDT section.
ACM Trans. Database Syst. 31(3): 769 (2006) |
| 185 | | Thomas Eiter,
Thomas Lukasiewicz:
Causes and explanations in the structural-model approach: Tractable cases.
Artif. Intell. 170(6-7): 542-580 (2006) |
| 184 | | Thomas Eiter,
Michael Fink,
Hans Tompits:
A Knowledge-Based Approach for Selecting Information Sources
CoRR abs/cs/0604086: (2006) |
| 183 | | Thomas Eiter,
Axel Polleres:
Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications.
TPLP 6(1-2): 23-60 (2006) |
| 182 | | Thomas Eiter,
Georg Gottlob:
Reasoning under minimal upper bounds in propositional logic.
Theor. Comput. Sci. 369(1-3): 82-115 (2006) |
| 2005 |
|---|
| 181 | | Thomas Eiter,
Leonid Libkin:
Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings
Springer 2005 |
| 180 | | Chitta Baral,
Thomas Eiter,
Jicheng Zhao:
Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains.
AAAI 2005: 578-583 |
| 179 | | 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.
AAAI 2005: 695-700 |
| 178 | | Thomas Eiter,
Esra Erdem,
Michael Fink,
Ján Senko:
Updating Action Domain Descriptions.
IJCAI 2005: 418-423 |
| 177 | | Thomas Eiter,
Giovambattista Ianni,
Roman Schindlauer,
Hans Tompits:
A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming.
IJCAI 2005: 90-96 |
| 176 | | Thomas Eiter,
Hans Tompits,
Stefan Woltran:
On Solution Correspondences in Answer-Set Programming.
IJCAI 2005: 97-102 |
| 175 | | Thomas Eiter:
Data Integration and Answer Set Programming.
LPNMR 2005: 13-25 |
| 174 | | 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.
LPNMR 2005: 379-383 |
| 173 | | Thomas Eiter,
Michael Fink,
Ján Senko:
KMonitor - A Tool for Monitoring Plan Execution in Action Theories.
LPNMR 2005: 416-421 |
| 172 | | Thomas Eiter,
Wolfgang Faber,
Patrick Traxler:
Testing Strong Equivalence of Datalog Programs - Implementation and Examples.
LPNMR 2005: 437-441 |
| 171 | | Robert Baumgartner,
Thomas Eiter,
Georg Gottlob,
Marcus Herzog,
Christoph Koch:
Information Extraction for the Semantic Web.
Reasoning Web 2005: 275-289 |
| 170 | | Nicola Leone,
Thomas Eiter,
Wolfgang Faber,
Michael Fink,
Georg Gottlob,
Gianluigi Greco:
Boosting Information Integration: The INFOMIX System.
SEBD 2005: 55-66 |
| 169 | | 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.
SIGMOD Conference 2005: 915-917 |
| 168 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Complexity of propositional nested circumscription and nested abnormality theories.
ACM Trans. Comput. Log. 6(2): 232-272 (2005) |
| 167 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Reasoning about evolving nonmonotonic knowledge bases.
ACM Trans. Comput. Log. 6(2): 389-440 (2005) |
| 166 | | Thomas Eiter,
Axel Polleres:
Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications
CoRR abs/cs/0501084: (2005) |
| 165 | | Thomas Eiter,
Michael Fink,
Stefan Woltran:
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
CoRR abs/cs/0502078: (2005) |
| 164 | | Magdalena Ortiz,
Diego Calvanese,
Thomas Eiter,
Enrico Franconi:
Data complexity of answering conjunctive queries over SHIQ knowledge bases
CoRR abs/cs/0507059: (2005) |
| 163 | | Thomas Eiter,
Domenico Lembo:
Preface.
J. Applied Logic 3(1): 251-252 (2005) |
| 2004 |
|---|
| 162 | | Chitta Baral,
Thomas Eiter:
A Polynomial Time Algorithm for Constructing k-Maintainable Policies.
ICAPS 2004: 111-121 |
| 161 | | Thomas Eiter,
Thomas Lukasiewicz,
Roman Schindlauer,
Hans Tompits:
Combining Answer Set Programming with Description Logics for the Semantic Web.
KR 2004: 141-151 |
| 160 | | Thomas Eiter,
Wolfgang Faber,
Michael Fink,
Gerald Pfeifer,
Stefan Woltran:
Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming.
KR 2004: 377-387 |
| 159 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
On Eliminating Disjunctions in Stable Logic Programming.
KR 2004: 447-458 |
| 158 | | Chitta Baral,
Thomas Eiter:
A Polynomial-Time Algorithm for Constructing k-Maintainable Policies.
KR 2004: 720-730 |
| 157 | | Thomas Eiter,
Giovambattista Ianni,
Roman Schindlauer,
Hans Tompits:
Nonmonotonic Description Logic Programs: Implementation and Experiments.
LPAR 2004: 511-527 |
| 156 | | Thomas Eiter,
Axel Polleres:
Towards Automated Integration of Guess and Check Programs in Answer Set Programming.
LPNMR 2004: 100-113 |
| 155 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
Simplifying Logic Programs Under Uniform and Strong Equivalence.
LPNMR 2004: 87-99 |
| 154 | | Thomas Eiter,
Esra Erdem,
Wolfgang Faber:
Plan reversals for recovery in execution monitoring.
NMR 2004: 147-154 |
| 153 | | Thomas Eiter,
Thomas Lukasiewicz,
Roman Schindlauer,
Hans Tompits:
Well-Founded Semantics for Description Logic Programs in the Semantic Web.
RuleML 2004: 81-97 |
| 152 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
A logic programming approach to knowledge-state planning: Semantics and complexity.
ACM Trans. Comput. Log. 5(2): 206-263 (2004) |
| 151 | | Thomas Eiter,
Klaus-Dieter Schewe:
Preface.
Ann. Math. Artif. Intell. 40(1-2): 1-3 (2004) |
| 150 | | Thomas Eiter,
Thomas Lukasiewicz:
Complexity results for explanations in the structural-model approach.
Artif. Intell. 154(1-2): 145-198 (2004) |
| 2003 |
|---|
| 149 | | Thomas Eiter:
Abduction and the Dualization Problem.
ALT 2003: 1-2 |
| 148 | | Thomas Eiter,
Axel Polleres:
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation.
APPIA-GULP-PRODE 2003: 410-421 |
| 147 | | 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.
Answer Set Programming 2003 |
| 146 | | Thomas Eiter,
Michael Fink,
Hans Tompits,
Stefan Woltran:
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation.
Answer Set Programming 2003 |
| 145 | | Thomas Eiter,
Kazuhisa Makino:
Generating All Abductive Explanations for Queries on Propositional Horn Theories.
CSL 2003: 197-211 |
| 144 | | Thomas Eiter,
Kazuhisa Makino:
Abduction and the Dualization Problem.
Discovery Science 2003: 1-20 |
| 143 | | Thomas Eiter,
Michael Fink,
Gianluigi Greco,
Domenico Lembo:
Efficient Evaluation of Logic Programs for Querying Data Integration Systems.
ICLP 2003: 163-177 |
| 142 | | Thomas Eiter,
Michael Fink:
Uniform Equivalence of Logic Programs under the Stable Model Semantics.
ICLP 2003: 224-238 |
| 141 | | Jürgen Dix,
Thomas Eiter,
Michael Fink,
Axel Polleres,
Yingqian Zhang:
Monitoring Agents Using Declarative Planning.
KI 2003: 646-660 |
| 140 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Declarative Update Policies for Nonmonotonic Knowledge Bases.
Logics for Emerging Applications of Databases 2003: 85-129 |
| 139 | | Thomas Eiter,
Thomas Lukasiewicz:
Probabilistic Reasoning about Actions in Nonmonotonic Causal Theories.
UAI 2003: 192-199 |
| 138 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
A logic programming approach to knowledge-state planning, II: The DLVK system.
Artif. Intell. 144(1-2): 157-211 (2003) |
| 137 | | Jürgen Dix,
Thomas Eiter,
Michael Fink,
Axel Polleres,
Yingqian Zhang:
Monitoring Agents using Declarative Planning.
Fundam. Inform. 57(2-4): 345-370 (2003) |
| 136 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
Answer Set Planning Under Action Costs.
J. Artif. Intell. Res. (JAIR) 19: 25-71 (2003) |
| 135 | | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals.
SIAM J. Comput. 32(2): 514-537 (2003) |
| 134 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer:
Computing preferred answer sets by meta-interpretation in answer set programming.
TPLP 3(4-5): 463-498 (2003) |
| 2002 |
|---|
| 133 | | Thomas Eiter,
Klaus-Dieter Schewe:
Foundations of Information and Knowledge Systems, Second International Symposium, FoIKS 2002 Salzau Castle, Germany, February 20-23, 2002, Proceedings
Springer 2002 |
| 132 | | Thomas Eiter,
Kazuhisa Makino:
On Computing all Abductive Explanations.
AAAI/IAAI 2002: 62-67 |
| 131 | | Thomas Eiter,
Viviana Mascardi,
V. S. Subrahmanian:
Error-Tolerant Agents.
Computational Logic: Logic Programming and Beyond 2002: 586-625 |
| 130 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
Answer Set Planning under Action Costs.
JELIA 2002: 186-197 |
| 129 | | 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.
JELIA 2002: 537-540 |
| 128 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
The DLVK Planning System: Progress Report.
JELIA 2002: 541-544 |
| 127 | | Thomas Eiter,
Georg Gottlob:
Hypergraph Transversal Computation and Related Problems in Logic and AI.
JELIA 2002: 549-564 |
| 126 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
A Generic Approach for Knowledge-Based Information-Site Selection.
KR 2002: 459-469 |
| 125 | | Thomas Eiter,
Thomas Lukasiewicz:
Complexity Results for Explanations in the Structural-Model Approach.
KR 2002: 49-60 |
| 124 | | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New results on monotone dualization and generating hypergraph transversals.
STOC 2002: 14-22 |
| 123 | | Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
TABLEAUX 2002: 100-114 |
| 122 | | Thomas Eiter,
Thomas Lukasiewicz:
Causes and Explanations in the Structural-Model Approach : Tractable Cases.
UAI 2002: 146-153 |
| 121 | | Thomas Eiter,
Viviana Mascardi:
Comparing environments for developing software agents.
AI Commun. 15(4): 169-197 (2002) |
| 120 | | Thomas Eiter,
Thomas Lukasiewicz:
Complexity results for structure-based causality.
Artif. Intell. 142(1): 53-89 (2002) |
| 119 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Complexity of Nested Circumscription and Nested Abnormality Theories
CoRR cs.AI/0207072: (2002) |
| 118 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Reasoning about Evolving Nonmonotonic Knowledge Bases
CoRR cs.AI/0209019: (2002) |
| 117 | | Nicola Leone,
Gerald Pfeifer,
Wolfgang Faber,
Thomas Eiter,
Georg Gottlob,
Simona Perri,
Francesco Scarcello:
The DLV System for Knowledge Representation and Reasoning
CoRR cs.AI/0211004: (2002) |
| 116 | | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals
CoRR cs.DS/0204009: (2002) |
| 115 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer:
Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming
CoRR cs.LO/0201013: (2002) |
| 114 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Recognition and dualization of disguised bidual Horn functions.
Inf. Process. Lett. 82(6): 283-291 (2002) |
| 113 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Using Methods of Declarative Logic Programming for Intelligent Information Agents.
TPLP 2(6): 645-709 (2002) |
| 112 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
On Properties of Update Sequences Based on Causal Rejection.
TPLP 2(6): 711-767 (2002) |
| 111 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Decision lists and related Boolean functions.
Theor. Comput. Sci. 270(1-2): 493-524 (2002) |
| 110 | | Thomas Eiter,
Helmut Veith:
On the complexity of data disjunctions.
Theor. Comput. Sci. 288(1): 101-128 (2002) |
| 2001 |
|---|
| 109 | | Thomas Eiter,
Wolfgang Faber,
Miroslaw Truszczynski:
Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings
Springer 2001 |
| 108 | | Franz Baader,
Gerhard Brewka,
Thomas Eiter:
KI 2001: Advances in Artificial Intelligence, Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001, Proceedings
Springer 2001 |
| 107 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer:
Computing Preferred and Weakly Preferred Answer Sets by Meta Interpretation in Answer Set Programming.
Answer Set Programming 2001 |
| 106 | | Uwe Egly,
Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Answer Set Programming 2001 |
| 105 | | Thomas Eiter,
Daniel Veit,
Jörg P. Müller,
Martin Schneider II:
Matchmaking for Structured Objects.
DaWaK 2001: 186-194 |
| 104 | | Thomas Eiter,
Georg Gottlob,
Thomas Schwentick:
Second-Order Logic over Strings: Regular and Non-regular Fragments.
Developments in Language Theory 2001: 37-56 |
| 103 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Complexity of Nested Circumscription and Abnormality Theories.
IJCAI 2001: 169-174 |
| 102 | | Thomas Eiter,
Thomas Lukasiewicz:
Complexity Results for Structure-Based Causality.
IJCAI 2001: 35-42 |
| 101 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
A Framework for Declarative Update Specifications in Logic Programs.
IJCAI 2001: 649-654 |
| 100 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Reasoning about Evolving Nonmonotonic Knowledge Bases.
LPAR 2001: 407-421 |
| 99 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
An Update Front-End for Extended Logic Programs.
LPNMR 2001: 397-401 |
| 98 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
System Description: The DLVK Planning System.
LPNMR 2001: 429-433 |
| 97 | | Evgeny Dantsin,
Thomas Eiter,
Georg Gottlob,
Andrei Voronkov:
Complexity and expressive power of logic programming.
ACM Comput. Surv. 33(3): 374-425 (2001) |
| 96 | | Thomas Eiter,
James J. Lu,
Thomas Lukasiewicz,
V. S. Subrahmanian:
Probabilistic object bases.
ACM Trans. Database Syst. 26(3): 264-312 (2001) |
| 95 | | Thomas Eiter,
Thomas Lukasiewicz,
Michael Walter:
A data model and algebra for probabilistic complex values.
Ann. Math. Artif. Intell. 33(2-4): 205-252 (2001) |
| 94 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
On Properties of Update Sequences Based on Causal Rejection
CoRR cs.AI/0109006: (2001) |
| 93 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity
CoRR cs.AI/0112006: (2001) |
| 92 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Using Methods of Declarative Logic Programming for Intelligent Information Agents
CoRR cs.MA/0108008: (2001) |
| 91 | | Francesco Buccafurri,
Thomas Eiter,
Georg Gottlob,
Nicola Leone:
On ACTL Formulas Having Linear Counterexamples.
J. Comput. Syst. Sci. 62(3): 463-515 (2001) |
| 90 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores.
SIAM J. Comput. 31(1): 269-288 (2001) |
| 2000 |
|---|
| 89 | | V. S. Subrahmanian,
Piero A. Bonatti,
Jürgen Dix,
Thomas Eiter,
Sarit Kraus,
Fatma Ozcan,
Robert B. Ross:
Heterogenous Active Agents
MIT Press 2000 |
| 88 | | Uwe Egly,
Thomas Eiter,
Volker Klotz,
Hans Tompits,
Stefan Woltran:
Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.
15. WLP 2000: 113-122 |
| 87 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.
AAAI/IAAI 2000: 417-422 |
| 86 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
Planning under Incomplete Knowledge.
Computational Logic 2000: 807-821 |
| 85 | | Thomas Eiter,
Thomas Lukasiewicz,
Michael Walter:
Extension of the Relational Algebra to Probabilistic Complex Values.
FoIKS 2000: 94-115 |
| 84 | | Gerhard Brewka,
Thomas Eiter:
Prioritizing Default Logic.
Intellectics and Computational Logic 2000: 27-45 |
| 83 | | Thomas Eiter,
Michael Fink,
Giuliana Sabbatini,
Hans Tompits:
Considerations on Updates of Logic Programs.
JELIA 2000: 2-20 |
| 82 | | Thomas Eiter,
Thomas Lukasiewicz:
New Tractable Cases in Default Reasoning from Conditional Knowledge Bases.
JELIA 2000: 313-328 |
| 81 | | Thomas Eiter,
Thomas Lukasiewicz:
Complexity Results for Default Reasoning from Conditional Knowledge Bases.
KR 2000: 62-73 |
| 80 | | Thomas Eiter,
Georg Gottlob:
On the Complexity of Theory Curbing.
LPAR 2000: 1-19 |
| 79 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer,
Axel Polleres:
Using the dlv System for Planning and Diagnostic Reasoning.
WLP 2000: 125-134 |
| 78 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
Implementing Default Reasoning Using Quantified Boolean Formulae.
WLP 2000: 223-228 |
| 77 | | Thomas Eiter,
V. S. Subrahmanian,
Timothy J. Rogers:
Heterogeneous active agents, III: Polynomially implementable agents.
Artif. Intell. 117(1): 107-167 (2000) |
| 76 | | Thomas Eiter,
Thomas Lukasiewicz:
Default reasoning from conditional knowledge bases: Complexity and tractable cases.
Artif. Intell. 124(2): 169-241 (2000) |
| 75 | | Thomas Eiter,
Wolfgang Faber,
Christoph Koch,
Nicola Leone,
Gerald Pfeifer:
DLV - A System for Declarative Problem Solving
CoRR cs.AI/0003036: (2000) |
| 74 | | Uwe Egly,
Thomas Eiter,
Hans Tompits,
Stefan Woltran:
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
CoRR cs.AI/0003037: (2000) |
| 73 | | Thomas Eiter,
Yuri Gurevich,
Georg Gottlob:
Existential second-order logic over strings.
J. ACM 47(1): 77-131 (2000) |
| 72 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On the Difference of Horn Theories.
J. Comput. Syst. Sci. 61(3): 478-507 (2000) |
| 1999 |
|---|
| 71 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On the Difference of Horn Theories.
STACS 1999: 467-477 |
| 70 | | Thomas Eiter,
Wolfgang Faber,
Nicola Leone,
Gerald Pfeifer:
The Diagnosis Frontend of the dlv System.
AI Commun. 12(1-2): 99-111 (1999) |
| 69 | | Thomas Eiter,
V. S. Subrahmanian,
George Pick:
Heterogeneous Active Agents, I: Semantics.
Artif. Intell. 108(1-2): 179-255 (1999) |
| 68 | | Thomas Eiter,
V. S. Subrahmanian:
Heterogeneous Active Agents, II: Algorithms and Complexity.
Artif. Intell. 108(1-2): 257-307 (1999) |
| 67 | | Gerhard Brewka,
Thomas Eiter:
Preferred Answer Sets for Extended Logic Programs.
Artif. Intell. 109(1-2): 297-356 (1999) |
| 66 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models.
Artif. Intell. 110(1): 57-101 (1999) |
| 65 | | Francesco Buccafurri,
Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Enhancing Model Checking in Verification by AI Techniques.
Artif. Intell. 112(1-2): 57-104 (1999) |
| 64 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Bidual Horn Functions and Extensions.
Discrete Applied Mathematics 96-97: 55-88 (1999) |
| 1998 |
|---|
| 63 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models.
AAAI/IAAI 1998: 292-297 |
| 62 | | Thomas Eiter,
V. S. Subrahmanian:
Deontic Action Programs.
FMLDO 1998: 37-54 |
| 61 | | Thomas Eiter,
Nicola Leone,
Cristinel Mateis,
Gerald Pfeifer,
Francesco Scarcello:
Progress Report on the Disjunctive Deductive Database System dlv.
FQAS 1998: 148-163 |
| 60 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores.
ISAAC 1998: 49-58 |
| 59 | | Thomas Eiter,
Nicola Leone,
Cristinel Mateis,
Gerald Pfeifer,
Francesco Scarcello:
The KR System dlv: Progress Report, Comparisons and Benchmarks.
KR 1998: 406-417 |
| 58 | | Gerhard Brewka,
Thomas Eiter:
Preferred Answer Sets for Extended Logic Programs.
KR 1998: 86-97 |
| 57 | | Thomas Eiter,
Georg Gottlob,
Yuri Gurevich:
Existential Second-Order Logic over Strings.
LICS 1998: 16-27 |
| 56 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On Disguised Double Horn Functions and Extensions.
STACS 1998: 50-60 |
| 55 | | Thomas Eiter,
James J. Lu,
V. S. Subrahmanian:
A First-Order Representation of Stable Models.
AI Commun. 11(1): 53-73 (1998) |
| 54 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Double Horn Functions.
Inf. Comput. 144(2): 155-190 (1998) |
| 53 | | Thomas Eiter,
Georg Gottlob:
On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic.
J. Symb. Log. 63(1): 73-82 (1998) |
| 52 | | Thomas Eiter,
Nicola Leone,
Domenico Saccà:
Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases.
Theor. Comput. Sci. 206(1-2): 181-218 (1998) |
| 1997 |
|---|
| 51 | | Thomas Eiter,
Nicola Leone,
Cristinel Mateis,
Gerald Pfeifer,
Francesco Scarcello:
The Architecture of a Disjunctive Deductive Database System.
APPIA-GULP-PRODE 1997: 141-152 |
| 50 | | Thomas Eiter,
Georg Gottlob,
Helmut Veith:
Generalized Quantifiers in Logic Programs.
ESSLLI 1997: 72-98 |
| 49 | | Thomas Eiter,
Georg Gottlob:
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic.
FCT 1997: 1-18 |
| 48 | | Evgeny Dantsin,
Thomas Eiter,
Georg Gottlob,
Andrei Voronkov:
Complexity and Expressive Power of Logic Programming.
IEEE Conference on Computational Complexity 1997: 82-101 |
| 47 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Two-Face Horn Extensions.
ISAAC 1997: 112-121 |
| 46 | | Thomas Eiter,
James J. Lu,
V. S. Subrahmanian:
Computing Non-Ground Representations of Stable Models.
LPNMR 1997: 198-217 |
| 45 | | Thomas Eiter,
Georg Gottlob,
Helmut Veith:
Modular Logic Programming and Generalized Quantifiers.
LPNMR 1997: 290-309 |
| 44 | | Thomas Eiter,
Nicola Leone,
Cristinel Mateis,
Gerald Pfeifer,
Francesco Scarcello:
A Deductive System for Non-Monotonic Reasoning.
LPNMR 1997: 364-375 |
| 43 | | 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).
WLP 1997: 0- |
| 42 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Disjunctive Datalog.
ACM Trans. Database Syst. 22(3): 364-418 (1997) |
| 41 | | Thomas Eiter,
Heikki Mannila:
Distance Measures for Point Sets and their Computation.
Acta Inf. 34(2): 109-133 (1997) |
| 40 | | Thomas Eiter,
Nicola Leone,
Domenico Saccà:
On the Partial Semantics for Disjunctive Deductive Databases.
Ann. Math. Artif. Intell. 19(1-2): 59-96 (1997) |
| 39 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Semantics and Complexity of Abduction from Default Theories.
Artif. Intell. 90(1-2): 177-223 (1997) |
| 38 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Default Logic as a Query Language.
IEEE Trans. Knowl. Data Eng. 9(3): 448-463 (1997) |
| 37 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
On the Indiscernibility of Individuals in Logic Programming.
J. Log. Comput. 7(6): 805-824 (1997) |
| 36 | | Thomas Eiter,
Georg Gottlob:
Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions.
J. Log. Program. 33(2): 167-178 (1997) |
| 35 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Abduction from Logic Programs: Semantics and Complexity.
Theor. Comput. Sci. 189(1-2): 129-177 (1997) |
| 1996 |
|---|
| 34 | | Thomas Eiter,
Nicola Leone,
Domenico Saccà:
Unfounded Sets and Partial Stable Models for Disjuntive Deductive Databases.
APPIA-GULP-PRODE 1996: 271-282 |
| 33 | | Thomas Eiter,
Nicola Leone,
Domenico Saccà:
Partial Semantics for Disjunctive Deductive Databases.
DEXA 1996: 564-573 |
| 32 | | Thomas Eiter,
Nicola Leone,
Domenico Saccà:
The Expressive Power of Partial Models in Disjunctive Deductive Databases.
Logic in Databases 1996: 245-264 |
| 31 | | Thomas Eiter,
Georg Gottlob,
Yuri Gurevich:
Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems.
Ann. Pure Appl. Logic 78(1-3): 111-125 (1996) |
| 30 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
J. Comput. Syst. Sci. 53(3): 497-512 (1996) |
| 29 | | Thomas Eiter,
Georg Gottlob:
Mächtigkeit von Logikprogrammierung über Datenbanken.
KI 10(3): 32-39 (1996) |
| 28 | | Piero A. Bonatti,
Thomas Eiter:
Querying Disjunctive Databases Through Nonmonotonic Logics.
Theor. Comput. Sci. 160(1&2): 321-363 (1996) |
| 1995 |
|---|
| 27 | | Piero A. Bonatti,
Thomas Eiter:
Querying Disjunctive Database Through Nonmonotonic Logics.
ICDT 1995: 68-81 |
| 26 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Semantics and Complexity of Abduction from Default Theories.
IJCAI (1) 1995: 870-877 |
| 25 | | Thomas Eiter,
Georg Gottlob,
Nicola Leone:
Complexity Results for Abductive Logic Programming.
LPNMR 1995: 1-14 |
| 24 | | Thomas Eiter,
Nicola Leone:
On Modularity Properties of Partial Semantics for Disjunctive Logic Programs.
WLP 1995: 217-226 |
| 23 | | Thomas Eiter:
Generating Boolean mu-Expressions
Acta Inf. 32(2): 171-187 (1995) |
| 22 | | Thomas Eiter,
Georg Gottlob:
On the Computational Cost of Disjunctive Logic Programming: Propositional Case.
Ann. Math. Artif. Intell. 15(3-4): 289-323 (1995) |
| 21 | | Thomas Eiter,
Pekka Kilpeläinen,
Heikki Mannila:
Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete.
Discrete Applied Mathematics 59(1): 23-31 (1995) |
| 20 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Logic-Based Abduction.
J. ACM 42(1): 3-42 (1995) |
| 19 | | Thomas Eiter,
Georg Gottlob:
Identifying the Minimal Transversals of a Hypergraph and Related Problems.
SIAM J. Comput. 24(6): 1278-1304 (1995) |
| 1994 |
|---|
| 18 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Disjunctive Logic Programming over Finite Structures.
GI Jahrestagung 1994: 69-73 |
| 17 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics.
IS/KI 1994: 83-103 |
| 16 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
Default Logic as a Query Language.
KR 1994: 99-108 |
| 15 | | Thomas Eiter,
Georg Gottlob,
Heikki Mannila:
Adding Disjunction to Datalog.
PODS 1994: 267-278 |
| 14 | | Thomas Eiter:
Exact Transversal Hypergraphs and Application to Boolean µ-Functions.
J. Symb. Comput. 17(3): 215-225 (1994) |
| 1993 |
|---|
| 13 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions.
IJCAI 1993: 526-533 |
| 12 | | Thomas Eiter,
Georg Gottlob,
Yuri Gurevich:
Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information.
IJCAI 1993: 634-639 |
| 11 | | Thomas Eiter,
Georg Gottlob:
Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics.
ILPS 1993: 266-278 |
| 10 | | Thomas Eiter,
Georg Gottlob:
Complexity Aspects of Various Semantics for Disjunctive Databases.
PODS 1993: 158-167 |
| 9 | | Thomas Eiter,
Georg Gottlob:
The Complexity of Logic-Based Abduction.
STACS 1993: 70-79 |
| 8 | | Thomas Eiter,
Georg Gottlob:
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete.
Theor. Comput. Sci. 114(2): 231-245 (1993) |
| 1992 |
|---|
| 7 | | Thomas Eiter,
Georg Gottlob:
Complexity of Propositional Knowledge Base Revision.
CNKBS 1992: 38-40 |
| 6 | | Thomas Eiter,
Georg Gottlob:
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
PODS 1992: 261-273 |
| 5 | | Thomas Eiter,
Georg Gottlob:
Complexity Results for Logic-Based Abduction.
Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 29-44 |
| 4 | | Marco Cadoli,
Thomas Eiter,
Georg Gottlob:
An Efficient Method for Eliminating Varying Predicates from a Circumscription.
Artif. Intell. 54(2): 397-410 (1992) |
| 3 | | Thomas Eiter,
Georg Gottlob:
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals.
Artif. Intell. 57(2-3): 227-270 (1992) |
| 2 | | Thomas Eiter,
Georg Gottlob:
Reasoning with parsimonious and moderately grounded expansions.
Fundam. Inform. 17(1-2): 31-53 (1992) |
| 1991 |
|---|
| 1 | | Thomas Eiter,
Michael Schrefl,
Markus Stumptner:
Sperrverfahren für B-Bäume im Vergleich.
Informatik Spektrum 14(4): 183-200 (1991) |
