| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Georg Gottlob Georg Gottlob: Hypergraph Transversals. FoIKS 2004 : 1-5 Robert Baumgartner , Georg Gottlob, Marcus Herzog , Wolfgang Slany : Interactively Adding Web Service Interfaces to Existing Web Applications. SAINT 2004 : 74-80 Georg Gottlob, Christoph Koch : Monadic datalog and the expressive power of languages for Web information extraction. J. ACM 51 (1): 74-113 (2004) Georg Gottlob, Phokion G. Kolaitis , Thomas Schwentick : Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51 (2): 312-362 (2004) Georg Gottlob, Toby Walsh : IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003 Morgan Kaufmann 2003 Georg Gottlob, Christoph Koch : XPath Query Processing. DBPL 2003 : 20 Georg Gottlob, Christoph Koch , Reinhard Pichler : XPath Query Evaluation: Improving Time and Space Efficiency. ICDE 2003 : 379-390 Robert Baumgartner , Michal Ceresna , Georg Gottlob, Marcus Herzog , Viktor Zigo : Web Information Acquisition with Lixto Suite. ICDE 2003 : 747-749 Georg Gottlob, Christoph Koch , Reinhard Pichler : The complexity of XPath query evaluation. PODS 2003 : 179-190 Georg Gottlob, Gianluigi Greco , Francesco Scarcello : Pure Nash equilibria: hard and easy games. TARK 2003 : 215-230 Georg Gottlob, Christos H. Papadimitriou : On the complexity of single-rule datalog queries. Inf. Comput. 183 (1): 104-122 (2003) Georg Gottlob: Guest Editor's Foreword. J. Comput. Syst. Sci. 66 (1): 1 (2003) Georg Gottlob, Nicola Leone , Francesco Scarcello : Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66 (4): 775-808 (2003) Georg Gottlob, Christoph Koch , Reinhard Pichler : XPath Processing in a Nutshell. SIGMOD Record 32 (1): 12-19 (2003) Georg Gottlob, Christoph Koch , Reinhard Pichler : XPath processing in a nutshell. SIGMOD Record 32 (2): 21-27 (2003) Francesco Buccafurri , Georg Gottlob: Multiagent Compromises, Joint Fixpoints, and Stable Models. Computational Logic: Logic Programming and Beyond 2002 : 561-585 Georg Gottlob, Martin Hutle , Franz Wotawa : Combining hypertree, bicomp, and hinge decomposition. ECAI 2002 : 161-165 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 , Georg Gottlob: Hypergraph Transversal Computation and Related Problems in Logic and AI. JELIA 2002 : 549-564 Georg Gottlob, Christoph Koch : Monadic Queries over Tree-Structured Data. LICS 2002 : 189-202 Georg Gottlob, Christoph Koch : Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. PODS 2002 : 17-28 Thomas Eiter , Georg Gottlob, Kazuhisa Makino : New results on monotone dualization and generating hypergraph transversals. STOC 2002 : 14-22 Georg Gottlob, Christoph Koch , Reinhard Pichler : Efficient Algorithms for Processing XPath Queries. VLDB 2002 : 95-106 Georg Gottlob, Erich Grädel , Helmut Veith : Datalog LITE: a deductive query language with linear time model checking. ACM Trans. Comput. Log. 3 (1): 42-79 (2002) Georg Gottlob, Francesco Scarcello , Martha Sideri : Fixed-parameter complexity in AI and nonmonotonic reasoning. Artif. Intell. 138 (1-2): 55-86 (2002) Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64 (3): 579-627 (2002) Georg Gottlob, Nicola Leone , Francesco Scarcello : Computing LOGCFL certificates. Theor. Comput. Sci. 270 (1-2): 761-777 (2002) Robert Baumgartner , Georg Gottlob: Propositional default logics made easier: computational complexity of model checking. Theor. Comput. Sci. 289 (1): 591-627 (2002) Thomas Eiter , Georg Gottlob, Thomas Schwentick : Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001 : 37-56 Georg Gottlob, Reinhard Pichler : Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ICALP 2001 : 708-719 Marco Cadoli , Thomas Eiter , Georg Gottlob: Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001 : 169-174 Robert Baumgartner , Sergio Flesca , Georg Gottlob: The Elog Web Extraction Language. LPAR 2001 : 548-560 Robert Baumgartner , Sergio Flesca , Georg Gottlob: Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto. LPNMR 2001 : 21-41 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions: A Survey. MFCS 2001 : 37-57 Georg Gottlob, Nicola Leone , Francesco Scarcello : Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. PODS 2001 Georg Gottlob, Nicola Leone , Francesco Scarcello : Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. SEBD 2001 : 147-154 Georg Gottlob: The Lixto Wrapper Generation Tool. SEBD 2001 : 3-10 Marcus Herzog , Georg Gottlob: InfoPipes: A Flexible Framework for M-Commerce Applications. TES 2001 : 175-186 Robert Baumgartner , Sergio Flesca , Georg Gottlob: Visual Web Information Extraction with Lixto. VLDB 2001 : 119-128 Robert Baumgartner , Sergio Flesca , Georg Gottlob: Supervised Wrapper Generation with Lixto. VLDB 2001 : 715-716 Evgeny Dantsin , Thomas Eiter , Georg Gottlob, Andrei Voronkov : Complexity and expressive power of logic programming. ACM Comput. Surv. 33 (3): 374-425 (2001) Georg Gottlob, Nicola Leone , Francesco Scarcello : The complexity of acyclic conjunctive queries. J. ACM 48 (3): 431-498 (2001) Francesco Buccafurri , Thomas Eiter , Georg Gottlob, Nicola Leone : On ACTL Formulas Having Linear Counterexamples. J. Comput. Syst. Sci. 62 (3): 463-515 (2001) Georg Gottlob, Phokion G. Kolaitis , Thomas Schwentick : Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000 : 664-674 Thomas Eiter , Georg Gottlob: On the Complexity of Theory Curbing. LPAR 2000 : 1-19 Georg Gottlob, Nicola Leone , Francesco Scarcello : A comparison of structural CSP decomposition methods. Artif. Intell. 124 (2): 243-282 (2000) Thomas Eiter , Yuri Gurevich , Georg Gottlob: Existential second-order logic over strings. J. ACM 47 (1): 77-131 (2000) 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 Georg Gottlob, Nicola Leone , Francesco Scarcello : On Tractable Queries and Constraints. DEXA 1999 : 1-15 Georg Gottlob, Nicola Leone , Francesco Scarcello : Computing LOGCFL Certificates. ICALP 1999 : 361-371 Georg Gottlob, Nicola Leone , Francesco Scarcello : A Comparison of Structural CSP Decomposition Methods. IJCAI 1999 : 394-399 Robert Baumgartner , Georg Gottlob: On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases. IJCAI 1999 : 64-69 Georg Gottlob, Reinhard Pichler : Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. LICS 1999 : 306-315 Georg Gottlob, Christos H. Papadimitriou : On the Complexity of Single-Rule Datalog Queries. LPAR 1999 : 201-222 Georg Gottlob, Francesco Scarcello , Martha Sideri : Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. LPNMR 1999 : 1-18 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions and Tractable Queries. PODS 1999 : 21-32 Georg Gottlob, Nicola Leone , Francesco Scarcello : Hypertree Decompositions and Tractable Queries. SEBD 1999 : 275-289 Georg Gottlob, Nicola Leone , Helmut Veith : Succinctness as a Source of Complexity in Logical Formalisms. Ann. Pure Appl. Logic 97 (1-3): 231-260 (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) Georg Gottlob, Nicola Leone , Francesco Scarcello : On the Complexity of Some Inductive Logic Programming Problems. New Generation Comput. 17 (1): 53-75 (1999) Georg Gottlob, Nicola Leone , Francesco Scarcello : The Complexity of Acyclic Conjunctive Queries. FOCS 1998 : 706-715 Thomas Eiter , Georg Gottlob, Yuri Gurevich : Existential Second-Order Logic over Strings. LICS 1998 : 16-27 Thomas Eiter , Georg Gottlob: On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic. J. Symb. Log. 63 (1): 73-82 (1998) Anuj Dawar , Georg Gottlob, Lauri Hella : Capturing Relativized Complexity Classes without Order. Math. Log. Q. 44 : 109-122 (1998) Georg Gottlob, Alexander Leitsch , Daniele Mundici : Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings Springer 1997 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 Georg Gottlob, Nicola Leone , Francesco Scarcello : On the Complexity of Some Inductive Logic Programming Problems. ILP 1997 : 17-32 Thomas Eiter , Georg Gottlob, Helmut Veith : Modular Logic Programming and Generalized Quantifiers. LPNMR 1997 : 290-309 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 , Georg Gottlob, Nicola Leone : Semantics and Complexity of Abduction from Default Theories. Artif. Intell. 90 (1-2): 177-223 (1997) Gerhard Brewka , Georg Gottlob: Well-Founded Semantics for Default Logic. Fundam. Inform. 31 (3/4): 221-236 (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) Georg Gottlob: Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures. J. Symb. Log. 62 (2): 545-574 (1997) Thomas Eiter , Georg Gottlob, Nicola Leone : Abduction from Logic Programs: Semantics and Complexity. Theor. Comput. Sci. 189 (1-2): 129-177 (1997) Georg Gottlob, Guido Moerkotte , V. S. Subrahmanian : The PARK Semantics for Active Rules. EDBT 1996 : 35-55 Georg Gottlob: Collapsing Oracle-Tape Hierarchies. IEEE Conference on Computational Complexity 1996 : 33-42 Georg Gottlob: Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract). KR 1996 : 647-649 Georg Gottlob, Michael Schrefl , Brigitte Röck : Extending Object-Oriented Systems with Roles. ACM Trans. Inf. Syst. 14 (3): 268-296 (1996) 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) Georg Gottlob, Miroslaw Truszczynski : Approximating the Stable Model Semantics is Hard. Fundam. Inform. 28 (1-2): 123-128 (1996) Jürgen Dix , Georg Gottlob, V. Wiktor Marek : Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundam. Inform. 28 (1-2): 87-100 (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) Georg Gottlob, Sherry Marcus , Anil Nerode , Gernot Salzer , V. S. Subrahmanian : A Non-Ground Realization of the Stable and Well-Founded Semantics. Theor. Comput. Sci. 166 (1&2): 221-262 (1996) Georg Gottlob, Moshe Y. Vardi : Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings Springer 1995 Thomas Eiter , Georg Gottlob, Nicola Leone : Semantics and Complexity of Abduction from Default Theories. IJCAI (1) 1995 : 870-877 Georg Gottlob: Relativized Logspace and Generalized Quantifiers over Finite Structures LICS 1995 : 65-78 Thomas Eiter , Georg Gottlob, Nicola Leone : Complexity Results for Abductive Logic Programming. LPNMR 1995 : 1-14 Georg Gottlob, Nicola Leone , Helmut Veith : Second Order Logic and the Weak Exponential Hierarchies. MFCS 1995 : 66-81 Georg Gottlob, Gerti Kappel , Michael Schrefl : The Evolving Algebra Semantics of Class and Role Hierarchies. Semantics in Databases 1995 : 92-113 Thomas Eiter , Georg Gottlob: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Ann. Math. Artif. Intell. 15 (3-4): 289-323 (1995) Georg Gottlob: The Complexity of Default Reasoning under the Stationary Fixed Point Semantics Inf. Comput. 121 (1): 81-92 (1995) Thomas Eiter , Georg Gottlob: The Complexity of Logic-Based Abduction. J. ACM 42 (1): 3-42 (1995) Georg Gottlob: NP Trees and Carnap's Modal Logic. J. ACM 42 (2): 421-457 (1995) Georg Gottlob: Translating Default Logic into Standard Autoepistemic Logic. J. ACM 42 (4): 711-740 (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 Jürgen Dix , Georg Gottlob, V. Wiktor Marek : Causal Models of Disjunctive Logic Programs. ICLP 1994 : 290-302 Thomas Eiter , Georg Gottlob, Heikki Mannila : Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. IS/KI 1994 : 83-103 Georg Gottlob: From Carnap's Modal Logic to Autoepistemic Logic. JELIA 1994 : 1-18 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 Georg Gottlob: Complexity and Expressive Power of Disjunctive Logic Programming. SLP 1994 : 23-42 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Formalizing the Repair Process - Extended Report. Ann. Math. Artif. Intell. 11 (1-4): 187-201 (1994) Georg Gottlob, Zhang Mingyi : Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Artif. Intell. 69 (1-2): 329-345 (1994) Georg Gottlob, Alexander Leitsch , Daniele Mundici : Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings Springer 1993 Georg Gottlob: NP Trees and Carnap's Modal Logic FOCS 1993 : 42-51 Thomas Eiter , Georg Gottlob: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. IJCAI 1993 : 526-533 Georg Gottlob: The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic. IJCAI 1993 : 570-577 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 Georg Gottlob: Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract). LPNMR 1993 : 265 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 Georg Gottlob, Christian G. Fermüller : Removing Redundancy from a Clause. Artif. Intell. 61 (2): 263-289 (1993) Thomas Eiter , Georg Gottlob: Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete. Theor. Comput. Sci. 114 (2): 231-245 (1993) 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 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Formaiizing the Repair Process. ECAI 1992 : 709-713 Georg Gottlob: The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic. ECAI Workshop on Knowledge Representation and Reasoning 1992 : 133-144 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) Georg Gottlob, Michael Schrefl , Markus Stumptner : Selective Inheritance of Attribute Values in Relational Databases. Discrete Applied Mathematics 40 (2): 187-216 (1992) Thomas Eiter , Georg Gottlob: Reasoning with parsimonious and moderately grounded expansions. Fundam. Inform. 17 (1-2): 31-53 (1992) Georg Gottlob: Complexity Results for Nonmonotonic Logics. J. Log. Comput. 2 (3): 397-425 (1992) Georg Gottlob: On the Complexity of Clause Condensing. ÖGAI 1991 : 16-29 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Towards a Theory of the Repair Process. EPIA 1991 : 222-236 Georg Gottlob, Wolfgang Nejdl : Expert Systems in Engineering, Principles and Applications, International Workshop, Vienna, Austria, September 24-26, 1990, Proceedings Springer 1990 Stefano Ceri , Georg Gottlob, Letizia Tanca : Logic Programming and Databases Springer 1990 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Physical Impossibility Instead of Fault Models. AAAI 1990 : 331-336 Georg Gottlob, Gerti Kappel , Michael Schrefl : Semantics of Object-Oriented Data Models - The Evolving Algebra Approach. East/West Database Workshop 1990 : 144-160 Gerhard Friedrich , Georg Gottlob, Wolfgang Nejdl : Hypothesis Classification, Abductive Diagnosis and Therapy. Expert Systems in Engineering 1990 : 69-78 Georg Gottlob, Leonid Libkin : Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybern. 9 (4): 385-402 (1990) Georg Gottlob, Michael Schrefl , Markus Stumptner : On the Interaction between Transitive Closure and Functional Dependencies. MFDBS 1989 : 187-206 Stefano Ceri , Georg Gottlob, Letizia Tanca : What you Always Wanted to Know About Datalog (And Never Dared to Ask). IEEE Trans. Knowl. Data Eng. 1 (1): 146-166 (1989) Stefano Ceri , Georg Gottlob, Gio Wiederhold : Efficient Database Access from Prolog. IEEE Trans. Software Eng. 15 (2): 153-164 (1989) Stefano Ceri , Georg Gottlob, Letizia Tanca , Gio Wiederhold : Magic Semi-Joins. Inf. Process. Lett. 33 (2): 97-107 (1989) Stefano Ceri , Stefano Crespi-Reghizzi , Georg Gottlob, F. Lamperti , Luigi Lavazza , Letizia Tanca , Roberto Zicari : The Algres Project. EDBT 1988 : 551-555 Georg Gottlob, Roberto Zicari : Closed World Databases Opened Through Null Values. VLDB 1988 : 50-61 Georg Gottlob, Paolo Paolini , Roberto Zicari : Properties and Update Semantics of Consistent Views. ACM Trans. Database Syst. 13 (4): 486-524 (1988) Georg Gottlob: Computing Covers for Embedded Functional Dependencies. PODS 1987 : 58-69 Georg Gottlob: Subsumption and Implication. Inf. Process. Lett. 24 (2): 109-111 (1987) Georg Gottlob: On the Size of Nonredundant FD-Covers. Inf. Process. Lett. 24 (6): 355-360 (1987) Stefano Ceri , Georg Gottlob, Gio Wiederhold : Interfacing Relational Databases and Prolog Efficiently. Expert Database Conf. 1986 : 207-223 Stefano Ceri , Georg Gottlob, Luigi Lavazza : Translation and Optimization of Logic Queries: The Algebraic Approach. VLDB 1986 : 395-402 Stefano Ceri , Georg Gottlob: Normalization of Relations and PROLOG. Commun. ACM 29 (6): 524-544 (1986) Stefano Ceri , Georg Gottlob, Giuseppe Pelagatti : Taxonomy and formal properties of distributed joins. Inf. Syst. 11 (1): 25-40 (1986) Stefano Ceri , Georg Gottlob: Optimizing Joins between Two Partitioned Relations in Distributed Databases. J. Parallel Distrib. Comput. 3 (2): 183-205 (1986) Georg Gottlob, Alexander Leitsch : Fast Subsumption Algorithms. European Conference on Computer Algebra (2) 1985 : 64-77 Stefano Ceri , Georg Gottlob: Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries. IEEE Trans. Software Eng. 11 (4): 324-345 (1985) Georg Gottlob, Alexander Leitsch : On the Efficiency of Subsumption Algorithms J. ACM 32 (2): 280-295 (1985) S. Copelli , Georg Gottlob: Implementation of a Distributed File System on a Geographic Network of Personal Computers. DDSS 1984 : 203-219 Stefano Ceri , Georg Gottlob, Giuseppe Pelagatti : Joining Fragmented Relations in Distributed Databases. XP4.5 Workshop on Database Theory 1983 1 [ 108 ] [ 120 ] [ 121 ] [ 127 ] [ 128 ] [ 132 ] [ 152 ] [ 158 ] 2 [ 86 ] 3 [ 101 ] [ 117 ] [ 144 ] 4 [ 33 ] [ 54 ] [ 85 ] [ 129 ] 5 [ 142 ] 6 [ 152 ] 7 [ 1 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 25 ] 8 [ 89 ] 9 [ 2 ] 10 [ 16 ] 11 [ 92 ] [ 119 ] 12 [ 96 ] 13 [ 142 ] 14 [ 38 ] 15 [ 57 ] [ 74 ] 16 [ 30 ] [ 32 ] [ 33 ] [ 34 ] [ 35 ] [ 39 ] [ 41 ] [ 42 ] [ 44 ] [ 45 ] [ 47 ] [ 53 ] [ 54 ] [ 56 ] [ 58 ] [ 59 ] [ 62 ] [ 64 ] [ 67 ] [ 69 ] [ 72 ] [ 73 ] [ 76 ] [ 81 ] [ 83 ] [ 84 ] [ 85 ] [ 87 ] [ 88 ] [ 89 ] [ 90 ] [ 92 ] [ 93 ] [ 94 ] [ 97 ] [ 98 ] [ 101 ] [ 113 ] [ 115 ] [ 117 ] [ 119 ] [ 129 ] [ 131 ] [ 138 ] [ 141 ] [ 142 ] 17 [ 89 ] [ 142 ] 18 [ 40 ] 19 [ 120 ] [ 121 ] [ 127 ] [ 128 ] 20 [ 22 ] [ 24 ] [ 27 ] [ 37 ] [ 51 ] 21 [ 136 ] 22 [ 112 ] 23 [ 150 ] 24 [ 45 ] [ 76 ] [ 98 ] [ 113 ] 25 [ 96 ] 26 [ 122 ] [ 152 ] [ 158 ] 27 [ 143 ] 28 [ 142 ] 29 [ 142 ] 30 [ 23 ] [ 65 ] 31 [ 89 ] [ 137 ] [ 139 ] [ 140 ] [ 142 ] [ 145 ] [ 146 ] [ 151 ] [ 153 ] [ 154 ] [ 157 ] 32 [ 116 ] [ 156 ] 33 [ 16 ] 34 [ 9 ] [ 16 ] 35 [ 3 ] [ 5 ] [ 49 ] [ 95 ] 36 [ 66 ] [ 67 ] [ 69 ] [ 81 ] [ 84 ] [ 87 ] [ 89 ] [ 91 ] [ 99 ] [ 100 ] [ 101 ] [ 102 ] [ 103 ] [ 104 ] [ 109 ] [ 110 ] [ 111 ] [ 114 ] [ 117 ] [ 118 ] [ 124 ] [ 125 ] [ 126 ] [ 133 ] [ 134 ] [ 142 ] [ 147 ] 37 [ 21 ] 38 [ 138 ] 39 [ 53 ] [ 56 ] [ 58 ] [ 88 ] 40 [ 71 ] 41 [ 57 ] [ 74 ] 42 [ 89 ] 43 [ 50 ] 44 [ 80 ] 45 [ 49 ] [ 95 ] 46 [ 22 ] [ 24 ] [ 26 ] [ 27 ] [ 37 ] [ 51 ] 47 [ 71 ] 48 [ 14 ] 49 [ 106 ] [ 149 ] 50 [ 1 ] [ 7 ] 51 [ 142 ] 52 [ 89 ] [ 142 ] 53 [ 107 ] [ 130 ] [ 137 ] [ 145 ] [ 146 ] [ 151 ] [ 153 ] 54 [ 38 ] 55 [ 142 ] 56 [ 77 ] 57 [ 71 ] 58 [ 89 ] [ 91 ] [ 99 ] [ 100 ] [ 103 ] [ 104 ] [ 105 ] [ 109 ] [ 110 ] [ 111 ] [ 114 ] [ 118 ] [ 124 ] [ 125 ] [ 126 ] [ 133 ] [ 134 ] [ 135 ] [ 147 ] [ 150 ] 59 [ 20 ] [ 23 ] [ 31 ] [ 65 ] [ 77 ] 60 [ 116 ] [ 131 ] [ 156 ] 61 [ 112 ] 62 [ 105 ] [ 135 ] 63 [ 158 ] 64 [ 20 ] [ 31 ] 65 [ 71 ] [ 80 ] 66 [ 16 ] [ 17 ] [ 19 ] [ 25 ] 67 [ 75 ] 68 [ 70 ] 69 [ 66 ] [ 90 ] [ 94 ] [ 102 ] [ 136 ] 70 [ 92 ] [ 119 ] 71 [ 155 ] 72 [ 10 ] [ 17 ] [ 18 ] 73 [ 143 ] 74 [ 14 ] [ 15 ] [ 16 ] 75 [ 152 ]  ©2004 Association for Computing Machinery |
