OXFORD UNIVERSITY COMPUTING LABORATORY

Georg Gottlob: Publications

by date |  by title |  by type |  bibtex

[1]

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

Georg Gottlob, Marko Samer

CoRR, Vol. abs/cs/0701083. 2007.

[2]

Hypertree width and related hypergraph invariants

Isolde Adler, Georg Gottlob and Martin Grohe

Eur. J. Comb. Vol. 28, No. 8, pages 2167-2181. 2007.

[3]

A logical approach to multicut problems

Georg Gottlob, Stephanie Tien Lee

Inf. Process. Lett. Vol. 103, No. 4, pages 136-141. 2007.

[4]

Efficient Datalog Abduction through Bounded Treewidth

Georg Gottlob, Reinhard Pichler and Fang Wei

In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, July 22-26, 2007, Vancouver, British Columbia, Canada pages 1626-1631. AAAI Press, 2007.

[5]

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition

Georg Gottlob, Gianluigi Greco

In Jeffrey K. MacKie-Mason, David C. Parkes and Paul Resnick, editors, Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007 pages 152-161. ACM, 2007.

[6]

The Lixto Systems Applications in Business Intelligence and Semantic Web

Robert Baumgartner, Oliver Frölich and Georg Gottlob

In Enrico Franconi, Michael Kifer and Wolfgang May, editors, The Semantic Web: Research and Applications, 4th European Semantic Web Conference, ESWC 2007, Innsbruck, Austria, June 3-7, 2007, Proceedings Vol. 4519 of Lecture Notes in Computer Science, pages 16-26. Springer, 2007.

[7]

Complexity of Pure Equilibria in Bayesian Games

Georg Gottlob, Gianluigi Greco and Toni Mancini

In Manuela M. Veloso, editor, IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007 pages 1294-1299. 2007.

[8]

Conditional Constraint Satisfaction: Logical Foundations and Complexity

Georg Gottlob, Gianluigi Greco and Toni Mancini

In Manuela M. Veloso, editor, IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007 pages 88-93. 2007.

[9]

Generalized hypertree decompositions: np-hardness and tractable variants

Georg Gottlob, Zoltán Miklós and Thomas Schwentick

In Leonid Libkin, editor, Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China pages 13-22. ACM, 2007.

[10]

Monadic datalog over finite structures with bounded treewidth

Georg Gottlob, Reinhard Pichler and Fang Wei

In Leonid Libkin, editor, Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China pages 165-174. ACM, 2007.

[11]

Foundations of Rule-Based Query Answering

François Bry et al.

In Grigoris Antoniou et al. , editors, Reasoning Web, Third International Summer School 2007, Dresden, Germany, September 3-7, 2007, Tutorial Lectures Vol. 4636 of Lecture Notes in Computer Science, pages 1-153. Springer, 2007.

[12]

The DLV system for knowledge representation and reasoning

Nicola Leone et al.

ACM Trans. Comput. Log. Vol. 7, No. 3, pages 499-562. 2006.

[13]

Conjunctive Queries over Trees

Georg Gottlob, Christoph Koch and Klaus U. Schulz

CoRR, Vol. abs/cs/0602004. 2006.

[14]

Conjunctive queries over trees

Georg Gottlob, Christoph Koch and Klaus U. Schulz

J. ACM, Vol. 53, No. 2, pages 238-272. 2006.

[15]

Reasoning under minimal upper bounds in propositional logic

Thomas Eiter, Georg Gottlob

Theor. Comput. Sci. Vol. 369, No. 1-3, pages 82-115. 2006.

[16]

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning

Georg Gottlob, Reinhard Pichler and Fang Wei

In Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, July 16-20, 2006, Boston, Massachusetts, USA AAAI Press, 2006.

[17]

The Lixto Project: Exploring New Frontiers of Web Data Extraction

Julien Carme et al.

In BNCOD pages 1-15. 2006.

[18]

Tractable database design through bounded treewidth

Georg Gottlob, Reinhard Pichler and Fang Wei

In Stijn Vansummeren, editor, Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, Maryland, USA pages 124-133. ACM, 2006.

[19]

Data exchange: computing cores in polynomial time

Georg Gottlob, Alan Nash

In Stijn Vansummeren, editor, Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, Maryland, USA pages 40-49. ACM, 2006.

[20]

RDF Querying: Language Constructs and Evaluation Methods Compared

Tim Furche et al.

In Pedro Barahona et al. , editors, Reasoning Web, Second International Summer School 2006, Lisbon, Portugal, September 4-8, 2006, Tutorial Lectures Vol. 4126 of Lecture Notes in Computer Science, pages 1-52. Springer, 2006.

[21]

A Formal Comparison of Visual Web Wrapper Generators

Georg Gottlob, Christoph Koch

In Jir\'\i Wiedermann et al. , editors, SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Mer\'∈, Czech Republic, January 21-27, 2006, Proceedings Vol. 3831 of Lecture Notes in Computer Science, pages 30-48. Springer, 2006.

[22]

Complexity of propositional nested circumscription and nested abnormality theories

Marco Cadoli, Thomas Eiter and Georg Gottlob

ACM Trans. Comput. Log. Vol. 6, No. 2, pages 232-272. 2005.

[23]

Efficient algorithms for processing XPath queries

Georg Gottlob, Christoph Koch and Reinhard Pichler

ACM Trans. Database Syst. Vol. 30, No. 2, pages 444-491. 2005.

[24]

The complexity of XPath query evaluation and XML typing

Georg Gottlob et al.

J. ACM, Vol. 52, No. 2, pages 284-335. 2005.

[25]

Pure Nash Equilibria: Hard and Easy Games

Georg Gottlob, Gianluigi Greco and Francesco Scarcello

J. Artif. Intell. Res. (JAIR), Vol. 24, pages 357-406. 2005.

[26]

Web Data Extraction for Business Intelligence: The Lixto Approach

Georg Gottlob

