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