| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Georg Gottlob 129 Francesco Buccafurri , Georg Gottlob: Multiagent Compromises, Joint Fixpoints, and Stable Models. Computational Logic: Logic Programming and Beyond 2002 : 561-585 128 Georg Gottlob, Christoph Koch : Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. PODS 2002 : 17-28 127 Georg Gottlob, Christoph Koch , Reinhard Pichler : Efficient Algorithms for Processing XPath Queries. VLDB 2002 126 Georg Gottlob, Francesco Scarcello , Martha Sideri : Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence 138 (1-2): 55-86 (2002) 125 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions and Tractable Queries. JCSS 64 (3): 579-627 (2002) 124 Georg Gottlob, Nicola Leone , Francesco Scarcello : Computing LOGCFL certificates. TCS 270 (1-2): 761-777 (2002) 123 Georg Gottlob, Erich Grädel , Helmut Veith : Datalog LITE: a deductive query language with linear time model checking. TOCL 3 (1): 42-79 (2002) 122 Thomas Eiter , Georg Gottlob, Thomas Schwentick : Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001 : 37-56 121 Georg Gottlob, Reinhard Pichler : Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ICALP 2001 : 708-719 120 Marco Cadoli , Thomas Eiter , Georg Gottlob: Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001 : 169-174 119 Robert Baumgartner , Sergio Flesca , Georg Gottlob: The Elog Web Extraction Language. LPAR 2001 : 548-560 118 Robert Baumgartner , Sergio Flesca , Georg Gottlob: Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto. LPNMR 2001 : 21-41 117 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions: A Survey. MFCS 2001 : 37-57 116 Georg Gottlob, Nicola Leone , Francesco Scarcello : Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. PODS 2001 115 Marcus Herzog , Georg Gottlob: InfoPipes: A Flexible Framework for M-Commerce Applications. TES 2001 : 175-186 114 Robert Baumgartner , Sergio Flesca , Georg Gottlob: Visual Web Information Extraction with Lixto. VLDB 2001 : 119-128 113 Robert Baumgartner , Sergio Flesca , Georg Gottlob: Supervised Wrapper Generation with Lixto. VLDB 2001 : 715-716 112 Evgeny Dantsin , Thomas Eiter , Georg Gottlob, Andrei Voronkov : Complexity and expressive power of logic programming. ACM Computing Surveys 33 (3): 374-425 (2001) 111 Georg Gottlob, Nicola Leone , Francesco Scarcello : The complexity of acyclic conjunctive queries. JACM 48 (3): 431-498 (2001) 110 Francesco Buccafurri , Thomas Eiter , Georg Gottlob, Nicola Leone : On ACTL Formulas Having Linear Counterexamples. JCSS 62 (3): 463-515 (2001) 109 Georg Gottlob, Phokion G. Kolaitis , Thomas Schwentick : Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000 : 664-674 108 Thomas Eiter , Georg Gottlob: On the Complexity of Theory Curbing. LPAR 2000 : 1-19 107 Georg Gottlob, Nicola Leone , Francesco Scarcello : A comparison of structural CSP decomposition methods. Artificial Intelligence 124 (2): 243-282 (2000) 106 Thomas Eiter , Yuri Gurevich , Georg Gottlob: Existential second-order logic over strings. JACM 47 (1): 77-131 (2000) 105 Georg Gottlob, Etienne Grandjean , Katrin Seyr : Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings. Springer 1999 104 Georg Gottlob, Nicola Leone , Francesco Scarcello : On Tractable Queries and Constraints. DEXA 1999 : 1-15 103 Georg Gottlob, Nicola Leone , Francesco Scarcello : Computing LOGCFL Certificates. ICALP 1999 : 361-371 102 Georg Gottlob, Nicola Leone , Francesco Scarcello : A Comparison of Structural CSP Decomposition Methods. IJCAI 1999 : 394-399 101 Robert Baumgartner , Georg Gottlob: On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases. IJCAI 1999 : 64-69 100 Georg Gottlob, Reinhard Pichler : Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. LICS 1999 : 306-315 99 Georg Gottlob, Christos H. Papadimitriou : On the Complexity of Single-Rule Datalog Queries. LPAR 1999 : 201-222 98 Georg Gottlob, Francesco Scarcello , Martha Sideri : Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. LPNMR 1999 : 1-18 97 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions and Tractable Queries. PODS 1999 : 21-32 96 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions and Tractable Queries. SEBD 1999 : 275-289 95 Georg Gottlob, Nicola Leone , Helmut Veith : Succinctness as a Source of Complexity in Logical Formalisms. Annals of Pure and Applied Logic 97 (1-3): 231-260 (1999) 94 Francesco Buccafurri , Thomas Eiter , Georg Gottlob, Nicola Leone : Enhancing Model Checking in Verification by AI Techniques. Artificial Intelligence 112 (1-2): 57-104 (1999) 93 Georg Gottlob, Nicola Leone , Francesco Scarcello : On the Complexity of Some Inductive Logic Programming Problems. New Generation Computing 17 (1): 53-75 (1999) 92 Georg Gottlob, Nicola Leone , Francesco Scarcello : The Complexity of Acyclic Conjunctive Queries. FOCS 1998 : 706-715 91 Thomas Eiter , Georg Gottlob, Yuri Gurevich : Existential Second-Order Logic over Strings. LICS 1998 : 16-27 90 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) 89 Thomas Eiter , Georg Gottlob, Helmut Veith : Generalized Quantifiers in Logic Programs. ESSLLI 1997 : 72-98 88 Thomas Eiter , Georg Gottlob: The Complexity Class Theta 2 p : Recent Results and Applications in AI and Modal Logic. FCT 1997 : 1-18 87 Evgeny Dantsin , Thomas Eiter , Georg Gottlob, Andrei Voronkov : Complexity and Expressive Power of Logic Programming. IEEE Conference on Computational Complexity 1997 : 82-101 86 Georg Gottlob, Nicola Leone , Francesco Scarcello : On the Complexity of Some Inductive Logic Programming Problems. ILP 1997 : 17-32 85 Thomas Eiter , Georg Gottlob, Helmut Veith : Modular Logic Programming and Generalized Quantifiers. LPNMR 1997 : 290-309 84 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- 83 Thomas Eiter , Georg Gottlob, Nicola Leone : Semantics and Complexity of Abduction from Default Theories. Artificial Intelligence 90 (1-2): 177-223 (1997) 82 Gerhard Brewka , Georg Gottlob: Well-Founded Semantics for Default Logic. Fundamenta Informaticae 31 (3/4): 221-236 (1997) 81 Thomas Eiter , Georg Gottlob: Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions. JLP 33 (2): 167-178 (1997) 80 Thomas Eiter , Georg Gottlob, Nicola Leone : On the Indiscernibility of Individuals in Logic Programming. Journal of Logic and Computation 7 (6): 805-824 (1997) 79 Thomas Eiter , Georg Gottlob, Nicola Leone : Abduction from Logic Programs: Semantics and Complexity. TCS 189 (1-2): 129-177 (1997) 78 Marco Cadoli , Thomas Eiter , Georg Gottlob: Default Logic as a Query Language. TKDE 9 (3): 448-463 (1997) 77 Thomas Eiter , Georg Gottlob, Heikki Mannila : Disjunctive Datalog. TODS 22 (3): 364-418 (1997) 76 Georg Gottlob: Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures. The Journal of Symbolic Logic 62 (2): 545-574 (1997) 75 Georg Gottlob, Guido Moerkotte , V. S. Subrahmanian : The PARK Semantics for Active Rules. EDBT 1996 : 35-55 74 Georg Gottlob: Collapsing Oracle-Tape Hierarchies. IEEE Conference on Computational Complexity 1996 : 33-42 73 Georg Gottlob: Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract). KR 1996 : 647-649 72 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) 71 Georg Gottlob, Miroslaw Truszczynski : Approximating the Stable Model Semantics is Hard. Fundamenta Informaticae 28 (1-2): 123-128 (1996) 70 Jürgen Dix , Georg Gottlob, V. Wiktor Marek : Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundamenta Informaticae 28 (1-2): 87-100 (1996) 69 Thomas Eiter , Georg Gottlob: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. JCSS 53 (3): 497-512 (1996) 68 Thomas Eiter , Georg Gottlob: Mächtigkeit von Logikprogrammierung über Datenbanken. KI 10 (3): 32-39 (1996) 67 Georg Gottlob, Sherry Marcus , Anil Nerode , Gernot Salzer , V. S. Subrahmanian : A Non-Ground Realization of the Stable and Well-Founded Semantics. TCS 166 (1&2): 221-262 (1996) 66 Georg Gottlob, Michael Schrefl , Brigitte Röck : Extending Object-Oriented Systems with Roles. TOIS 14 (3): 268-296 (1996) 65 Georg Gottlob, Moshe Y. Vardi : Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings. Springer 1995 64 Thomas Eiter , Georg Gottlob, Nicola Leone : Semantics and Complexity of Abduction from Default Theories. IJCAI (1) 1995 : 870-877 63 Georg Gottlob: Relativized Logspace and Generalized Quantifiers over Finite Structures. LICS 1995 : 65-78 62 Thomas Eiter , Georg Gottlob, Nicola Leone : Complexity Results for Abductive Logic Programming. LPNMR 1995 : 1-14 61 Georg Gottlob, Nicola Leone , Helmut Veith : Second Order Logic and the Weak Exponential Hierarchies. MFCS 1995 : 66-81 60 Georg Gottlob, Gerti Kappel , Michael Schrefl : The Evolving Algebra Semantics of Class and Role Hierarchies. Semantics in Databases 1995 : 92-113 59 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) 58 Georg Gottlob: The Complexity of Default Reasoning under the Stationary Fixed Point Semantics. Information and Computation 121 (1): 81-92 (1995) 57 Thomas Eiter , Georg Gottlob: The Complexity of Logic-Based Abduction. JACM 42 (1): 3-42 (1995) 56 Georg Gottlob: NP Trees and Carnap's Modal Logic. JACM 42 (2): 421-457 (1995) 55 Georg Gottlob: Translating Default Logic into Standard Autoepistemic Logic. JACM 42 (4): 711-740 (1995) 54 Thomas Eiter , Georg Gottlob: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24 (6): 1278-1304 (1995) 53 Thomas Eiter , Georg Gottlob, Heikki Mannila : Disjunctive Logic Programming over Finite Structures. GI Jahrestagung 1994 : 69-73 52 Jürgen Dix , Georg Gottlob, V. Wiktor Marek : Causal Models of Disjunctive Logic Programs. ICLP 1994 : 290-302 51 Thomas Eiter , Georg Gottlob, Heikki Mannila : Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. IS/KI 1994 : 83-103 50 Georg Gottlob: From Carnap's Modal Logic to Autoepistemic Logic. JELIA 1994 : 1-18 49 Marco Cadoli , Thomas Eiter , Georg Gottlob: Default Logic as a Query Language. KR 1994 : 99-108 48 Thomas Eiter , Georg Gottlob, Heikki Mannila : Adding Disjunction to Datalog. PODS 1994 : 267-278 47 Georg Gottlob: Complexity and Expressive Power of Disjunctive Logic Programming. SLP 1994 : 23-42 46 Georg Gottlob, Zhang Mingyi : Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Artificial Intelligence 69 (1-2): 329-345 (1994) 45 Georg Gottlob: NP Trees and Carnap's Modal Logic. FOCS 1993 : 42-51 44 Thomas Eiter , Georg Gottlob: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. IJCAI 1993 : 526-533 43 Georg Gottlob: The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic. IJCAI 1993 : 570-577 42 Thomas Eiter , Georg Gottlob, Yuri Gurevich : Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information. IJCAI 1993 : 634-639 41 Thomas Eiter , Georg Gottlob: Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. ILPS 1993 : 266-278 40 Georg Gottlob: Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract). LPNMR 1993 : 265 39 Thomas Eiter , Georg Gottlob: Complexity Aspects of Various Semantics for Disjunctive Databases. PODS 1993 : 158-167 38 Thomas Eiter , Georg Gottlob: The Complexity of Logic-Based Abduction. STACS 1993 : 70-79 37 Georg Gottlob, Christian G. Fermüller : Removing Redundancy from a Clause. Artificial Intelligence 61 (2): 263-289 (1993) 36 Thomas Eiter , Georg Gottlob: Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. TCS 114 (2): 231-245 (1993) 35 Alain Pirotte , Claude Delobel , Georg Gottlob: Advances in Database Technology - EDBT'92, 3rd International Conference on Extending Database Technology, Vienna, Austria, March 23-27, 1992, Proceedings. Springer 1992 34 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Formaiizing the Repair Process. ECAI 1992 : 709-713 33 Georg Gottlob: The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic. ECAI Workshop on Knowledge Representation and Reasoning 1992 : 133-144 32 Thomas Eiter , Georg Gottlob: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. PODS 1992 : 261-273 31 Thomas Eiter , Georg Gottlob: Complexity Results for Logic-Based Abduction. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992 : 29-44 30 Marco Cadoli , Thomas Eiter , Georg Gottlob: An Efficient Method for Eliminating Varying Predicates from a Circumscription. Artificial Intelligence 54 (2): 397-410 (1992) 29 Thomas Eiter , Georg Gottlob: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence 57 (2-3): 227-270 (1992) 28 Georg Gottlob, Michael Schrefl , Markus Stumptner : Selective Inheritance of Attribute Values in Relational Databases. Discrete Applied Mathematics 40 (2): 187-216 (1992) 27 Georg Gottlob: Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation 2 (3): 397-425 (1992) 26 Georg Gottlob: On the Complexity of Clause Condensing. ÖGAI 1991 : 16-29 25 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Towards a Theory of the Repair Process. EPIA 1991 : 222-236 24 Georg Gottlob, Wolfgang Nejdl : Expert Systems in Engineering, Principles and Applications, International Workshop, Vienna, Austria, September 24-26, 1990, Proceedings. Springer 1990 23 Stefano Ceri , Georg Gottlob, Letizia Tanca : Logic Programming and Databases. Springer 1990 22 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Physical Impossibility Instead of Fault Models. AAAI 1990 : 331-336 21 Georg Gottlob, Gerti Kappel , Michael Schrefl : Semantics of Object-Oriented Data Models - The Evolving Algebra Approach. East/West Database Workshop 1990 : 144-160 20 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Hypothesis Classification, Abductive Diagnosis and Therapy. Expert Systems in Engineering 1990 : 69-78 19 Georg Gottlob, Michael Schrefl , Markus Stumptner : On the Interaction between Transitive Closure and Functional Dependencies. MFDBS 1989 : 187-206 18 Stefano Ceri , Georg Gottlob, Letizia Tanca , Gio Wiederhold : Magic Semi-Joins. Information Processing Letters 33 (2): 97-107 (1989) 17 Stefano Ceri , Georg Gottlob, Letizia Tanca : What you Always Wanted to Know About Datalog (And Never Dared to Ask). TKDE 1 (1): 146-166 (1989) 16 Stefano Ceri , Georg Gottlob, Gio Wiederhold : Efficient Database Access from Prolog. TSE 15 (2): 153-164 (1989) 15 Stefano Ceri , Stefano Crespi-Reghizzi , Georg Gottlob, F. Lamperti , Luigi Lavazza , Letizia Tanca , Roberto Zicari : The Algres Project. EDBT 1988 : 551-555 14 Georg Gottlob, Roberto Zicari : Closed World Databases Opened Through Null Values. VLDB 1988 : 50-61 13 Georg Gottlob, Paolo Paolini , Roberto Zicari : Properties and Update Semantics of Consistent Views. TODS 13 (4): 486-524 (1988) 12 Georg Gottlob: Computing Covers for Embedded Functional Dependencies. PODS 1987 : 58-69 11 Georg Gottlob: Subsumption and Implication. Information Processing Letters 24 (2): 109-111 (1987) 10 Georg Gottlob: On the Size of Nonredundant FD-Covers. Information Processing Letters 24 (6): 355-360 (1987) 9 Stefano Ceri , Georg Gottlob, Gio Wiederhold : Interfacing Relational Databases and Prolog Efficiently. Expert Database Conf. 1986 : 207-223 8 Stefano Ceri , Georg Gottlob, Luigi Lavazza : Translation and Optimization of Logic Queries: The Algebraic Approach. VLDB 1986 : 395-402 7 Stefano Ceri , Georg Gottlob: Normalization of Relations and PROLOG. CACM 29 (6): 524-544 (1986) 6 Stefano Ceri , Georg Gottlob, Giuseppe Pelagatti : Taxonomy and formal properties of distributed joins. IS 11 (1): 25-40 (1986) 5 Georg Gottlob, Alexander Leitsch : Fast Subsumption Algorithms. European Conference on Computer Algebra (2) 1985 : 64-77 4 Georg Gottlob, Alexander Leitsch : On the Efficiency of Subsumption Algorithms. JACM 32 (2): 280-295 (1985) 3 Stefano Ceri , Georg Gottlob: Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries. TSE 11 (4): 324-345 (1985) 2 S. Copelli , Georg Gottlob: Implementation of a Distributed File System on a Geographic Network of Personal Computers. DDSS 1984 : 203-219 1 Stefano Ceri , Georg Gottlob, Giuseppe Pelagatti : Joining Fragmented Relations in Distributed Databases. XP1 Workshop on Database Theory 1983  DiSC'02 © 2003 Association for Computing Machinery |
