![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Thomas Eiter 100 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 99 Thomas Eiter, Viviana Mascardi , V. S. Subrahmanian : Error-Tolerant Agents. Computational Logic: Logic Programming and Beyond 2002 : 586-625 98 Thomas Eiter, Volker Klotz , Hans Tompits , Stefan Woltran : Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002 : 100-114 97 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Recognition and dualization of disguised bidual Horn functions. Information Processing Letters 82 (6): 283-291 (2002) 96 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Decision lists and related Boolean functions. TCS 270 (1-2): 493-524 (2002) 95 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 94 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 93 Thomas Eiter, Daniel Veit , Jörg P. Müller , Martin Schneider II : Matchmaking for Structured Objects. DaWaK 2001 : 186-194 92 Thomas Eiter, Georg Gottlob , Thomas Schwentick : Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001 : 37-56 91 Marco Cadoli , Thomas Eiter, Georg Gottlob : Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001 : 169-174 90 Thomas Eiter, Thomas Lukasiewicz : Complexity Results for Structure-Based Causality. IJCAI 2001 : 35-42 89 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : A Framework for Declarative Update Specifications in Logic Programs. IJCAI 2001 : 649-654 88 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Reasoning about Evolving Nonmonotonic Knowledge Bases. LPAR 2001 : 407-421 87 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : An Update Front-End for Extended Logic Programs. LPNMR 2001 : 397-401 86 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : System Description: The DLV K Planning System. LPNMR 2001 : 429-433 85 Evgeny Dantsin , Thomas Eiter, Georg Gottlob , Andrei Voronkov : Complexity and expressive power of logic programming. ACM Computing Surveys 33 (3): 374-425 (2001) 84 Thomas Eiter, Thomas Lukasiewicz , Michael Walter : A data model and algebra for probabilistic complex values. Annals of Mathematics and Artificial Intelligence 33 (2-4): 205-252 (2001) 83 Francesco Buccafurri , Thomas Eiter, Georg Gottlob , Nicola Leone : On ACTL Formulas Having Linear Counterexamples. JCSS 62 (3): 463-515 (2001) 82 Thomas Eiter, James J. Lu , Thomas Lukasiewicz , V. S. Subrahmanian : Probabilistic object bases. TODS 26 (3): 264-312 (2001) 81 V. S. Subrahmanian , Piero A. Bonatti , Jürgen Dix , Thomas Eiter, Sarit Kraus , Fatma Ozcan , Robert Ross : Heterogenous Active Agents. MIT Press 2000 80 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 79 Uwe Egly , Thomas Eiter, Hans Tompits , Stefan Woltran : Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000 : 417-422 78 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : Planning under Incomplete Knowledge. Computational Logic 2000 : 807-821 77 Thomas Eiter, Thomas Lukasiewicz , Michael Walter : Extension of the Relational Algebra to Probabilistic Complex Values. FoIKS 2000 : 94-115 76 Gerhard Brewka , Thomas Eiter: Prioritizing Default Logic. Intellectics and Computational Logic 2000 : 27-45 75 Thomas Eiter, Michael Fink , Giuliana Sabbatini , Hans Tompits : Considerations on Updates of Logic Programs. JELIA 2000 : 2-20 74 Thomas Eiter, Thomas Lukasiewicz : New Tractable Cases in Default Reasoning from Conditional Knowledge Bases. JELIA 2000 : 313-328 73 Thomas Eiter, Thomas Lukasiewicz : Complexity Results for Default Reasoning from Conditional Knowledge Bases. KR 2000 : 62-73 72 Thomas Eiter, Georg Gottlob : On the Complexity of Theory Curbing. LPAR 2000 : 1-19 71 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer , Axel Polleres : Using the dlv System for Planning and Diagnostic Reasoning. WLP 2000 : 125-134 70 Uwe Egly , Thomas Eiter, Hans Tompits , Stefan Woltran : Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000 : 223-228 69 Thomas Eiter, V. S. Subrahmanian , Timothy J. Rogers : Heterogeneous active agents, III: Polynomially implementable agents. Artificial Intelligence 117 (1): 107-167 (2000) 68 Thomas Eiter, Thomas Lukasiewicz : Default reasoning from conditional knowledge bases: Complexity and tractable cases. Artificial Intelligence 124 (2): 169-241 (2000) 67 Thomas Eiter, Yuri Gurevich , Georg Gottlob : Existential second-order logic over strings. JACM 47 (1): 77-131 (2000) 66 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : On the Difference of Horn Theories. JCSS 61 (3): 478-507 (2000) 65 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : On the Difference of Horn Theories. STACS 1999 : 467-477 64 Thomas Eiter, Wolfgang Faber , Nicola Leone , Gerald Pfeifer : The Diagnosis Frontend of the dlv System. AI Communications 12 (1-2): 99-111 (1999) 63 Thomas Eiter, V. S. Subrahmanian , George Pick : Heterogeneous Active Agents, I: Semantics. Artificial Intelligence 108 (1-2): 179-255 (1999) 62 Thomas Eiter, V. S. Subrahmanian : Heterogeneous Active Agents, II: Algorithms and Complexity. Artificial Intelligence 108 (1-2): 257-307 (1999) 61 Gerhard Brewka , Thomas Eiter: Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109 (1-2): 297-356 (1999) 60 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Computing Intersections of Horn Theories for Reasoning with Models. Artificial Intelligence 110 (1): 57-101 (1999) 59 Francesco Buccafurri , Thomas Eiter, Georg Gottlob , Nicola Leone : Enhancing Model Checking in Verification by AI Techniques. Artificial Intelligence 112 (1-2): 57-104 (1999) 58 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Computing Intersections of Horn Theories for Reasoning with Models. AAAI/IAAI 1998 : 292-297 57 Thomas Eiter, V. S. Subrahmanian : Deontic Action Programs. FMLDO 1998 : 37-54 56 Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : Progress Report on the Disjunctive Deductive Database System dlv . FQAS 1998 : 148-163 55 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Disjunctions of Horn Theories and Their Cores. ISAAC 1998 : 49-58 54 Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : The KR System dlv: Progress Report, Comparisons and Benchmarks. KR 1998 : 406-417 53 Gerhard Brewka , Thomas Eiter: Preferred Answer Sets for Extended Logic Programs. KR 1998 : 86-97 52 Thomas Eiter, Georg Gottlob , Yuri Gurevich : Existential Second-Order Logic over Strings. LICS 1998 : 16-27 51 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : On Disguised Double Horn Functions and Extensions. STACS 1998 : 50-60 50 Thomas Eiter, James J. Lu , V. S. Subrahmanian : A First-Order Representation of Stable Models. AI Communications 11 (1): 53-73 (1998) 49 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Double Horn Functions. Information and Computation 144 (2): 155-190 (1998) 48 Thomas Eiter, Nicola Leone , Domenico Saccà : Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases. TCS 206 (1-2): 181-218 (1998) 47 Thomas Eiter, Georg Gottlob : On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic. The Journal of Symbolic Logic 63 (1): 73-82 (1998) 46 Thomas Eiter, Georg Gottlob , Helmut Veith : Generalized Quantifiers in Logic Programs. ESSLLI 1997 : 72-98 45 Thomas Eiter, Georg Gottlob : The Complexity Class Theta 2 p : Recent Results and Applications in AI and Modal Logic. FCT 1997 : 1-18 44 Evgeny Dantsin , Thomas Eiter, Georg Gottlob , Andrei Voronkov : Complexity and Expressive Power of Logic Programming. IEEE Conference on Computational Complexity 1997 : 82-101 43 Thomas Eiter, Toshihide Ibaraki , Kazuhisa Makino : Two-Face Horn Extensions. ISAAC 1997 : 112-121 42 Thomas Eiter, James J. Lu , V. S. Subrahmanian : Computing Non-Ground Representations of Stable Models. LPNMR 1997 : 198-217 41 Thomas Eiter, Georg Gottlob , Helmut Veith : Modular Logic Programming and Generalized Quantifiers. LPNMR 1997 : 290-309 40 Thomas Eiter, Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello : A Deductive System for Non-Monotonic Reasoning. LPNMR 1997 : 364-375 39 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- 38 Thomas Eiter, Heikki Mannila : Distance Measures for Point Sets and their Computation. Acta Informatica 34 (2): 109-133 (1997) 37 Thomas Eiter, Nicola Leone , Domenico Saccà : On the Partial Semantics for Disjunctive Deductive Databases. Annals of Mathematics and Artificial Intelligence 19 (1-2): 59-96 (1997) 36 Thomas Eiter, Georg Gottlob , Nicola Leone : Semantics and Complexity of Abduction from Default Theories. Artificial Intelligence 90 (1-2): 177-223 (1997) 35 Thomas Eiter, Georg Gottlob : Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions. JLP 33 (2): 167-178 (1997) 34 Thomas Eiter, Georg Gottlob , Nicola Leone : On the Indiscernibility of Individuals in Logic Programming. Journal of Logic and Computation 7 (6): 805-824 (1997) 33 Thomas Eiter, Georg Gottlob , Nicola Leone : Abduction from Logic Programs: Semantics and Complexity. TCS 189 (1-2): 129-177 (1997) 32 Marco Cadoli , Thomas Eiter, Georg Gottlob : Default Logic as a Query Language. TKDE 9 (3): 448-463 (1997) 31 Thomas Eiter, Georg Gottlob , Heikki Mannila : Disjunctive Datalog. TODS 22 (3): 364-418 (1997) 30 Thomas Eiter, Nicola Leone , Domenico Saccà : Partial Semantics for Disjunctive Deductive Databases. DEXA 1996 : 564-573 29 Thomas Eiter, Nicola Leone , Domenico Saccà : The Expressive Power of Partial Models in Disjunctive Deductive Databases. Logic in Databases 1996 : 245-264 28 Thomas Eiter, Georg Gottlob , Yuri Gurevich : Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Annals of Pure and Applied Logic 78 (1-3): 111-125 (1996) 27 Thomas Eiter, Georg Gottlob : The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. JCSS 53 (3): 497-512 (1996) 26 Thomas Eiter, Georg Gottlob : Mächtigkeit von Logikprogrammierung über Datenbanken. KI 10 (3): 32-39 (1996) 25 Piero A. Bonatti , Thomas Eiter: Querying Disjunctive Databases Through Nonmonotonic Logics. TCS 160 (1&2): 321-363 (1996) 24 Piero A. Bonatti , Thomas Eiter: Querying Disjunctive Database Through Nonmonotonic Logics. ICDT 1995 : 68-81 23 Thomas Eiter, Georg Gottlob , Nicola Leone : Semantics and Complexity of Abduction from Default Theories. IJCAI (1) 1995 : 870-877 22 Thomas Eiter, Georg Gottlob , Nicola Leone : Complexity Results for Abductive Logic Programming. LPNMR 1995 : 1-14 21 Thomas Eiter, Nicola Leone : On Modularity Properties of Partial Semantics for Disjunctive Logic Programs. WLP 1995 : 217-226 20 Thomas Eiter: Generating Boolean mu-Expressions. Acta Informatica 32 (2): 171-187 (1995) 19 Thomas Eiter, Georg Gottlob : On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15 (3-4): 289-323 (1995) 18 Thomas Eiter, Georg Gottlob : The Complexity of Logic-Based Abduction. JACM 42 (1): 3-42 (1995) 17 Thomas Eiter, Georg Gottlob : Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24 (6): 1278-1304 (1995) 16 Thomas Eiter, Georg Gottlob , Heikki Mannila : Disjunctive Logic Programming over Finite Structures. GI Jahrestagung 1994 : 69-73 15 Thomas Eiter, Georg Gottlob , Heikki Mannila : Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. IS/KI 1994 : 83-103 14 Marco Cadoli , Thomas Eiter, Georg Gottlob : Default Logic as a Query Language. KR 1994 : 99-108 13 Thomas Eiter, Georg Gottlob , Heikki Mannila : Adding Disjunction to Datalog. PODS 1994 : 267-278 12 Thomas Eiter: Exact Transversal Hypergraphs and Application to Boolean µ-Functions. JSC 17 (3): 215-225 (1994) 11 Thomas Eiter, Georg Gottlob : The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. IJCAI 1993 : 526-533 10 Thomas Eiter, Georg Gottlob , Yuri Gurevich : Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI 1993 : 634-639 9 Thomas Eiter, Georg Gottlob : Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. ILPS 1993 : 266-278 8 Thomas Eiter, Georg Gottlob : Complexity Aspects of Various Semantics for Disjunctive Databases. PODS 1993 : 158-167 7 Thomas Eiter, Georg Gottlob : The Complexity of Logic-Based Abduction. STACS 1993 : 70-79 6 Thomas Eiter, Georg Gottlob : Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. TCS 114 (2): 231-245 (1993) 5 Thomas Eiter, Georg Gottlob : On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. PODS 1992 : 261-273 4 Thomas Eiter, Georg Gottlob : Complexity Results for Logic-Based Abduction. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992 : 29-44 3 Marco Cadoli , Thomas Eiter, Georg Gottlob : An Efficient Method for Eliminating Varying Predicates from a Circumscription. Artificial Intelligence 54 (2): 397-410 (1992) 2 Thomas Eiter, Georg Gottlob : On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence 57 (2-3): 227-270 (1992) 1 Thomas Eiter, Michael Schrefl , Markus Stumptner : Sperrverfahren für B-Bäume im Vergleich. Informatik Spektrum 14 (4): 183-200 (1991) ![]() DiSC'02 © 2003 Association for Computing Machinery |