In Gottfried Vossen et al. , editors, Datenbanksysteme in Business, Technologie und Web, 11. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS), Karlsruhe, 2.-4. März 2005 Vol. 65 of LNI, pages 30-47. GI, 2005.

[27]

Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic

Riccardo Rosati, Georg Gottlob

In Leslie Pack Kaelbling, Alessandro Saffiotti, editors, IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005 pages 1378-1383. Professional Book Center, 2005.

[28]

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

Georg Gottlob, Gianluigi Greco and Francesco Scarcello

In Leslie Pack Kaelbling, Alessandro Saffiotti, editors, IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005 pages 150-155. Professional Book Center, 2005.

[29]

The Personal Publication Reader

Fabian Abel et al.

In Yolanda Gil et al. , editors, The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings Vol. 3729 of Lecture Notes in Computer Science, pages 1050-1053. Springer, 2005.

[30]

Data Integration: a Challenging ASP Application

Nicola Leone et al.

In Chitta Baral et al. , editors, Logic Programming and Nonmonotonic Reasoning, 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings Vol. 3662 of Lecture Notes in Computer Science, pages 379-383. Springer, 2005.

[31]

Computing cores for data exchange: new algorithms and practical solutions

Georg Gottlob

In Chen Li, editor, Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA pages 148-159. ACM, 2005.

[32]

Information Extraction for the Semantic Web

Robert Baumgartner et al.

In Norbert Eisinger, Jan Maluszynski, editors, Reasoning Web, First International Summer School 2005, Msida, Malta, July 25-29, 2005, Tutorial Lectures Vol. 3564 of Lecture Notes in Computer Science, pages 275-289. Springer, 2005.

[33]

Boosting Information Integration: The INFOMIX System

Nicola Leone et al.

