| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Thomas Eiter Thomas Eiter, Giovambattista Ianni , Roman Schindlauer , Hans Tompits : Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. ESWC 2006 : 273-287 Thomas Eiter, Michael Fink , Hans Tompits , Patrick Traxler , Stefan Woltran : Replacements in Non-Ground Answer-Set Programming. KR 2006 : 340-351 Thomas Eiter, Michael Fink , Hans Tompits , Patrick Traxler , Stefan Woltran : Replacements in Non-Ground Answer-Set Programming. WLP 2006 : 145-153 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 Thomas Eiter, Leonid Libkin : Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings Springer 2005 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 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 Thomas Eiter, Esra Erdem , Michael Fink , Ján Senko : Updating Action Domain Descriptions. IJCAI 2005 : 418-423 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 Thomas Eiter, Hans Tompits , Stefan Woltran : On Solution Correspondences in Answer-Set Programming. IJCAI 2005 : 97-102 Thomas Eiter: Data Integration and Answer Set Programming. LPNMR 2005 : 13-25 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 Thomas Eiter, Michael Fink , Ján Senko : KMonitor - A Tool for Monitoring Plan Execution in Action Theories. LPNMR 2005 : 416-421 Thomas Eiter, Wolfgang Faber , Patrick Traxler : Testing Strong Equivalence of Datalog Programs - Implementation and Examples. LPNMR 2005 : 437-441 Robert Baumgartner , Thomas Eiter, Georg Gottlob , Marcus Herzog , Christoph Koch : Information Extraction for the Semantic Web. Reasoning Web 2005 : 275-289 Nicola Leone , Thomas Eiter, Wolfgang Faber , Michael Fink , Georg Gottlob , Gianluigi Greco : Boosting Information Integration: The INFOMIX System. SEBD 2005 : 55-66 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 Marco Cadoli , Thomas Eiter, Georg Gottlob : Complexity of propositional nested circumscription and nested abnormality theories. ACM Trans. Comput. Log. 6 (2): 232-272 (2005) Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Reasoning about evolving nonmonotonic knowledge bases. ACM Trans. Comput. Log. 6 (2): 389-440 (2005) Thomas Eiter, Domenico Lembo : Preface. J. Applied Logic 3 (1): 251-252 (2005) Chitta Baral , Thomas Eiter: A Polynomial Time Algorithm for Constructing k-Maintainable Policies. ICAPS 2004 : 111-121 Thomas Eiter, Thomas Lukasiewicz , Roman Schindlauer , Hans Tompits : Combining Answer Set Programming with Description Logics for the Semantic Web. KR 2004 : 141-151 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 Thomas Eiter, Michael Fink , Hans Tompits , Stefan Woltran : On Eliminating Disjunctions in Stable Logic Programming. KR 2004 : 447-458 Chitta Baral , Thomas Eiter: A Polynomial-Time Algorithm for Constructing k-Maintainable Policies. KR 2004 : 720-730 Thomas Eiter, Giovambattista Ianni , Roman Schindlauer , Hans Tompits : Nonmonotonic Description Logic Programs: Implementation and Experiments. LPAR 2004 : 511-527 Thomas Eiter, Axel Polleres : Towards Automated Integration of Guess and Check Programs in Answer Set Programming. LPNMR 2004 : 100-113 Thomas Eiter, Michael Fink , Hans Tompits , Stefan Woltran : Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004 : 87-99 Thomas Eiter, Esra Erdem , Wolfgang Faber : Plan reversals for recovery in execution monitoring. NMR 2004 : 147-154 Thomas Eiter, Thomas Lukasiewicz , Roman Schindlauer , Hans Tompits : Well-Founded Semantics for Description Logic Programs in the Semantic Web. RuleML 2004 : 81-97 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) Thomas Eiter, Klaus-Dieter Schewe : Preface. Ann. Math. Artif. Intell. 40 (1-2): 1-3 (2004) Thomas Eiter, Thomas Lukasiewicz : Complexity results for explanations in the structural-model approach. Artif. Intell. 154 (1-2): 145-198 (2004) Thomas Eiter: Abduction and the Dualization Problem. ALT 2003 : 1-2 Thomas Eiter, Axel Polleres : Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation. APPIA-GULP-PRODE 2003 : 410-421 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 Thomas Eiter, Michael Fink , Hans Tompits , Stefan Woltran : Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003 Thomas Eiter, Kazuhisa Makino : Generating All Abductive Explanations for Queries on Propositional Horn Theories. CSL 2003 : 197-211 Thomas Eiter, Kazuhisa Makino : Abduction and the Dualization Problem. Discovery Science 2003 : 1-20 Thomas Eiter, Michael Fink , Gianluigi Greco , Domenico Lembo : Efficient Evaluation of Logic Programs for Querying Data Integration Systems. ICLP 2003 : 163-177 Thomas Eiter, Michael Fink : Uniform Equivalence of Logic Programs under the Stable Model Semantics. ICLP 2003 : 224-238 Jürgen Dix , Thomas Eiter, Michael Fink , Axel Polleres , Yingqian Zhang : Monitoring Agents Using Declarative Planning. KI 2003 : 646-660 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Declarative Update Policies for Nonmonotonic Knowledge Bases. Logics for Emerging Applications of Databases 2003 : 85-129 Thomas Eiter, Thomas Lukasiewicz : Probabilistic Reasoning about Actions in Nonmonotonic Causal Theories. UAI 2003 : 192-199 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : A logic programming approach to knowledge-state planning, II: The DLV K system. Artif. Intell. 144 (1-2): 157-211 (2003) Jürgen Dix , Thomas Eiter, Michael Fink , Axel Polleres , Yingqian Zhang : Monitoring Agents using Declarative Planning. Fundam. Inform. 57 (2-4): 345-370 (2003) 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) Thomas Eiter, Georg Gottlob , Kazuhisa Makino : New Results on Monotone Dualization and Generating Hypergraph Transversals. SIAM J. Comput. 32 (2): 514-537 (2003) 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) 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 Thomas Eiter, Kazuhisa Makino : On Computing all Abductive Explanations. AAAI/IAAI 2002 : 62-67 Thomas Eiter, Viviana Mascardi , V. S. Subrahmanian : Error-Tolerant Agents. Computational Logic: Logic Programming and Beyond 2002 : 586-625 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : Answer Set Planning under Action Costs. JELIA 2002 : 186-197 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 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : The DLV K Planning System: Progress Report. JELIA 2002 : 541-544 Thomas Eiter, Georg Gottlob : Hypergraph Transversal Computation and Related Problems in Logic and AI. JELIA 2002 : 549-564 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : A Generic Approach for Knowledge-Based Information-Site Selection. KR 2002 : 459-469 Thomas Eiter, Thomas Lukasiewicz : Complexity Results for Explanations in the Structural-Model Approach. KR 2002 : 49-60 Thomas Eiter, Georg Gottlob , Kazuhisa Makino : New results on monotone dualization and generating hypergraph transversals. STOC 2002 : 14-22 Thomas Eiter, Volker Klotz , Hans Tompits , Stefan Woltran : Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002 : 100-114 Thomas Eiter, Thomas Lukasiewicz : Causes and Explanations in the Structural-Model Approach : Tractable Cases. UAI 2002 : 146-153 Thomas Eiter, Viviana Mascardi : Comparing environments for developing software agents. AI Commun. 15 (4): 169-197 (2002) Thomas Eiter, Thomas Lukasiewicz : Complexity results for structure-based causality. Artif. Intell. 142 (1): 53-89 (2002) Marco Cadoli , Thomas Eiter, Georg Gottlob : Complexity of Nested Circumscription and Nested Abnormality Theories CoRR cs.AI/0207072 : (2002) Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Reasoning about Evolving Nonmonotonic Knowledge Bases CoRR cs.AI/0209019 : (2002) 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) Thomas Eiter, Georg Gottlob , Kazuhisa Makino : New Results on Monotone Dualization and Generating Hypergraph Transversals CoRR cs.DS/0204009 : (2002) Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer : Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming CoRR cs.LO/0201013 : (2002) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Recognition and dualization of disguised bidual Horn functions. Inf. Process. Lett. 82 (6): 283-291 (2002) Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Using Methods of Declarative Logic Programming for Intelligent Information Agents. TPLP 2 (6): 645-709 (2002) Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : On Properties of Update Sequences Based on Causal Rejection. TPLP 2 (6): 711-767 (2002) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Decision lists and related Boolean functions. Theor. Comput. Sci. 270 (1-2): 493-524 (2002) Thomas Eiter, Helmut Veith : On the complexity of data disjunctions. Theor. Comput. Sci. 288 (1): 101-128 (2002) 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 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 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 Uwe Egly , Thomas Eiter, Volker Klotz , Hans Tompits , Stefan Woltran : Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001 Thomas Eiter, Daniel Veit , Jörg P. Müller , Martin Schneider II : Matchmaking for Structured Objects. DaWaK 2001 : 186-194 Thomas Eiter, Georg Gottlob , Thomas Schwentick : Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001 : 37-56 Marco Cadoli , Thomas Eiter, Georg Gottlob : Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001 : 169-174 Thomas Eiter, Thomas Lukasiewicz : Complexity Results for Structure-Based Causality. IJCAI 2001 : 35-42 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : A Framework for Declarative Update Specifications in Logic Programs. IJCAI 2001 : 649-654 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Reasoning about Evolving Nonmonotonic Knowledge Bases. LPAR 2001 : 407-421 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : An Update Front-End for Extended Logic Programs. LPNMR 2001 : 397-401 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : System Description: The DLV K Planning System. LPNMR 2001 : 429-433 Evgeny Dantsin , Thomas Eiter, Georg Gottlob , Andrei Voronkov : Complexity and expressive power of logic programming. ACM Comput. Surv. 33 (3): 374-425 (2001) Thomas Eiter, James J. Lu , Thomas Lukasiewicz , V. S. Subrahmanian : Probabilistic object bases. ACM Trans. Database Syst. 26 (3): 264-312 (2001) 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) Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : On Properties of Update Sequences Based on Causal Rejection CoRR cs.AI/0109006 : (2001) 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) Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Using Methods of Declarative Logic Programming for Intelligent Information Agents CoRR cs.MA/0108008 : (2001) Francesco Buccafurri , Thomas Eiter, Georg Gottlob , Nicola Leone : On ACTL Formulas Having Linear Counterexamples. J. Comput. Syst. Sci. 62 (3): 463-515 (2001) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Disjunctions of Horn Theories and Their Cores. SIAM J. Comput. 31 (1): 269-288 (2001) V. S. Subrahmanian , Piero A. Bonatti , Jürgen Dix , Thomas Eiter, Sarit Kraus , Fatma Ozcan , Robert Ross : Heterogenous Active Agents MIT Press 2000 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 Uwe Egly , Thomas Eiter, Hans Tompits , Stefan Woltran : Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000 : 417-422 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : Planning under Incomplete Knowledge. Computational Logic 2000 : 807-821 Thomas Eiter, Thomas Lukasiewicz , Michael Walter : Extension of the Relational Algebra to Probabilistic Complex Values. FoIKS 2000 : 94-115 Gerhard Brewka , Thomas Eiter: Prioritizing Default Logic. Intellectics and Computational Logic 2000 : 27-45 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Considerations on Updates of Logic Programs. JELIA 2000 : 2-20 Thomas Eiter, Thomas Lukasiewicz : New Tractable Cases in Default Reasoning from Conditional Knowledge Bases. JELIA 2000 : 313-328 Thomas Eiter, Thomas Lukasiewicz : Complexity Results for Default Reasoning from Conditional Knowledge Bases. KR 2000 : 62-73 Thomas Eiter, Georg Gottlob : On the Complexity of Theory Curbing. LPAR 2000 : 1-19 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : Using the dlv System for Planning and Diagnostic Reasoning. WLP 2000 : 125-134 Uwe Egly , Thomas Eiter, Hans Tompits , Stefan Woltran : Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000 : 223-228 Thomas Eiter, V. S. Subrahmanian , Timothy J. Rogers : Heterogeneous active agents, III: Polynomially implementable agents. Artif. Intell. 117 (1): 107-167 (2000) Thomas Eiter, Thomas Lukasiewicz : Default reasoning from conditional knowledge bases: Complexity and tractable cases. Artif. Intell. 124 (2): 169-241 (2000) Thomas Eiter, Wolfgang Faber , Christoph Koch , Nicola Leone , Gerald Pfeifer : DLV - A System for Declarative Problem Solving CoRR cs.AI/0003036 : (2000) Uwe Egly , Thomas Eiter, Hans Tompits , Stefan Woltran : QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks CoRR cs.AI/0003037 : (2000) Thomas Eiter, Yuri Gurevich , Georg Gottlob : Existential second-order logic over strings. J. ACM 47 (1): 77-131 (2000) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : On the Difference of Horn Theories. J. Comput. Syst. Sci. 61 (3): 478-507 (2000) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : On the Difference of Horn Theories. STACS 1999 : 467-477 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer : The Diagnosis Frontend of the dlv System. AI Commun. 12 (1-2): 99-111 (1999) Thomas Eiter, V. S. Subrahmanian , George Pick : Heterogeneous Active Agents, I: Semantics. Artif. Intell. 108 (1-2): 179-255 (1999) Thomas Eiter, V. S. Subrahmanian : Heterogeneous Active Agents, II: Algorithms and Complexity. Artif. Intell. 108 (1-2): 257-307 (1999) Gerhard Brewka , Thomas Eiter: Preferred Answer Sets for Extended Logic Programs. Artif. Intell. 109 (1-2): 297-356 (1999) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Computing Intersections of Horn Theories for Reasoning with Models. Artif. Intell. 110 (1): 57-101 (1999) Francesco Buccafurri , Thomas Eiter, Georg Gottlob , Nicola Leone : Enhancing Model Checking in Verification by AI Techniques. Artif. Intell. 112 (1-2): 57-104 (1999) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Bidual Horn Functions and Extensions. Discrete Applied Mathematics 96-97 : 55-88 (1999) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Computing Intersections of Horn Theories for Reasoning with Models. AAAI/IAAI 1998 : 292-297 Thomas Eiter, V. S. Subrahmanian : Deontic Action Programs. FMLDO 1998 : 37-54 Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : Progress Report on the Disjunctive Deductive Database System dlv . FQAS 1998 : 148-163 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Disjunctions of Horn Theories and Their Cores. ISAAC 1998 : 49-58 Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : The KR System dlv: Progress Report, Comparisons and Benchmarks. KR 1998 : 406-417 Gerhard Brewka , Thomas Eiter: Preferred Answer Sets for Extended Logic Programs. KR 1998 : 86-97 Thomas Eiter, Georg Gottlob , Yuri Gurevich : Existential Second-Order Logic over Strings. LICS 1998 : 16-27 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : On Disguised Double Horn Functions and Extensions. STACS 1998 : 50-60 Thomas Eiter, James J. Lu , V. S. Subrahmanian : A First-Order Representation of Stable Models. AI Commun. 11 (1): 53-73 (1998) Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Double Horn Functions. Inf. Comput. 144 (2): 155-190 (1998) Thomas Eiter, Georg Gottlob : On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic. J. Symb. Log. 63 (1): 73-82 (1998) 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) Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : The Architecture of a Disjunctive Deductive Database System. APPIA-GULP-PRODE 1997 : 141-152 Thomas Eiter, Georg Gottlob , Helmut Veith : Generalized Quantifiers in Logic Programs. ESSLLI 1997 : 72-98 Thomas Eiter, Georg Gottlob : The Complexity Class Theta 2 p : Recent Results and Applications in AI and Modal Logic. FCT 1997 : 1-18 Evgeny Dantsin , Thomas Eiter, Georg Gottlob , Andrei Voronkov : Complexity and Expressive Power of Logic Programming. IEEE Conference on Computational Complexity 1997 : 82-101 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Two-Face Horn Extensions. ISAAC 1997 : 112-121 Thomas Eiter, James J. Lu , V. S. Subrahmanian : Computing Non-Ground Representations of Stable Models. LPNMR 1997 : 198-217 Thomas Eiter, Georg Gottlob , Helmut Veith : Modular Logic Programming and Generalized Quantifiers. LPNMR 1997 : 290-309 Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : A Deductive System for Non-Monotonic Reasoning. LPNMR 1997 : 364-375 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- Thomas Eiter, Georg Gottlob , Heikki Mannila : Disjunctive Datalog. ACM Trans. Database Syst. 22 (3): 364-418 (1997) Thomas Eiter, Heikki Mannila : Distance Measures for Point Sets and their Computation. Acta Inf. 34 (2): 109-133 (1997) Thomas Eiter, Nicola Leone , Domenico Saccà : On the Partial Semantics for Disjunctive Deductive Databases. Ann. Math. Artif. Intell. 19 (1-2): 59-96 (1997) Thomas Eiter, Georg Gottlob , Nicola Leone : Semantics and Complexity of Abduction from Default Theories. Artif. Intell. 90 (1-2): 177-223 (1997) Marco Cadoli , Thomas Eiter, Georg Gottlob : Default Logic as a Query Language. IEEE Trans. Knowl. Data Eng. 9 (3): 448-463 (1997) Thomas Eiter, Georg Gottlob , Nicola Leone : On the Indiscernibility of Individuals in Logic Programming. J. Log. Comput. 7 (6): 805-824 (1997) Thomas Eiter, Georg Gottlob : Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions. J. Log. Program. 33 (2): 167-178 (1997) Thomas Eiter, Georg Gottlob , Nicola Leone : Abduction from Logic Programs: Semantics and Complexity. Theor. Comput. Sci. 189 (1-2): 129-177 (1997) Thomas Eiter, Nicola Leone , Domenico Saccà : Unfounded Sets and Partial Stable Models for Disjuntive Deductive Databases. APPIA-GULP-PRODE 1996 : 271-282 Thomas Eiter, Nicola Leone , Domenico Saccà : Partial Semantics for Disjunctive Deductive Databases. DEXA 1996 : 564-573 Thomas Eiter, Nicola Leone , Domenico Saccà : The Expressive Power of Partial Models in Disjunctive Deductive Databases. Logic in Databases 1996 : 245-264 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) Thomas Eiter, Georg Gottlob : The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. J. Comput. Syst. Sci. 53 (3): 497-512 (1996) Thomas Eiter, Georg Gottlob : Mächtigkeit von Logikprogrammierung über Datenbanken. KI 10 (3): 32-39 (1996) Piero A. Bonatti , Thomas Eiter: Querying Disjunctive Databases Through Nonmonotonic Logics. Theor. Comput. Sci. 160 (1&2): 321-363 (1996) Piero A. Bonatti , Thomas Eiter: Querying Disjunctive Database Through Nonmonotonic Logics. ICDT 1995 : 68-81 Thomas Eiter, Georg Gottlob , Nicola Leone : Semantics and Complexity of Abduction from Default Theories. IJCAI (1) 1995 : 870-877 Thomas Eiter, Georg Gottlob , Nicola Leone : Complexity Results for Abductive Logic Programming. LPNMR 1995 : 1-14 Thomas Eiter, Nicola Leone : On Modularity Properties of Partial Semantics for Disjunctive Logic Programs. WLP 1995 : 217-226 Thomas Eiter: Generating Boolean mu-Expressions Acta Inf. 32 (2): 171-187 (1995) Thomas Eiter, Georg Gottlob : On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Ann. Math. Artif. Intell. 15 (3-4): 289-323 (1995) Thomas Eiter, Pekka Kilpeläinen , Heikki Mannila : Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. Discrete Applied Mathematics 59 (1): 23-31 (1995) Thomas Eiter, Georg Gottlob : The Complexity of Logic-Based Abduction. J. ACM 42 (1): 3-42 (1995) Thomas Eiter, Georg Gottlob : Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24 (6): 1278-1304 (1995) Thomas Eiter, Georg Gottlob , Heikki Mannila : Disjunctive Logic Programming over Finite Structures. GI Jahrestagung 1994 : 69-73 Thomas Eiter, Georg Gottlob , Heikki Mannila : Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. IS/KI 1994 : 83-103 Marco Cadoli , Thomas Eiter, Georg Gottlob : Default Logic as a Query Language. KR 1994 : 99-108 Thomas Eiter, Georg Gottlob , Heikki Mannila : Adding Disjunction to Datalog. PODS 1994 : 267-278 Thomas Eiter: Exact Transversal Hypergraphs and Application to Boolean µ-Functions. J. Symb. Comput. 17 (3): 215-225 (1994) Thomas Eiter, Georg Gottlob : The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. IJCAI 1993 : 526-533 Thomas Eiter, Georg Gottlob , Yuri Gurevich : Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI 1993 : 634-639 Thomas Eiter, Georg Gottlob : Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. ILPS 1993 : 266-278 Thomas Eiter, Georg Gottlob : Complexity Aspects of Various Semantics for Disjunctive Databases. PODS 1993 : 158-167 Thomas Eiter, Georg Gottlob : The Complexity of Logic-Based Abduction. STACS 1993 : 70-79 Thomas Eiter, Georg Gottlob : Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. Theor. Comput. Sci. 114 (2): 231-245 (1993) Thomas Eiter, Georg Gottlob : Complexity of Propositional Knowledge Base Revision. CNKBS 1992 : 38-40 Thomas Eiter, Georg Gottlob : On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. PODS 1992 : 261-273 Thomas Eiter, Georg Gottlob : Complexity Results for Logic-Based Abduction. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992 : 29-44 Marco Cadoli , Thomas Eiter, Georg Gottlob : An Efficient Method for Eliminating Varying Predicates from a Circumscription. Artif. Intell. 54 (2): 397-410 (1992) Thomas Eiter, Georg Gottlob : On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artif. Intell. 57 (2-3): 227-270 (1992) Thomas Eiter, Georg Gottlob : Reasoning with parsimonious and moderately grounded expansions. Fundam. Inform. 17 (1-2): 31-53 (1992) Thomas Eiter, Michael Schrefl , Markus Stumptner : Sperrverfahren für B-Bäume im Vergleich. Informatik Spektrum 14 (4): 183-200 (1991) 1 [ 108 ] 2 [ 158 ] [ 162 ] [ 177 ] 3 [ 168 ] 4 [ 27 ] [ 28 ] [ 89 ] 5 [ 58 ] [ 67 ] [ 84 ] [ 108 ] 6 [ 65 ] [ 91 ] 7 [ 4 ] [ 16 ] [ 38 ] [ 103 ] [ 119 ] [ 165 ] 8 [ 129 ] 9 [ 43 ] 10 [ 48 ] [ 97 ] 11 [ 129 ] 12 [ 89 ] [ 137 ] [ 141 ] 13 [ 74 ] [ 78 ] [ 87 ] [ 88 ] [ 106 ] 14 [ 154 ] [ 175 ] 15 [ 43 ] [ 70 ] [ 75 ] [ 79 ] [ 86 ] [ 93 ] [ 98 ] [ 107 ] [ 109 ] [ 115 ] [ 117 ] [ 128 ] [ 129 ] [ 130 ] [ 134 ] [ 136 ] [ 138 ] [ 147 ] [ 152 ] [ 154 ] [ 160 ] [ 166 ] [ 167 ] [ 169 ] [ 171 ] 16 [ 83 ] [ 92 ] [ 94 ] [ 99 ] [ 100 ] [ 101 ] [ 112 ] [ 113 ] [ 118 ] [ 126 ] [ 137 ] [ 140 ] [ 141 ] [ 142 ] [ 143 ] [ 146 ] [ 147 ] [ 155 ] [ 159 ] [ 160 ] [ 164 ] [ 166 ] [ 167 ] [ 170 ] [ 171 ] [ 175 ] [ 176 ] [ 180 ] [ 181 ] 17 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 22 ] [ 25 ] [ 26 ] [ 29 ] [ 30 ] [ 31 ] [ 35 ] [ 36 ] [ 37 ] [ 38 ] [ 39 ] [ 42 ] [ 43 ] [ 45 ] [ 48 ] [ 49 ] [ 50 ] [ 53 ] [ 57 ] [ 65 ] [ 73 ] [ 80 ] [ 91 ] [ 97 ] [ 103 ] [ 104 ] [ 116 ] [ 117 ] [ 119 ] [ 124 ] [ 127 ] [ 129 ] [ 135 ] [ 165 ] [ 166 ] [ 167 ] [ 168 ] [ 171 ] 18 [ 171 ] 19 [ 143 ] [ 166 ] [ 167 ] [ 171 ] 20 [ 12 ] [ 31 ] [ 57 ] [ 73 ] 21 [ 168 ] 22 [ 129 ] [ 157 ] [ 166 ] [ 171 ] [ 174 ] [ 179 ] [ 182 ] 23 [ 47 ] [ 54 ] [ 56 ] [ 60 ] [ 63 ] [ 64 ] [ 66 ] [ 71 ] [ 72 ] [ 90 ] [ 111 ] [ 114 ] 24 [ 129 ] 25 [ 166 ] [ 171 ] 26 [ 21 ] 27 [ 88 ] [ 106 ] [ 123 ] 28 [ 43 ] [ 75 ] [ 129 ] [ 168 ] 29 [ 89 ] 30 [ 143 ] [ 163 ] [ 166 ] [ 171 ] 31 [ 166 ] [ 171 ] 32 [ 24 ] [ 25 ] [ 26 ] [ 32 ] [ 33 ] [ 34 ] [ 35 ] [ 37 ] [ 39 ] [ 40 ] [ 43 ] [ 44 ] [ 51 ] [ 52 ] [ 59 ] [ 61 ] [ 65 ] [ 70 ] [ 75 ] [ 79 ] [ 86 ] [ 91 ] [ 93 ] [ 98 ] [ 107 ] [ 115 ] [ 117 ] [ 128 ] [ 129 ] [ 130 ] [ 134 ] [ 136 ] [ 138 ] [ 152 ] [ 166 ] [ 167 ] [ 171 ] 33 [ 178 ] 34 [ 166 ] [ 171 ] 35 [ 46 ] [ 55 ] [ 96 ] 36 [ 76 ] [ 81 ] [ 82 ] [ 85 ] [ 95 ] [ 96 ] [ 102 ] [ 120 ] [ 122 ] [ 125 ] [ 139 ] [ 150 ] [ 153 ] [ 161 ] 37 [ 47 ] [ 54 ] [ 56 ] [ 60 ] [ 63 ] [ 64 ] [ 66 ] [ 71 ] [ 72 ] [ 90 ] [ 111 ] [ 114 ] [ 116 ] [ 124 ] [ 132 ] [ 135 ] [ 144 ] [ 145 ] 38 [ 15 ] [ 17 ] [ 18 ] [ 21 ] [ 41 ] [ 42 ] 39 [ 121 ] [ 131 ] 40 [ 43 ] [ 44 ] [ 51 ] [ 59 ] [ 61 ] 41 [ 105 ] 42 [ 166 ] [ 171 ] 43 [ 89 ] 44 [ 117 ] [ 129 ] 45 [ 43 ] [ 44 ] [ 51 ] [ 59 ] [ 61 ] [ 70 ] [ 75 ] [ 79 ] [ 86 ] [ 93 ] [ 98 ] [ 107 ] [ 115 ] [ 117 ] [ 128 ] [ 129 ] [ 130 ] [ 134 ] [ 136 ] [ 138 ] [ 147 ] [ 152 ] [ 160 ] 46 [ 69 ] 47 [ 79 ] [ 86 ] [ 93 ] [ 98 ] [ 128 ] [ 129 ] [ 130 ] [ 136 ] [ 137 ] [ 138 ] [ 141 ] [ 148 ] [ 152 ] [ 156 ] 48 [ 77 ] 49 [ 166 ] [ 171 ] 50 [ 89 ] 51 [ 166 ] [ 171 ] 52 [ 83 ] [ 92 ] [ 94 ] [ 99 ] [ 100 ] [ 101 ] [ 112 ] [ 113 ] [ 118 ] [ 126 ] [ 140 ] [ 164 ] 53 [ 32 ] [ 33 ] [ 34 ] [ 40 ] [ 52 ] 54 [ 43 ] [ 44 ] [ 51 ] [ 59 ] [ 61 ] [ 117 ] 55 [ 133 ] [ 151 ] 56 [ 153 ] [ 157 ] [ 161 ] [ 174 ] [ 179 ] [ 182 ] 57 [ 105 ] 58 [ 1 ] 59 [ 104 ] 60 [ 170 ] [ 175 ] 61 [ 166 ] [ 171 ] 62 [ 1 ] 63 [ 46 ] [ 55 ] [ 62 ] [ 68 ] [ 69 ] [ 77 ] [ 89 ] [ 96 ] [ 131 ] 64 [ 166 ] [ 171 ] 65 [ 74 ] [ 78 ] [ 83 ] [ 87 ] [ 88 ] [ 92 ] [ 94 ] [ 99 ] [ 100 ] [ 101 ] [ 106 ] [ 112 ] [ 113 ] [ 118 ] [ 123 ] [ 126 ] [ 140 ] [ 146 ] [ 153 ] [ 155 ] [ 157 ] [ 159 ] [ 161 ] [ 164 ] [ 173 ] [ 174 ] [ 176 ] [ 179 ] [ 180 ] [ 181 ] [ 182 ] 66 [ 169 ] [ 180 ] [ 181 ] 67 [ 109 ] 68 [ 105 ] 69 [ 45 ] [ 50 ] [ 110 ] 70 [ 48 ] [ 97 ] 71 [ 85 ] [ 95 ] 72 [ 74 ] [ 78 ] [ 87 ] [ 88 ] [ 106 ] [ 123 ] [ 146 ] [ 147 ] [ 155 ] [ 159 ] [ 160 ] [ 173 ] [ 176 ] [ 180 ] [ 181 ] 73 [ 137 ] [ 141 ] 74 [ 177 ]  ©2006 Association for Computing Machinery |
