Thomas Eiter

From Tetherless World Wiki

Thomas Eiter [ Edit ]
Photo:
Name:	Thomas Eiter
Occupation:
Affiliation(s):
Homepage(s):
Email(s):
Phone:
Fax:
Interests:
Other tags:
Alias:
	Please also add"{{alias}}" to your alias pages.

Publication

Update publication from DBLP

1. Magdalena Ortiz, Diego Calvanese, Thomas Eiter. Data Complexity of Query Answering in Expressive Description Logics via Tableaux, In J. Autom. Reasoning, 41(1):61-98, 2008 .
   
2. Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits. Combining answer set programming with description logics for the Semantic Web, In Artif. Intell., 172(12-13):1495-1539, 2008 .
   
3. Diego Calvanese, Thomas Eiter, Magdalena Ortiz. Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach, In AAAI, pp. 391-396, 2007 (Download) .
   
4. Thomas Eiter, Esra Erdem, Wolfgang Faber. On Reversing Actions: Algorithms and Complexity, In IJCAI, pp. 336-341, 2007 (Download) .
   
5. Gerhard Brewka, Thomas Eiter. Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems, In AAAI, pp. 385-390, 2007 (Download) .
   
6. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. Complexity Results for Checking Equivalence of Stratified Logic Programs, In IJCAI, pp. 330-335, 2007 (Download) .
   
7. Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits. Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination, In IJCAI, pp. 304-309, 2007 (Download) .
   
8. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang. Forgetting in Managing Rules and Ontologies, In Web Intelligence, pp. 411-419, 2006 .
   
9. Thomas Eiter, Kewen Wang. Forgetting and Conflict Resolving in Disjunctive Logic Programming, In AAAI, , 2006 (Download) .
   
10. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits. Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning, In ESWC, pp. 273-287, 2006 (Download) .
    
11. Magdalena Ortiz, Diego Calvanese, Thomas Eiter. Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics, In AAAI, , 2006 (Download) .
    
12. Chitta Baral, Thomas Eiter, Jicheng Zhao. Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains, In AAAI, pp. 578-583, 2005 (Download) .
    
13. 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, In SIGMOD Conference, pp. 915-917, 2005 (Download) .
    
14. Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko. Updating Action Domain Descriptions, In IJCAI, pp. 418-423, 2005 (Download) .
    
15. Magdalena Ortiz, Diego Calvanese, Thomas Eiter, Enrico Franconi. Data complexity of answering conjunctive queries over SHIQ knowledge bases, In CoRR, abs/cs/0507059, 2005 .
    
16. Thomas Eiter, Hans Tompits, Stefan Woltran. On Solution Correspondences in Answer-Set Programming, In IJCAI, pp. 97-102, 2005 (Download) .
    
17. Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits. A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming, In IJCAI, pp. 90-96, 2005 (Download) .
    
18. 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, In LPNMR, pp. 379-383, 2005 .
    
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, In AAAI, pp. 695-700, 2005 (Download) .
    
20. 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, In Answer Set Programming, , 2003 .
    
21. Thomas Eiter, Kazuhisa Makino. On Computing all Abductive Explanations, In AAAI/IAAI, pp. 62-67, 2002 (Download) .
    
22. Marco Cadoli, Thomas Eiter, Georg Gottlob. Complexity of Nested Circumscription and Abnormality Theories, In IJCAI, pp. 169-174, 2001 (Download) .
    
23. Thomas Eiter, Thomas Lukasiewicz. Complexity Results for Structure-Based Causality, In IJCAI, pp. 35-42, 2001 (Download) .
    
24. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits. A Framework for Declarative Update Specifications in Logic Programs, In IJCAI, pp. 649-654, 2001 (Download) .
    
25. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas, In AAAI/IAAI, pp. 417-422, 2000 (Download) .
    
26. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino. Computing Intersections of Horn Theories for Reasoning with Models, In AAAI/IAAI, pp. 292-297, 1998 (Download) .
    
27. Thomas Eiter, Georg Gottlob, Nicola Leone. Semantics and Complexity of Abduction from Default Theories, In IJCAI (1), pp. 870-877, 1995 (Download) .
    
28. Thomas Eiter, Georg Gottlob. The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions, In IJCAI, pp. 526-533, 1993 (Download) .
    
29. Thomas Eiter, Georg Gottlob, Yuri Gurevich. Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information, In IJCAI, pp. 634-639, 1993 (Download) .
    

External Links

More information on Google, and DBLP