In Andrea Cal\`\i et al. , editors, Proceedings of the Thirteenth Italian Symposium on Advanced Database Systems, SEBD 2005, Brixen-Bressanone (near Bozen-Bolzano), Italy, June 19-22, 2005 pages 55-66. 2005.

[34]

The INFOMIX system for advanced integration of incomplete and inconsistent data

Nicola Leone et al.

In Fatma Özcan, editor, Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, 2005 pages 915-917. ACM, 2005.

[35]

Hypertree Decompositions: Structure, Algorithms, and Applications

Georg Gottlob et al.

In Dieter Kratsch, editor, Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers Vol. 3787 of Lecture Notes in Computer Science, pages 1-15. Springer, 2005.

[36]

Integrating Semi-structured Data into Business Applications: A Web Intelligence Example

Robert Baumgartner et al.

In Klaus-Dieter Althoff et al. , editors, Professional Knowledge Management, Third Biennial Conference, WM 2005, Kaiserslautern, Germany, April 10-13, 2005, Revised Selected Papers Vol. 3782 of Lecture Notes in Computer Science, pages 469-482. Springer, 2005.

[37]

Monadic datalog and the expressive power of languages for Web information extraction

Georg Gottlob, Christoph Koch

J. ACM, Vol. 51, No. 1, pages 74-113. 2004.

[38]

Existential second-order logic over graphs: Charting the tractability frontier

Georg Gottlob, Phokion G. Kolaitis and Thomas Schwentick

J. ACM, Vol. 51, No. 2, pages 312-362. 2004.

[39]

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

Georg Gottlob, Reinhard Pichler

SIAM J. Comput. Vol. 33, No. 2, pages 351-378. 2004.

[40]

Logic-based Web Information Extraction

Georg Gottlob, Christoph Koch

SIGMOD Record, Vol. 33, No. 2, pages 87-94. 2004.

[41]

2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword

Georg Gottlob, Miki Hermann and Michaël Rusinowitch

Theory Comput. Syst. Vol. 37, No. 6, pages 639-640. 2004.

[42]

Hypergraph Transversals

Georg Gottlob

In Dietmar Seipel, Jose Maria Turull Torres, editors, Foundations of Information and Knowledge Systems, Third International Symposium, FoIKS 2004, Wilhelminenburg Castle, Austria, February 17-20, 2004, Proceedings Vol. 2942 of Lecture Notes in Computer Science, pages 1-5. Springer, 2004.

[43]

Second-Order Logic over Finite Structures - Report on a Research Programme

Georg Gottlob

In David A. Basin, Michaël Rusinowitch, editors, Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings Vol. 3097 of Lecture Notes in Computer Science, pages 229-243. Springer, 2004.

[44]

The Lixto Data Extraction Project - Back and Forth between Theory and Practice

Georg Gottlob et al.

In Alin Deutsch, editor, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France pages 1-12. ACM, 2004.

[45]

Conjunctive Queries over Trees

Georg Gottlob, Christoph Koch and Klaus U. Schulz

In Alin Deutsch, editor, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France pages 189-200. ACM, 2004.

[46]

Interactively Adding Web Service Interfaces to Existing Web Applications

Robert Baumgartner et al.

In 2004 Symposium on Applications and the Internet (SAINT 2004), 26-30 January 2004, Tokyo, Japan pages 74-80. IEEE Computer Society, 2004.

[47]

Advances in Databases and Information Systems, 8th East European Conference, ADBIS 2004, Budapest, Hungary, September 22-25, 2004, Proceesing

Georg Gottlob, András A. Benczúr and János Demetrovics, editors

Vol. 3255 of Lecture Notes in Computer Science. Springer. 2004.

[48]

A Formal Comparison of Visual Web Wrapper Generators

Georg Gottlob, Christoph Koch

CoRR, Vol. cs.DB/0310012. 2003.

[49]

On the complexity of single-rule datalog queries

Georg Gottlob, Christos H. Papadimitriou

Inf. Comput. Vol. 183, No. 1, pages 104-122. 2003.

[50]

Guest Editor's Foreword

Georg Gottlob

J. Comput. Syst. Sci. Vol. 66, No. 1, pages 1. 2003.

[51]

Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

Georg Gottlob, Nicola Leone and Francesco Scarcello

J. Comput. Syst. Sci. Vol. 66, No. 4, pages 775-808. 2003.

[52]

New Results on Monotone Dualization and Generating Hypergraph Transversals

Thomas Eiter, Georg Gottlob and Kazuhisa Makino

SIAM J. Comput. Vol. 32, No. 2, pages 514-537. 2003.

[53]

XPath Processing in a Nutshell

Georg Gottlob, Christoph Koch and Reinhard Pichler

SIGMOD Record, Vol. 32, No. 1, pages 12-19. 2003.

[54]

XPath processing in a nutshell

Georg Gottlob, Christoph Koch and Reinhard Pichler

SIGMOD Record, Vol. 32, No. 2, pages 21-27. 2003.

[55]

XPath Query Processing

Georg Gottlob, Christoph Koch

In Georg Lausen, Dan Suciu, editors, Database Programming Languages, 9th International Workshop, DBPL 2003, Potsdam, Germany, September 6-8, 2003, Revised Papers Vol. 2921 of Lecture Notes in Computer Science, pages 20. Springer, 2003.

[56]

XPath Query Evaluation: Improving Time and Space Efficiency

Georg Gottlob, Christoph Koch and Reinhard Pichler

In Umeshwar Dayal, Krithi Ramamritham and T. M. Vijayaraman, editors, Proceedings of the 19th International Conference on Data Engineering, March 5-8, 2003, Bangalore, India pages 379-390. IEEE Computer Society, 2003.

[57]

Web Information Acquisition with Lixto Suite

Robert Baumgartner et al.

In Umeshwar Dayal, Krithi Ramamritham and T. M. Vijayaraman, editors, Proceedings of the 19th International Conference on Data Engineering, March 5-8, 2003, Bangalore, India pages 747-749. IEEE Computer Society, 2003.

[58]

Visual Programming of Web Data Aggregation Applications

Robert Baumgartner, Georg Gottlob and Marcus Herzog

In Subbarao Kambhampati, Craig A. Knoblock, editors, Proceedings of IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), August 9-10, 2003, Acapulco, Mexico pages 137-142. 2003.

[59]

The complexity of XPath query evaluation

Georg Gottlob, Christoph Koch and Reinhard Pichler

In Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA pages 179-190. ACM, 2003.

[60]

Pure Nash equilibria: hard and easy games

Georg Gottlob, Gianluigi Greco and Francesco Scarcello

In Joseph Y. Halpern, Moshe Tennenholtz, editors, Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), Bloomington, Indiana, USA, June 20-22, 2003 pages 215-230. ACM, 2003.

[61]

IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003

Georg Gottlob, Toby Walsh, editors

Morgan Kaufmann. 2003.

[62]

Datalog LITE: a deductive query language with linear time model checking

Georg Gottlob, Erich Grädel and Helmut Veith

ACM Trans. Comput. Log. Vol. 3, No. 1, pages 42-79. 2002.

[63]

Fixed-parameter complexity in AI and nonmonotonic reasoning

Georg Gottlob, Francesco Scarcello and Martha Sideri

Artif. Intell. Vol. 138, No. 1-2, pages 55-86. 2002.

[64]

Complexity of Nested Circumscription and Nested Abnormality Theories

Marco Cadoli, Thomas Eiter and Georg Gottlob

CoRR, Vol. cs.AI/0207072. 2002.

[65]

The DLV System for Knowledge Representation and Reasoning

Nicola Leone et al.

CoRR, Vol. cs.AI/0211004. 2002.

[66]

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

Georg Gottlob, Christoph Koch

CoRR, Vol. cs.DB/0211020. 2002.

[67]

New Results on Monotone Dualization and Generating Hypergraph Transversals

Thomas Eiter, Georg Gottlob and Kazuhisa Makino

CoRR, Vol. cs.DS/0204009. 2002.

[68]

Hypertree Decompositions and Tractable Queries

Georg Gottlob, Nicola Leone and Francesco Scarcello

J. Comput. Syst. Sci. Vol. 64, No. 3, pages 579-627. 2002.

[69]

Computing LOGCFL certificates

Georg Gottlob, Nicola Leone and Francesco Scarcello

Theor. Comput. Sci. Vol. 270, No. 1-2, pages 761-777. 2002.

[70]

Propositional default logics made easier: computational complexity of model checking

Robert Baumgartner, Georg Gottlob

Theor. Comput. Sci. Vol. 289, No. 1, pages 591-627. 2002.

[71]

Multiagent Compromises, Joint Fixpoints, and Stable Models

Francesco Buccafurri, Georg Gottlob

In Antonis C. Kakas, Fariba Sadri, editors, Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I Vol. 2407 of Lecture Notes in Computer Science, pages 561-585. Springer, 2002.

[72]

Combining hypertree, bicomp, and hinge decomposition

Georg Gottlob, Martin Hutle and Franz Wotawa

In Frank van Harmelen, editor, Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI'2002, Lyon, France, July 2002 pages 161-165. IOS Press, 2002.

[73]

The DLV System

Nicola Leone et al.

In Sergio Flesca et al. , editors, Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings Vol. 2424 of Lecture Notes in Computer Science, pages 537-540. Springer, 2002.

[74]

Hypergraph Transversal Computation and Related Problems in Logic and AI

Thomas Eiter, Georg Gottlob

In Sergio Flesca et al. , editors, Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings Vol. 2424 of Lecture Notes in Computer Science, pages 549-564. Springer, 2002.

[75]

Monadic Queries over Tree-Structured Data

Georg Gottlob, Christoph Koch

In 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings pages 189-202. IEEE Computer Society, 2002.

[76]

Visual Data Extraction Through Visual Logic Programming

Georg Gottlob

In Salem Benferhat, Enrico Giunchiglia, editors, 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), April 19-21, Toulouse, France, Proceedings pages 4. 2002.

[77]

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction

Georg Gottlob, Christoph Koch

In Lucian Popa, editor, Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA pages 17-28. ACM, 2002.

[78]

New results on monotone dualization and generating hypergraph transversals

Thomas Eiter, Georg Gottlob and Kazuhisa Makino

In STOC pages 14-22. 2002.

[79]

Efficient Algorithms for Processing XPath Queries

Georg Gottlob, Christoph Koch and Reinhard Pichler

In VLDB 2002, Proceedings of 28th International Conference on Very Large Data Bases, August 20-23, 2002, Hong Kong, China pages 95-106. Morgan Kaufmann, 2002.

[80]

Complexity and expressive power of logic programming

Evgeny Dantsin et al.

ACM Comput. Surv. Vol. 33, No. 3, pages 374-425. 2001.

[81]

Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models

Georg Gottlob, Reinhard Pichler

Inf. Comput. Vol. 165, No. 2, pages 183-207. 2001.

[82]

The complexity of acyclic conjunctive queries

Georg Gottlob, Nicola Leone and Francesco Scarcello

J. ACM, Vol. 48, No. 3, pages 431-498. 2001.

[83]

On ACTL Formulas Having Linear Counterexamples

Francesco Buccafurri et al.

J. Comput. Syst. Sci. Vol. 62, No. 3, pages 463-515. 2001.

[84]

Second-Order Logic over Strings: Regular and Non-regular Fragments

Thomas Eiter, Georg Gottlob and Thomas Schwentick

In Werner Kuich, Grzegorz Rozenberg and Arto Salomaa, editors, Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers Vol. 2295 of Lecture Notes in Computer Science, pages 37-56. Springer, 2001.

[85]

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

Georg Gottlob, Reinhard Pichler

In Fernando Orejas, Paul G. Spirakis and Jan van Leeuwen, editors, Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings Vol. 2076 of Lecture Notes in Computer Science, pages 708-719. Springer, 2001.

[86]

Complexity of Nested Circumscription and Abnormality Theories

Marco Cadoli, Thomas Eiter and Georg Gottlob

In Bernhard Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001 pages 169-174. Morgan Kaufmann, 2001.

[87]

The Elog Web Extraction Language

Robert Baumgartner, Sergio Flesca and Georg Gottlob

In Robert Nieuwenhuis, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings Vol. 2250 of Lecture Notes in Computer Science, pages 548-560. Springer, 2001.

[88]

Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto

Robert Baumgartner, Sergio Flesca and Georg Gottlob

In Thomas Eiter, Wolfgang Faber and Miroslaw Truszczynski, editors, Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings Vol. 2173 of Lecture Notes in Computer Science, pages 21-41. Springer, 2001.

[89]

Hypertree Decompositions: A Survey

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Jiri Sgall, Ales Pultr and Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings Vol. 2136 of Lecture Notes in Computer Science, pages 37-57. Springer, 2001.

[90]

Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA ACM, 2001.

[91]

Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width

Georg Gottlob, Nicola Leone and Francesco Scarcello

In SEBD pages 147-154. 2001.

[92]

The Lixto Wrapper Generation Tool

Georg Gottlob

In SEBD pages 3-10. 2001.

[93]

InfoPipes: A Flexible Framework for M-Commerce Applications

Marcus Herzog, Georg Gottlob

In Fabio Casati, Dimitrios Georgakopoulos and Ming-Chien Shan, editors, Technologies for E-Services, Second International Workshop, TES 2001, Rome, Italy, September 14-15, 2001, Proceedings Vol. 2193 of Lecture Notes in Computer Science, pages 175-186. Springer, 2001.

[94]

Visual Web Information Extraction with Lixto

Robert Baumgartner, Sergio Flesca and Georg Gottlob

In Peter M. G. Apers et al. , editors, VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, September 11-14, 2001, Roma, Italy pages 119-128. Morgan Kaufmann, 2001.

[95]

Supervised Wrapper Generation with Lixto

Robert Baumgartner, Sergio Flesca and Georg Gottlob

In Peter M. G. Apers et al. , editors, VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, September 11-14, 2001, Roma, Italy pages 715-716. Morgan Kaufmann, 2001.

[96]

A comparison of structural CSP decomposition methods

Georg Gottlob, Nicola Leone and Francesco Scarcello

Artif. Intell. Vol. 124, No. 2, pages 243-282. 2000.

[97]

Existential second-order logic over strings

Thomas Eiter, Yuri Gurevich and Georg Gottlob

J. ACM, Vol. 47, No. 1, pages 77-131. 2000.

[98]

Existential Second-Order Logic over Graphs: Charting the Tractability Frontier

Georg Gottlob, Phokion G. Kolaitis and Thomas Schwentick

In FOCS pages 664-674. 2000.

[99]

On the Complexity of Theory Curbing

Thomas Eiter, Georg Gottlob

In Michel Parigot, Andrei Voronkov, editors, Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, Proceedings Vol. 1955 of Lecture Notes in Computer Science, pages 1-19. Springer, 2000.

[100]

Succinctness as a Source of Complexity in Logical Formalisms

Georg Gottlob, Nicola Leone and Helmut Veith

Ann. Pure Appl. Logic, Vol. 97, No. 1-3, pages 231-260. 1999.

[101]

Enhancing Model Checking in Verification by AI Techniques

Francesco Buccafurri et al.

Artif. Intell. Vol. 112, No. 1-2, pages 57-104. 1999.

[102]

On the Complexity of Some Inductive Logic Programming Problems

Georg Gottlob, Nicola Leone and Francesco Scarcello

New Generation Comput. Vol. 17, No. 1, pages 53-75. 1999.

[103]

On Tractable Queries and Constraints

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Trevor J. M. Bench-Capon, Giovanni Soda and A. Min Tjoa, editors, Database and Expert Systems Applications, 10th International Conference, DEXA '99, Florence, Italy, August 30 - September 3, 1999, Proceedings Vol. 1677 of Lecture Notes in Computer Science, pages 1-15. Springer, 1999.

[104]

Computing LOGCFL Certificates

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Jir\'\i Wiedermann, Peter van Emde Boas and Mogens Nielsen, editors, Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings Vol. 1644 of Lecture Notes in Computer Science, pages 361-371. Springer, 1999.

[105]

A Comparison of Structural CSP Decomposition Methods

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages pages 394-399. Morgan Kaufmann, 1999.

[106]

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases

Robert Baumgartner, Georg Gottlob

In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages pages 64-69. Morgan Kaufmann, 1999.

[107]

Working with Arms: Complexity Results on Atomic Representations of Herbrand Models

Georg Gottlob, Reinhard Pichler

In LICS pages 306-315. 1999.

[108]

On the Complexity of Single-Rule Datalog Queries

Georg Gottlob, Christos H. Papadimitriou

In Harald Ganzinger, David A. McAllester and Andrei Voronkov, editors, Logic Programming and Automated Reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings Vol. 1705 of Lecture Notes in Computer Science, pages 201-222. Springer, 1999.

[109]

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

Georg Gottlob, Francesco Scarcello and Martha Sideri

In Michael Gelfond, Nicola Leone and Gerald Pfeifer, editors, Logic Programming and Nonmonotonic Reasoning, 5th International Conference, LPNMR'99, El Paso, Texas, USA, December 2-4, 1999, Proceedings Vol. 1730 of Lecture Notes in Computer Science, pages 1-18. Springer, 1999.

[110]

Hypertree Decompositions and Tractable Queries

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania pages 21-32. ACM Press, 1999.

[111]

Hypertree Decompositions and Tractable Queries

Georg Gottlob, Nicola Leone and Francesco Scarcello

In SEBD pages 275-289. 1999.

[112]

Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings

Georg Gottlob, Etienne Grandjean and Katrin Seyr, editors

Vol. 1584 of Lecture Notes in Computer Science. Springer. 1999.

[113]

Hypertree Decompositions and Tractable Queries

Georg Gottlob, Nicola Leone and Francesco Scarcello

CoRR, Vol. cs.DB/9812022. 1998.

[114]

On the Expressiveness of Frame Satisfiability and Fragments of Second-Order Logic

Thomas Eiter, Georg Gottlob

J. Symb. Log. Vol. 63, No. 1, pages 73-82. 1998.

[115]

Capturing Relativized Complexity Classes without Order

Anuj Dawar, Georg Gottlob and Lauri Hella

Math. Log. Q. Vol. 44, pages 109-122. 1998.

[116]

The Complexity of Acyclic Conjunctive Queries

Georg Gottlob, Nicola Leone and Francesco Scarcello

In FOCS pages 706-715. 1998.

[117]

Existential Second-Order Logic over Strings

Thomas Eiter, Georg Gottlob and Yuri Gurevich

In LICS pages 16-27. 1998.

[118]

Disjunctive Datalog

Thomas Eiter, Georg Gottlob and Heikki Mannila

ACM Trans. Database Syst. Vol. 22, No. 3, pages 364-418. 1997.

[119]

Semantics and Complexity of Abduction from Default Theories

Thomas Eiter, Georg Gottlob and Nicola Leone

Artif. Intell. Vol. 90, No. 1-2, pages 177-223. 1997.

[120]

Well-Founded Semantics for Default Logic

Gerhard Brewka, Georg Gottlob

Fundam. Inform. Vol. 31, No. 3/4, pages 221-236. 1997.

[121]

Default Logic as a Query Language

Marco Cadoli, Thomas Eiter and Georg Gottlob

IEEE Trans. Knowl. Data Eng. Vol. 9, No. 3, pages 448-463. 1997.

[122]

On the Indiscernibility of Individuals in Logic Programming

Thomas Eiter, Georg Gottlob and Nicola Leone

J. Log. Comput. Vol. 7, No. 6, pages 805-824. 1997.

[123]

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions

Thomas Eiter, Georg Gottlob

J. Log. Program. Vol. 33, No. 2, pages 167-178. 1997.

[124]

Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures

Georg Gottlob

J. Symb. Log. Vol. 62, No. 2, pages 545-574. 1997.

[125]

Abduction from Logic Programs: Semantics and Complexity

Thomas Eiter, Georg Gottlob and Nicola Leone

Theor. Comput. Sci. Vol. 189, No. 1-2, pages 129-177. 1997.

[126]

Generalized Quantifiers in Logic Programs

Thomas Eiter, Georg Gottlob and Helmut Veith

In Jouko A. Väänänen, editor, Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-en-Provence, France, August 11-22, 1997, Revised Lectures Vol. 1754 of Lecture Notes in Computer Science, pages 72-98. Springer, 1997.

[127]

The Complexity Class Theta_2^p: Recent Results and Applications in AI and Modal Logic

Thomas Eiter, Georg Gottlob

In Bogdan S. Chlebus, Ludwik Czaja, editors, Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Kraków, Poland, September 1-3, 1997, Proceedings Vol. 1279 of Lecture Notes in Computer Science, pages 1-18. Springer, 1997.

[128]

Complexity and Expressive Power of Logic Programming

Evgeny Dantsin et al.

In IEEE Conference on Computational Complexity pages 82-101. 1997.

[129]

On the Complexity of Some Inductive Logic Programming Problems

Georg Gottlob, Nicola Leone and Francesco Scarcello

In Nada Lavrac, Saso Dzeroski, editors, Inductive Logic Programming, 7th International Workshop, ILP-97, Prague, Czech Republic, September 17-20, 1997, Proceedings Vol. 1297 of Lecture Notes in Computer Science, pages 17-32. Springer, 1997.

[130]

Modular Logic Programming and Generalized Quantifiers

Thomas Eiter, Georg Gottlob and Helmut Veith

In Jürgen Dix, Ulrich Furbach and Anil Nerode, editors, Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings Vol. 1265 of Lecture Notes in Computer Science, pages 290-309. Springer, 1997.

[131]

The dlv System: Model Generator and Advanced Frontends (system description)

Simona Citrigno et al.

In WLP pages 0-. 1997.

[132]

Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings

Georg Gottlob, Alexander Leitsch and Daniele Mundici, editors

Vol. 1289 of Lecture Notes in Computer Science. Springer. 1997.

[133]

Extending Object-Oriented Systems with Roles

Georg Gottlob, Michael Schrefl and Brigitte Röck

ACM Trans. Inf. Syst. Vol. 14, No. 3, pages 268-296. 1996.

[134]

Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems

Thomas Eiter, Georg Gottlob and Yuri Gurevich

Ann. Pure Appl. Logic, Vol. 78, No. 1-3, pages 111-125. 1996.

[135]

Approximating the Stable Model Semantics is Hard

Georg Gottlob, Miroslaw Truszczynski

Fundam. Inform. Vol. 28, No. 1-2, pages 123-128. 1996.

[136]

Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations

Jürgen Dix, Georg Gottlob and V. Wiktor Marek

Fundam. Inform. Vol. 28, No. 1-2, pages 87-100. 1996.

[137]

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

Thomas Eiter, Georg Gottlob

J. Comput. Syst. Sci. Vol. 53, No. 3, pages 497-512. 1996.

[138]

Mächtigkeit von Logikprogrammierung über Datenbanken

Thomas Eiter, Georg Gottlob

KI, Vol. 10, No. 3, pages 32-39. 1996.

[139]

A Non-Ground Realization of the Stable and Well-Founded Semantics

Georg Gottlob et al.

Theor. Comput. Sci. Vol. 166, No. 1{\&}2, pages 221-262. 1996.

[140]

The PARK Semantics for Active Rules

Georg Gottlob, Guido Moerkotte and V. S. Subrahmanian

In Peter M. G. Apers, Mokrane Bouzeghoub and Georges Gardarin, editors, Advances in Database Technology - EDBT'96, 5th International Conference on Extending Database Technology, Avignon, France, March 25-29, 1996, Proceedings Vol. 1057 of Lecture Notes in Computer Science, pages 35-55. Springer, 1996.

[141]

Collapsing Oracle-Tape Hierarchies

Georg Gottlob

In IEEE Conference on Computational Complexity pages 33-42. 1996.

[142]

Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract)

Georg Gottlob

In KR pages 647-649. 1996.

[143]

On the Computational Cost of Disjunctive Logic Programming: Propositional Case

Thomas Eiter, Georg Gottlob

Ann. Math. Artif. Intell. Vol. 15, No. 3-4, pages 289-323. 1995.

[144]

The Complexity of Default Reasoning under the Stationary Fixed Point Semantics

Georg Gottlob

Inf. Comput. Vol. 121, No. 1, pages 81-92. 1995.

[145]

The Complexity of Logic-Based Abduction

Thomas Eiter, Georg Gottlob

J. ACM, Vol. 42, No. 1, pages 3-42. 1995.

[146]

NP Trees and Carnap's Modal Logic

Georg Gottlob

J. ACM, Vol. 42, No. 2, pages 421-457. 1995.

[147]

Translating Default Logic into Standard Autoepistemic Logic

Georg Gottlob

J. ACM, Vol. 42, No. 4, pages 711-740. 1995.

[148]

Identifying the Minimal Transversals of a Hypergraph and Related Problems

Thomas Eiter, Georg Gottlob

SIAM J. Comput. Vol. 24, No. 6, pages 1278-1304. 1995.

[149]

Semantics and Complexity of Abduction from Default Theories

Thomas Eiter, Georg Gottlob and Nicola Leone

In IJCAI (1) pages 870-877. 1995.

[150]

Relativized Logspace and Generalized Quantifiers over Finite Structures

Georg Gottlob

In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, 26-29 June 1995, San Diego, California, USA pages 65-78. IEEE Computer Society, 1995.

[151]

Complexity Results for Abductive Logic Programming

Thomas Eiter, Georg Gottlob and Nicola Leone

In V. Wiktor Marek, Anil Nerode, editors, Logic Programming and Nonmonotonic Reasoning, Third International Conference, LPNMR'95, Lexington, KY, USA, June 26-28, 1995, Proceedings Vol. 928 of Lecture Notes in Computer Science, pages 1-14. Springer, 1995.

[152]

Second Order Logic and the Weak Exponential Hierarchies

Georg Gottlob, Nicola Leone and Helmut Veith

In Jir\'\i Wiedermann, Petr Hájek, editors, Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings Vol. 969 of Lecture Notes in Computer Science, pages 66-81. Springer, 1995.

[153]

The Evolving Algebra Semantics of Class and Role Hierarchies

Georg Gottlob, Gerti Kappel and Michael Schrefl

In Leonid Libkin, Bernhard Thalheim, editors, Semantics in Databases, Selected Papers from a Workshop, Prague, Czech Republic, 1995 Vol. 1358 of Lecture Notes in Computer Science, pages 92-113. Springer, 1995.

[154]

Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings

Georg Gottlob, Moshe Y. Vardi, editors

Vol. 893 of Lecture Notes in Computer Science. Springer. 1995.

[155]

Formalizing the Repair Process - Extended Report

Gerhard Friedrich, Georg Gottlob and Wolfgang Nejdl

Ann. Math. Artif. Intell. Vol. 11, No. 1-4, pages 187-201. 1994.

[156]

Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity

Georg Gottlob, Zhang Mingyi

Artif. Intell. Vol. 69, No. 1-2, pages 329-345. 1994.

[157]

Disjunctive Logic Programming over Finite Structures

Thomas Eiter, Georg Gottlob and Heikki Mannila

In GI Jahrestagung pages 69-73. 1994.

[158]

Causal Models of Disjunctive Logic Programs

Jürgen Dix, Georg Gottlob and V. Wiktor Marek

In ICLP pages 290-302. 1994.

[159]

Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics

Thomas Eiter, Georg Gottlob and Heikki Mannila

In Kai von Luck, Heinz Marburger, editors, Management and Processing of Complex Data Structures, Third Workshop on Information Systems and Artificial Intelligence, Hamburg, Germany, February 28 - March 2, 1994, Proceedings Vol. 777 of Lecture Notes in Computer Science, pages 83-103. Springer, 1994.

[160]

From Carnap's Modal Logic to Autoepistemic Logic

Georg Gottlob

In Craig MacNish, David Pearce and Lu\'\is Moniz Pereira, editors, Logics in Artificial Intelligence, European Workshop, JELIA '94, York, UK, September 5-8, 1994, Proceedings Vol. 838 of Lecture Notes in Computer Science, pages 1-18. Springer, 1994.

[161]

Default Logic as a Query Language

Marco Cadoli, Thomas Eiter and Georg Gottlob

In KR pages 99-108. 1994.

[162]

Adding Disjunction to Datalog

Thomas Eiter, Georg Gottlob and Heikki Mannila

In Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota pages 267-278. ACM Press, 1994.

[163]

Complexity and Expressive Power of Disjunctive Logic Programming

Georg Gottlob

In SLP pages 23-42. 1994.

[164]

The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

Georg Gottlob

In Gerhard Lakemeyer, Bernhard Nebel, editors, Foundation of Knowledge Representation and Reasoning (the book grew out of an ECAI-92 workshop) Vol. 810 of Lecture Notes in Computer Science, pages 133-144. Springer, 1994.

[165]

Removing Redundancy from a Clause

Georg Gottlob, Christian G. Fermüller

Artif. Intell. Vol. 61, No. 2, pages 263-289. 1993.

[166]

Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete

Thomas Eiter, Georg Gottlob

Theor. Comput. Sci. Vol. 114, No. 2, pages 231-245. 1993.

[167]

NP Trees and Carnap's Modal Logic

Georg Gottlob

In 34th Annual Symposium on Foundations of Computer Science, 3-5 November 1993, Palo Alto, California, USA pages 42-51. IEEE, 1993.

[168]

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions

Thomas Eiter, Georg Gottlob

In IJCAI pages 526-533. 1993.

[169]

The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic

Georg Gottlob

In IJCAI pages 570-577. 1993.

[170]

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information

Thomas Eiter, Georg Gottlob and Yuri Gurevich

In IJCAI pages 634-639. 1993.

[171]

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics

Thomas Eiter, Georg Gottlob

In ILPS pages 266-278. 1993.

[172]

Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract)

Georg Gottlob

In LPNMR pages 265. 1993.

[173]

Complexity Aspects of Various Semantics for Disjunctive Databases

Thomas Eiter, Georg Gottlob

In Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 25-28, 1993, Washington, DC pages 158-167. ACM Press, 1993.

[174]

The Complexity of Logic-Based Abduction

Thomas Eiter, Georg Gottlob

In Patrice Enjalbert, Alain Finkel and Klaus W. Wagner, editors, STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings Vol. 665 of Lecture Notes in Computer Science, pages 70-79. Springer, 1993.

[175]

Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings

Georg Gottlob, Alexander Leitsch and Daniele Mundici, editors

Vol. 713 of Lecture Notes in Computer Science. Springer. 1993.

[176]

An Efficient Method for Eliminating Varying Predicates from a Circumscription

Marco Cadoli, Thomas Eiter and Georg Gottlob

Artif. Intell. Vol. 54, No. 2, pages 397-410. 1992.

[177]

On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals

Thomas Eiter, Georg Gottlob

Artif. Intell. Vol. 57, No. 2-3, pages 227-270. 1992.

[178]

Selective Inheritance of Attribute Values in Relational Databases

Georg Gottlob, Michael Schrefl and Markus Stumptner

Discrete Applied Mathematics, Vol. 40, No. 2, pages 187-216. 1992.

[179]

Reasoning with parsimonious and moderately grounded expansions

Thomas Eiter, Georg Gottlob

Fundam. Inform. Vol. 17, No. 1-2, pages 31-53. 1992.

[180]

Complexity Results for Nonmonotonic Logics

Georg Gottlob

J. Log. Comput. Vol. 2, No. 3, pages 397-425. 1992.

[181]

Complexity of Propositional Knowledge Base Revision

Thomas Eiter, Georg Gottlob

In Gérard Comyn, Matthias Jarke and Suryanarayana M. Sripada, editors, CNKBS'92, Proceedings of the First Compulog Net Meeting on Knowledge Bases, Munich, Germany, 6-7 February 1992 Vol. ECRC-92-2, pages 38-40. European Computer-Industry Research Centre, Munich, 1992.

[182]

Formaiizing the Repair Process

Gerhard Friedrich, Georg Gottlob and Wolfgang Nejdl

In ECAI pages 709-713. 1992.

[183]

On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals

Thomas Eiter, Georg Gottlob

In Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, California pages 261-273. ACM Press, 1992.

[184]

Complexity Results for Logic-Based Abduction

Thomas Eiter, Georg Gottlob

In Structural Complexity and Recursion-theoretic methods in Logic-Programming pages 29-44. 1992.

[185]

Advances in Database Technology - EDBT'92, 3rd International Conference on Extending Database Technology, Vienna, Austria, March 23-27, 1992, Proceedings

Alain Pirotte, Claude Delobel and Georg Gottlob, editors

Vol. 580 of Lecture Notes in Computer Science. Springer. 1992.

[186]

On the Complexity of Clause Condensing

Georg Gottlob

In Hermann Kaindl, editor, Proc. 7th Austrian Conference on Artificial Intelligence, ÖGAI-91, Wien, 24.-27. September 1991 Vol. 287 of Informatik-Fachberichte, pages 16-29. Springer, 1991.

[187]

Towards a Theory of the Repair Process

Gerhard Friedrich, Georg Gottlob and Wolfgang Nejdl

In Pedro Barahona, Lu\'\is Moniz Pereira and António Porto, editors, EPIA 91, 5th Portuguese Conference on Artificial Intelligence, Albufeira, Portugal, October 1-3, 1991, Proceedings Vol. 541 of Lecture Notes in Computer Science, pages 222-236. Springer, 1991.

[188]

Logic Programming and Databases

Stefano Ceri, Georg Gottlob and Letizia Tanca

Springer. 1990.

[189]

Investigation on Armstrong relations, dependency inference, and excluded functional dependencies

Georg Gottlob, Leonid Libkin

Acta Cybern. Vol. 9, No. 4, pages 385-402. 1990.

[190]

Physical Impossibility Instead of Fault Models

Gerhard Friedrich, Georg Gottlob and Wolfgang Nejdl

In AAAI pages 331-336. 1990.

[191]

Semantics of Object-Oriented Data Models - The Evolving Algebra Approach

Georg Gottlob, Gerti Kappel and Michael Schrefl

In East/West Database Workshop pages 144-160. 1990.

[192]

Hypothesis Classification, Abductive Diagnosis and Therapy

Gerhard Friedrich, Georg Gottlob and Wolfgang Nejdl

In Georg Gottlob, Wolfgang Nejdl, editors, Expert Systems in Engineering, Principles and Applications, International Workshop, Vienna, Austria, September 24-26, 1990, Proceedings Vol. 462 of Lecture Notes in Computer Science, pages 69-78. Springer, 1990.

[193]

Expert Systems in Engineering, Principles and Applications, International Workshop, Vienna, Austria, September 24-26, 1990, Proceedings

Georg Gottlob, Wolfgang Nejdl, editors

Vol. 462 of Lecture Notes in Computer Science. Springer. 1990.

[194]

What you Always Wanted to Know About Datalog (And Never Dared to Ask)

Stefano Ceri, Georg Gottlob and Letizia Tanca

IEEE Trans. Knowl. Data Eng. Vol. 1, No. 1, pages 146-166. 1989.

[195]

Efficient Database Access from Prolog

Stefano Ceri, Georg Gottlob and Gio Wiederhold

IEEE Trans. Software Eng. Vol. 15, No. 2, pages 153-164. 1989.

[196]

Magic Semi-Joins

Stefano Ceri et al.

Inf. Process. Lett. Vol. 33, No. 2, pages 97-107. 1989.

[197]

On the Interaction between Transitive Closure and Functional Dependencies

Georg Gottlob, Michael Schrefl and Markus Stumptner

In János Demetrovics, Bernhard Thalheim, editors, MFDBS 89, 2nd Symposium on Mathematical Fundamentals of Database Systems, Visegrád, Hungary, June 26-30, 1989 Vol. 364 of Lecture Notes in Computer Science, pages 187-206. Springer, 1989.

[198]

Properties and Update Semantics of Consistent Views

Georg Gottlob, Paolo Paolini and Roberto Zicari

ACM Trans. Database Syst. Vol. 13, No. 4, pages 486-524. 1988.

[199]

The Algres Project

Stefano Ceri et al.

In Joachim W. Schmidt, Stefano Ceri and Michele Missikoff, editors, Advances in Database Technology - EDBT'88, Proceedings of the International Conference on Extending Database Technology, Venice, Italy, March 14-18, 1988 Vol. 303 of Lecture Notes in Computer Science, pages 551-555. Springer, 1988.

[200]

Closed World Databases Opened Through Null Values

Georg Gottlob, Roberto Zicari

In François Bancilhon, David J. DeWitt, editors, Fourteenth International Conference on Very Large Data Bases, August 29 - September 1, 1988, Los Angeles, California, USA, Proceedings pages 50-61. Morgan Kaufmann, 1988.

[201]

Subsumption and Implication

Georg Gottlob

Inf. Process. Lett. Vol. 24, No. 2, pages 109-111. 1987.

[202]

On the Size of Nonredundant FD-Covers

Georg Gottlob

Inf. Process. Lett. Vol. 24, No. 6, pages 355-360. 1987.

[203]

Computing Covers for Embedded Functional Dependencies

Georg Gottlob

In Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California pages 58-69. ACM, 1987.

[204]

Normalization of Relations and PROLOG

Stefano Ceri, Georg Gottlob

Commun. ACM, Vol. 29, No. 6, pages 524-544. 1986.

[205]

Taxonomy and formal properties of distributed joins

Stefano Ceri, Georg Gottlob and Giuseppe Pelagatti

Inf. Syst. Vol. 11, No. 1, pages 25-40. 1986.

[206]

Optimizing Joins between Two Partitioned Relations in Distributed Databases

Stefano Ceri, Georg Gottlob

J. Parallel Distrib. Comput. Vol. 3, No. 2, pages 183-205. 1986.

[207]

Interfacing Relational Databases and Prolog Efficiently

Stefano Ceri, Georg Gottlob and Gio Wiederhold

In Expert Database Conf. pages 207-223. 1986.

[208]

Translation and Optimization of Logic Queries: The Algebraic Approach

Stefano Ceri, Georg Gottlob and Luigi Lavazza

In Wesley W. Chu et al. , editors, VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings pages 395-402. Morgan Kaufmann, 1986.

[209]

Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries

Stefano Ceri, Georg Gottlob

IEEE Trans. Software Eng. Vol. 11, No. 4, pages 324-345. 1985.

[210]

On the Efficiency of Subsumption Algorithms

Georg Gottlob, Alexander Leitsch

J. ACM, Vol. 32, No. 2, pages 280-295. 1985.

[211]

Fast Subsumption Algorithms

Georg Gottlob, Alexander Leitsch

In B. F. Caviness, editor, EUROCAL '85, European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985, Proceedings Volume 2: Research Contributions Vol. 204 of Lecture Notes in Computer Science, pages 64-77. Springer, 1985.

[212]

Implementation of a Distributed File System on a Geographic Network of Personal Computers

S. Copelli, Georg Gottlob

In DDSS pages 203-219. 1984.

[213]

Joining Fragmented Relations in Distributed Databases

Stefano Ceri, Georg Gottlob and Giuseppe Pelagatti

In XP4.5 Workshop on Database Theory, 1983 Palo Alto, California, USA 1983.

Random Image
Random Image
Random Image