Full list of publications by Georg Gottlob
There are currently 188 publications in the database.2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | 1988 | 1987 | 1986 | 1985 | 1983 | 1982 | 1981 | 1979 |
2005
Marco Cadoli, Thomas Eiter, Georg Gottlob. Complexity of propositional nested circumscription and nested abnormality theories. ACM Transactions on Computational Logic (TOCL), Volume 6(2): 232-272Georg Gottlob. Web Data Extraction for Business Intelligence: The Lixto Approach. BTW 2005
Georg Gottlob. Computing Cores for Data Exchange: New Algoritms and Practical Solutions. PODS 2005
2004
G. Gottlob, Ph.G. Kolaitis, Th. Schwentick. Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. Journal of the ACM 51(2): 312-362, 2004G. Gottlob and C. Koch. Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. Journal of the ACM 51(1): 74-113, 2004
Georg Gottlob. Hypergraph Transversals. FoIKS 2004: 1-5.
Georg Gottlob. Second-Order Logic over Finite Structures - Report on a Research Programme. IJCAR 2004: 229-243.
Georg Gottlob, Christoph Koch, Robert Baumgartner, Marcus Herzog, Sergio Flesca. The Lixto Data Extraction Project - Back and Forth between Theory and Practice. PODS 2004: 1-12.
Georg Gottlob, Christoph Koch, Klaus Schulz. Conjunctive Queries over Trees. PODS 2004: 189-200.
Robert Baumgartner, Georg Gottlob, Marcus Herzog, Wolfgang Slany. Interactively Adding Web Service Interfaces to Existing Web Applications. SAINT 2004: 74-80.
András A. Benczúr, János Demetrovics, Georg Gottlob. Advances in Databases and Information Systems. 8th East European Conference, ADBIS 2004, Budapest, Hungary, September 22-25, 2004, Springer 2004
2003
G. Gottlob, Ch. Koch, and R. Pichler. XPath Processing in a Nutshell. ACM SIGMOD Record 32(1): pp. 12-19, 2003G. Gottlob, N. Leone, and F. Scarcello. Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. Journal of Computer and System Sciences 66(4): 775-808, 2003
G. Gottlob, Ch. Papadimitriou. On the Complexity of Single-Rule Datalog Queries. Information and Computation 183:1, pp104-122, 2003
Th. Eiter, G. Gottlob, and K. Makino. New Results on Monotone Dualization and Generating Hypergraph Transversals. SIAM Journal on Computing 32(2):514-537, 2003
G. Gottlob, and G. Greco, and F. Scarcello. Pure Nash equilibria: Hard and Easy Games. Proceedings of the 9th conference on Theoretical Aspects of Rationality and Knowledge, (TARK'03), Univerity of Indiana, Bloomington, Indiana, June 20-22 2003, pp. 215-230, 2003
G. Gottlob, C. Koch, and R. Pichler. XPath Query Evaluation: Improving Time and Space Efficiency. Proceedings of the 19. International Conference on Data Engineering (ICDE-03), March 5-8, 2003, Bangalore, India, IEEE Computer Society, pp. 379-390, 2003
G. Gottlob, C. Koch, R. Pichler. The Complexity of XPath Query Evaluation. In Proceedings of the 22. ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS-02), June 9-12, 2003, San Diego, CA, USA, ACM Press, pp. 179-190, 2003
R. Baumgartner, M. Ceresna, G. Gottlob, M. Herzog, and V. Zigo. Web Information Acquisition with Lixto Suite. Proceedings of the 19. International Conference on Data Engineering (ICDE'03), March 5-8, 2003, Bangalore, India, IEEE Computer Society, (system demo paper), pp. 747-749, 2003
Georg Gottlob, Toby Walsh. IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Acapulco, Mexico, August 9-15, 2003. Morgan Kaufmann
Robert Baumgartner, Georg Gottlob, Marcus Herzog. Visual Programming of Web Data Aggregation Applications. In Proceedings of IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), August 9-10, 2003, Acapulco, Mexico, pp. 137-142
2002
G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL Certificates. Theoretical Computer Science, 270(1-2), pp. 761-777, 2002G. Gottlob, F. Scarcello, M. Sideri. Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. Artificial Intelligence 138:(1-2):55-86 2002
G. Gottlob, N. Leone, and F. Scarcello. Hypertree Decompositions and Tractable queries. Journal of Computer and System Sciences 64(3): 579-627 (2002)
G. Gottlob, E. Grädel, H. Veith. Datalog Lite: A Deductive Query Language with Linear Time Model Checking. ACM Transactions on Computational Logic 3:1 pp42-79, 2002
R. Baumgartner, G. Gottlob. Propositional Default Logics Made Easier: Computational Complexity of Model Checking. Theoretical Computer Science 289(1): 591-627, 2002
M. Cadoli, Th. Eiter, and G. Gottlob. Complexity of Nested Circumscription and Nested Abnormality Theories. ACM Transactions on Computational Logic, to appear
G. Gottlob, C. Koch, R. Pichler. Efficient Algorithms for Processing XPath Queries. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02), Hong Kong, China, September 2002, pp. 95-106, 2002
G. Gottlob and C. Koch. Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. In Proceedings of the 21. ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS-02), Wisconsin, MA, May-June 2002, pp. 17-28, 2002
G. Gottlob and C. Koch. Monadic Queries over Tree-Structured Data. In Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, IEEE Computer Society, pp. 189-202, 2002
Th. Eiter, G. Gottlob, and K. Makino. New Results on Monotone Dualization and Generating Hypergraph Transversals. In Proc. of 43. ACM of Symposium on Theory of Computing, STOC 2002, Montreal, Canada, May 2002, pp. 14-22
G. Gottlob, Martin Hutle, and Franz Wotawa. Combining Hypertree, Bicomp, and Hinge Decomposition. In Proc. Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI'2002, Lyon, France, July 2002. IOS Press, pp. 161-165, 2002
Th. Eiter, Georg Gottlob, Giovambattista Ianni, Giuseppe Ielpa, Christoph Koch, Simona Perri, Axel Polleres. The DVL System. In Proc. of Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Springer Lecture Notes in Computer Science 2424, pp. 537-540, 2002
Th. Eiter, Georg Gottlob. Hypergraph Transversal Computation and Related Problems in Logic and AI. In Proc. of Logics in Artificial Intelligence, European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Springer Lecture Notes in Computer Science 2424, pp. 549-564, 2002
Th. Eiter, Georg Gottlob, and Th. Schwentick. Second-Order Logic over Strings: Regular and Non-regular Fragments. In Proc. Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers. Springer Lecture Notes in Computer Science 2295, pp. 37-56, 2002
F. Buccafurri and G. Gottlob. Multiagent Compromises, Joint Fixpoints and Stable Models. In Antonis C. Kakas, Fariba Sadri (Eds): Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I, Springer Lecture Notes in Computer Science 2407, pp561-585, 2002
2001
E. Dantsin, Th. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3):374-425 (2001)F. Buccafurri, Th. Eiter, G. Gottlob, and N. Leone. On ACTL Formulas Having Linear Counterexamples. Journal of Computer and System Sciences 62(3), pp. 463-515 2001
G. Gottlob, R. Pichler. Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. Information and Computation, 165:2 pp. 183-207, 2001
G. Gottlob, N. Leone, F. Scarcello. The Complexity of Acyclic Conjunctive Queries. Journal of the ACM, 48:3, pp431-498, 2001
G. Gottlob, R. Pichler. Hypergraphs in Model Checking: Acyclicity in Hypertree-Width versus Clique-Width. SIAM Journal on Computing, to appear
R. Baumgartner, S. Flesca,G. Gottlob. Visual Web Information Extraction with Lixto.. Proceedings of the 27th International Conference on Very Large Data Bases (VLDB'01), Rome, September 2001, pp. 119-128, 2001
R. Baumgartner, S. Flesca, and G. Gottlob. Supervised wrapper generation with Lixto. Proceedings of the 27th International Conference on Very Large Data Bases (VLDB'01), Rome, September 2001. (System Demo Description), pp. 715-116, 2001
R. Baumgartner, S. Flesca,and G. Gottlob. The Lixto Wrapper Generation Tool (Extended Abstract). Proc. of Nono Convegno Nazionale su Sistemi Evoluti per Basi di Dati (SEBD'01), Venice, Italy, June 27-29, pp. 147-154, 2001
G. Gottlob, R. Pichler. Hypergraphs in Model Checking: Acyclicity in Hypertree-Width versus Clique-Width. In Proceedings of ICALP 2001, Twenty Eighth International Colloquium on Automata, Languages and Programming, Crete, Greece, July 8-12, 2001, pp. 708-719
G. Gottlob, N. Leone, and F. Scarcello. Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. In Proceedings of the Twentieth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS-01), Santa Barbara, CA, May 2001, pp. 195-201
R. Baumgartner, S. Flesca,G. Gottlob. The Elog Web Extraction Language.. In: Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, Springer Lecture Notes in Computer Science 2250, pp. 548-560, 2001
R. Baumgartner, S. Flesca,G. Gottlob. Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto. In: Proc. of Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Lecture Notes in Computer Science 2173, pp. 21-41
M. Herzog and G.Gottlob. Infopipes: A exible Framework for MCommerce Applications. In: Proc. of Technologies for E-Services, Second International Workshop, TES 2001, Rome, Italy, September 14-15, 2001, Springer Lecture Notes in Computer Science 2193, pp. 175-186, 2001
M. Cadoli, Th. Eiter, and G. Gottlob. Complexity of Nested Circumscription and Abnormality. Theories Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle, WA, 2001, Morgan Kaufman, pp. 169-174, 2001
Th. Eiter, G. Gottlob. On the Complexity of Theory Curbing. In Proc. Logic Programming and Automated Reasoning (LPAR'00), Reunion Island, November 11-12 2000, Springer LNCS/AI Nr.1955, pp. 1-19
2000
Thomas Eiter, Georg Gottlob. Complexity Results for some Eigenvector Problems. International Journal of Computer Mathematics, Vol 76, pp. 59-74, 2000Th. Eiter, G. Gottlob, and Y. Gurevich. Existential Second Order Logic Over strings. Journal of the ACM 47:1, pp. 77-131, 2000
G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124:2, pp. 243-282, 2000
G. Gottlob, Ph.G. Kolaitis, Th. Schwentick. Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA. IEEE Computer Society, pp. 664-674, 2000
Th. Eiter, G. Gottlob, and H. Veith. Generalized Quantifiers in Logic Programs. In 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-en-Provence, France, August 11-22, 1997, Revised Lectures. Lecture Notes in Computer Science 1754 Springer, pp. 72-98, 2000
1999
G. Gottlob, N. Leone, and H. Veith. Succinctness as a Source of Complexity in Logical Formalisms. Annals of Pure and Applied Logic 97(1- 3): 231-260 1999F. Buccafurri, Th. Eiter, G. Gottlob, and N. Leone. Enhancing Model Checking and Verification by AI Techniques. Artificial Intelligence 112(1-2), pp. 57-104, 1999
G. Gottlob, F. Scarcello, M. Sideri. Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning. (LPNMR' 99, El Paso, Texas) Springer LNCS 1730, pp. 1-18
G. Gottlob, Ch. Papadimitriou. On the Complexity of Single-Rule Datalog Queries. In Proc. Logic Programming and Automated Reasoning (LPAR'99), Tbilissi, Georgia, September 1999, Springer LNCS/AI 1705, pp. 201-222
G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. In Proc. Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, Sweden, July 30-August 6, 1999, Morgan Kaufman, pp. 394-399, 1999
R. Baumgartner, G. Gottlob. On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, Sweden, July 30-August 6, 1999, Morgan Kaufman, pp64-69,1999
G. Gottlob, N. Leone, and F. Scarcello. Hypertree Decompositions and Tractable queries. In Proceedings of the Eighteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS- 99), Philadelphia, PA, May31-June 2 1999, pages 21-32
G. Gottlob, R. Pichler. Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. In Proc. 13th Annual Symposium on Logic in Computer Science LICS'99, Trento, Italy, July 2-5 1999. IEEE Computer Society Press, pp. 306-315, 1999
G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL Certificates. Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), Prague, Czech Republic, July 1999, Springer LNCS 1644, pp. 361-371
G. Gottlob, N. Leone, and F. Scarcello. On Tractable Queries and Constraints. In Proc. Tenth International DEXA Conference on Database and Expert Systems Applications Florence, Italy, Aug378943, Springer LNCS 1677, pp. 1-15, 1999
G. Gottlob. Review of a Carnapian Extension of S5. In Ewa Orlowska, editor, Logic at Work , (Studies in Fuzziness and Soft Computing, Vol. 24) Physica-Verlag, ISBN 3-7908-1164-5, 1999
1998
Th. Eiter, G. Gottlob. On the Expressiveness of Frame Satisfiability and Fragments of Second Order Logic. Journal of Symbolic Logic, vol 63, nr. 1, 1998, pp. 73-82G. Gottlob, N. Leone, and F. Scarcello. On the Complexity of Some Inductive Logic Programming Problems. New Generation Computing Vol. 17, Nr.1, November 1998, pp. 53-75
G. Gottlob, N. Leone, F. Scarcello. The Complexity of Acyclic Conjunctive Queries. Proceedings of the 39-th IEEE Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, California, November 8-11, 1998, pp. 706-715
Th. Eiter, G. Gottlob, and Y. Gurevich. Existential Second Order Logic Over strings. In Proc. 13th Annual Symposium on Logic in Computer Science LICS'98 (Indianapolis, IN, June 1998). IEEE Computer Society Press, 1998
G. Gottlob and M. Schre. The Evolving Algebra Semantics of Class and Role Hierarchies. In Libkin and Thalheim Eds: Semantics in Databases (Selected papers of a Workshop held in Rez/Prague, 1995). Springer LNCS Nr. 1358, pp. 92-113, 1998
G. Gottlob and E.Grandjean, K. Seyr (Editors). Computer Science Logic. Proceedings of the 12th International Workshop CSL'98. Brno, Czech Republic, August 1998. Number 1584 in LNCS. Springer Verlag Heidelberg, 1998
1997
G. Brewka and G. Gottlob. Well-Founded Semantics for Default Logic. Fundamenta Informaticae vol 31, nrs. 3/4, 1997, pp 221-236M. Cadoli, Th. Eiter, and G. Gottlob. Using Default Logic as a Query Language. IEEE Transactions on Knowledge and Data Engineering, 9(3), pp. 448-463, 1997
G. Gottlob. Relativized Logspace and Generalized Quantifiers over Ordered Finite Structures. Journal of Symbolic Logic Vol. 62:2, June 1997, pp. 545-574
Thomas Eiter, Georg Gottlob, and Heikki Mannila. Disjunctive Datalog. ACM Transactions on Database Systems, 22(3), Sept. 1997, pp. 364-418
Th. Eiter, G. Gottlob, and N. Leone. Abduction From Logic Programs: Semantics and Complexity. Theoretical Computer Science 189(1-2) December 1997, pp129-177
Thomas Eiter, Georg Gottlob, and Nicola Leone. Semantics and Complexity for Abduction from Default Theories. Artificial Intelligence, Vol. 90(1-2), pp177-222, 1997
Th. Eiter, G. Gottlob. Expressiveness of Stable Model semantics for Disjunctive Logic Programs with Functions. The Journal of Logic Programming, 33(2), 1997, pp. 167-178
Thomas Eiter, Georg Gottlob, and Nicola Leone. On the Indiscernibility of Individuals in Logic Programming. The Journal of Logic and Computation 7:6, December 1997, pp. 805-824
Th. Eiter, G. Gottlob. The Complexity Class ?(p,2): Recent Results and Applications in AI and Modal Logic. In Proceedings of the 11th International Symposium on Fundamentals of Computation Theory (FCT'97) Springer LNCS Nr. 1279, 1997, pp1-18
E. Dantsin, Th. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. In Proceedings of the Twelfth IEEE Conference on Computational Complexity (CCC'97). IEEE Computer Science Press, pp82-101
G. Gottlob, N. Leone, and F. Scarcello. On the Complexity of Some Inductive Logic Programming Problems. In Proceedings of the 7th International Workshop on Inductive Logic Programming (ILP'97). Springer LNCS/AI Nr.1297, 1997
S. Citrigno, Th. Eiter, W. Faber, G. Gottlob, G. Koch, N. Leone, Ch. Mateis, G. Pfeifer, and F. Scarcello. The dlv System : Model Generator and Advanced Frontends. In Proceedings of the 12th Workshop on Logic Programming (WLP'97, Munich, Sept. 1997). LMU Munchen, 1997,pp. 128-137
F. Buccafurri, Th. Eiter, G. Gottlob, and N. Leone. Combining Abductive and Model Checking Techniques for Repair of Concurrent Programs. In Proceedings of the 2nd Workshop on Trends in Theoretical Informatics (Budapest, March 1997) Periodica Polytechnica, pp91- 101, 1997
J. Dorn and G. Gottlob. Künstliche Intelligenz. In Informatik-Handbuch, P. Rechenberg and G. Pomberger Eds, Hanser Verlag 1997, pp819-838
1996
G. Gottlob and M. Truszcynski. Approximating Stable Models is Hard. Fundamenta Informaticae. Vol. 28(1,2), 1996, pp. 123-128Thomas Eiter, Georg Gottlob, and Yuri Gurevich. Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Annals of Pure and Applied Logic, vol. 78, pp. 111-125, 1996
G. Gottlob, M. Schre, and B. Röck. Extending Object-Oriented Systems with Roles. ACM Transactions on Information Systems, vol. 14, No. 3, July 1996
G. Gottlob, Sh. Marcus, A. Nerode, G. Salzer, and V.S. Subrahmanian. Non-Ground Realization of the Stable and Well-Founded Semantics. Theoretical Computer Science,vol166 nr. 1&2, pp. 221-262, 1996
J. Dix, G. Gottlob, and V. Marek. Reducing Disjunctive to Nondisjunctive Semantics by Shift Operations. Fundamenta Informaticae. Vol. 28(1,2), pp. 87-100, 1996
Th. Eiter, G. Gottlob. Mächtigkeit von Logikprogrammierung über Datenbanken. Künstliche Intelligenz 3/96, pp. 32-39
G. Gottlob. Collapsing Oracle-Tape Hierarchies. In Proceedings of the Eleventh IEEE Conference on Computational Complexity (CCC'96). IEEE Computer Science Press, Philadelphia, May 24-27, 1996, pp. 33- 42
G. Gottlob, G. Moerkotte, and V. S. Subrahmanian. The PARK Semantics for Active Rules. In Proc. International Conference on Extending Database Technology, EDBT'96, Lecture Notes in Computer Science. Springer Verlag, pp. 35-55, 1996
G. Gottlob. Complexity of Expressive Power of KR Formalisms (Invited Talk Abstract). In Proceedings of the 1996 Fifth International Conference on Principles of Knowledge Representation and Reasoning - KR'96, Cambridge, MA, Nov5-8, 1996, pp. 647-649, 1996
1995
Th. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15:289-323, 1995G. Gottlob. The Complexity of Default Reasoning under the Stationary Fixed Point Semantics. Information and Computation, 121(1):81-92, August 1995
Thomas Eiter and Georg Gottlob. The Complexity of Logic-Based Abduction. Journal of the ACM, 42(1):3-42, January 1995
Thomas Eiter and Georg Gottlob. Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM Journal on Computing, 24(6), Dec. 1995, pp. 1278-1304
Georg Gottlob. Translating default Logic into Standard Autoepistemic Logic. Journal of the ACM, 42(4):711-740, July 1995
Georg Gottlob. NP Trees and Carnap's Modal Logic. Journal of the ACM, 42(2):421-457, March 1995
G. Gottlob. Relativized Logspace and Generalized Quantifiers over Finite Structures. In Proc. Tenth Annual Symposium on Logic in Computer Science LICS'95 (San Diego, CA, June 1995). IEEE Computer Society Press, 1995
G. Gottlob, N. Leone, and H. Veith. Second order logic and the weak exponential hierarchies. In Proc. Intl. Symp. on Mathematical Foundations of Computer Science, MFCS'95, Prague, CR, LNCS nr. 969, pages 66-81
Thomas Eiter, Georg Gottlob, and Nicola Leone. Complexity Results for Abductive Logic Programming. In W. Marek, A. Nerode, and M. Truszczy nski, editors, Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR- 95), number 982 in LNCS, subseries LNAI, pages 1-14. Springer, 1995
Thomas Eiter, Georg Gottlob, and Nicola Leone. Semantics and Complexity for Abduction from Default Theories. In Ch. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Arti- ficial Intelligence (IJCAI-95), pages 870-876. AAAI Press, 1995
G. Gottlob and M. Vardi, editors. Database Theory. ICDT'95, 5th International Conference, Number 893 in LNCS. Springer Verlag Heidelberg, 1995
1994
G. Gottlob and Zhang Mingyi. Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Artificial Intelligence, 69:329-345, 1994G. Friedrich, G. Gottlob, and W. Nejdl. Formalizing the repair process - extended report. Annals of Mathematics and Artificial Intelligence, 11(1-4):187-201, 1994
J. Dix, G. Gottlob, and V. Marek. Causal Models of Disjunctive Logic Programs. In International Conference on Logic ProgrammingICLP'94, Santa Margherita Ligure, Italy, June 1994, pages 290-302. MIT Press, 1994
M. Cadoli, Th. Eiter, and G. Gottlob. Using Default Logic as a Query Language. In Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), pp. 99-108, 1994
Georg Gottlob. Complexity and Expressive Power of Disjunctive Logic Programming. In M. Bruynooghe, editor, Proceedings of the 11th International Logic Programming Symposium, ILPS'94, Ithaka, NY, November 94, pages 23-42, Vancouver, 1994. MIT Press
Th. Eiter, G. Gottlob, and H. Mannila. Adding Disjunction to Datalog. In Proceedings of the Thirteenth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-94), pages 267- 278, May 1994
Th. Eiter, G. Gottlob, and H. Mannila. Disjunctive Logic Programming over Finite Structures. In U. Fuhrbach, editor, Proceedings GI Workshop on Disjunctive Logic Programming and Disjunctive Databases, 13th World Computer Congress IFIP Congress '94, August 1994
Th. Eiter, G. Gottlob, and H. Mannila. Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics. In Kai van Luck and Heinz Marburger, editors, Management and Processing of Complex Data Structures - Proceedings of the Third Workshop on Information Systems and Artificial Intelligence, number 777 in LNCS, pages 83-103. Springer, 1994
1993
G. Gottlob and Ch. Fermueller. Removing redundancy from a clause. Artificial Intelligence, 61:263-289, 1993Th. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are ?(P, 2)-complete. Theoretical Computer Science, 114(2):231-245, 1993. Addendum 118:315
Thomas Eiter and Georg Gottlob. The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. Journal of Computer and System Sciences, 53:3, pp. 497-512
Th. Eiter and G. Gottlob. Complexity Aspects of Various Semantics for Disjunctive Databases. In Proceedings of the Twelth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-93), pp. 158-167, June 1993
Th. Eiter and G. Gottlob. The Complexity of Logic-Based Abduction. In P. Enjalbert, A. Finkel, and K.W. Wagner, editors, Proceedings Tenth Symposium on Theoretical Aspects of Computing STACS-93, number 665 in LNCS, pages 70-79, Wurzburg, February 1993. Springer
Thomas Eiter and Georg Gottlob. Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. In D. Miller, editor, Proceedings of the Tenth International Logic Programming Symposium (ILPS-93), pages 266-278, Vancouver, 1993. MIT Press
Georg Gottlob. NP Trees and Carnap's Modal Logic. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science FOCS'93 (Palo Alto, California), pages 42-51. IEEE Computer Science Press, New York, November 1993
Thomas Eiter and Georg Gottlob. The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. In R. Bajcsy, editor, Proceedings of the Thirteenth International Joint Conference on Arti- ficial Intelligence (IJCAI-93), pages 526-531. Morgan Kaufman, 1993
Thomas Eiter, Georg Gottlob, and Yuri Gurevich. Curb Your Theory! A circumscriptive approach for inclusive interpretation of disjunctive information. In R. Bajcsy, editor, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 634-639. Morgan Kaufman, 1993. Also: Second Compulog Net Meeting on Knowledge Bases (CNKBS-93), Athens, April 1993
Georg Gottlob. Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning and Why they Matter (Invited Talk Abstract). In L. Pereira and A. Nerode, editors, Proceedings of the Second International Workshop on Logic Programming and Nonmonotonic Reasoning LPNMR'93, page 265. MIT Press, 1993
Th. Eiter, G. Gottlob, and H. Mannila. Expressive Power and Complexity of Disjunctive Datalog. In H. Blair, W. Marek, A. Nerode, and J. Remmel, editors, Informal Proceedings of the Second Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, pages 59-79, Vancouver, October 29 1993. Cornell University, Mathematical Sciences Institute
G. Gottlob, A. Leitsch, and D. Mundici, editors. Computational Logic and Proof Theory. Proceedings of the Third Kurt Grödel Kolloquium, Brno, Czech Republic, August 1993, Number 713 in LNCS. Springer Verlag Heidelberg, 1993. Other writings
1992
Th. Eiter and G. Gottlob. Reasoning with Parsimonious and Moderately Grounded Expansions. Fundamenta Informaticae, 17:31-53, 1992G. Gottlob, M. Schre, and M. Stumptner. On selective inheritance of attribute values in relational databases. Discrete Applied Mathematics, 40:187-216, 1992
Th. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence, 57:227-270, 1992. Extended version of [118]
M. Cadoli, Th. Eiter, and G. Gottlob. An efficient method for eliminating varying predicates from a circumscription. Artificial Intelligence, 54:397-410, 1992
G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3):397-425, june 1992
Th. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. In Proceedings ofthe ACM SIGACT-SIGMOD-SIGACT Symposium on Principles of Database Systems, pages 261-273, June 1992
G. Gottlob. The power of beliefs - or translating default logic into standard autoepistemic logic. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 570-575, 1992. (This paper was also presented at the Knowledge Representation Workshop at ECAI-92, Vienna, Austria, August 1992, and published in the respective Workshop Proceedings, Springer LNCS/AI no. 810)
G. Friedrich, G. Gottlob, and W. Nejdl. Formalizing the repair process. In ECAI-92, European Conference on Artificial Intelligence, Vienna, pages 709-713, August 1992
Th. Eiter and G. Gottlob. Complexity Results for Logic-Based Abduction. In H. Blair, W. Marek, A. Nerode, and J. Remmel, editors, Informal Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, pages 29-44, Washington DC, November 1992. Cornell University, Mathematical Sciences Institute
A. Pirotte, C. Delobel, and G. Gottlob, editors. Advances in Database Technology. EDBT92 Number 580 in LNCS. Springer Verlag Heidelberg, 1992
1991
S. Ceri, G. Gottlob, and L. Tanca. DATALOG: un Tutorial. Rivista di Informatica 21(3):215-252, 1991G. Friedrich, G. Gottlob, and W. Nejdl. Towards a theory of the repair process. In EPIA-91, 5th Portuguese Conference on Artificial Intelligence, Albufeira, Portugal, number 541 in LNCS, pages 222-236. Springer Verlag Heidelberg, October 1-3 1991
G. Gottlob. On the complexity of clause condensing. In Proceedings of the Seventh Austrian Conference on Artificial Intelligence, Informatik Fachberichte Nr. 287, pages 16-29. Springer Verlag, 1991
1990
G. Friedrich, G. Gottlob, and W. Nejdl. Generating efficient diagnostic procedures from model based knowledge using logic programming techniques. Computers and Mathematics with Applications, 20(9/10):57-72, 1990G. Gottlob and L.Libkin. Investigations on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybernetica, 9(4):385-402, 1990
G. Friedrich, G. Gottlob, and W. Nejdl. Physical negation instead of fault models. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 331-336, Boston, 1990
G. Friedrich, G. Gottlob, and W. Nejdl. Hypothesis classification, abductive diagnosis, and therapy. In Proceedings of the 1990 International Workshop on Principles of Diagnosis, Stanford, July 1990 and Proceedings of the International Workshop on Expert Systems in Engineering - Principles and Applications (G. Gottlob and W.Nejdl Eds), Springer LNCS/AI Nr. 462, pages 70-78, Vienna, 1990
G. Gottlob, G. Kappel, and M. Schre. Semantics of object-oriented data models - the evolving algebra approach. In Next Generation Information Technology, Proc. First Intl. East/West Database Workshop, Kiew, Ucranine, number 504 in LNCS, pages 144-160. Springer Verlag Heidelberg, October 1990
S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Surveys in Computer Science. Springer Verlag, 1990
G. Gottlob and W. Nejdl (Editors). Expert Systems in Engineering - Principles and Applications. (Proceedings of an International Workshop, Vienna,September 1990). LNCS/AI-462. Springer Verlag Heidelberg, 1990
Th. Frühwirth, G. Gottlob, and W. Horn (Editors). Expertensysteme - Grundlagen und Methoden. Springers Angewandte Informatik. Springer Verlag Wien-New York, 1990
G. Friedrich and G. Gottlob. Inferenzstrategien. In Th. Frühwirth, G. Gottlob, and W. Horn, editors, Expertensysteme. Springer-Verlag, 1990
1989
S. Ceri, G. Gottlob, and G. Wiederhold. Efficient database access from Prolog. IEEE Transactions on Software Engineering, 15(2):153-164, February 1989S. Ceri, G. Gottlob, and L Tanca. What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering, 1(1), March 1989
S. Ceri, G. Gottlob, L. Tanca, and G. Wiederhold. Magic semi-joins. Information Processing Letters, 33(2):97-108, 1989
G. Gottlob, M. Schre, and M. Stumptner. On the interaction between transitive closure and functional dependencies. In Proc. of the 2nd Intl. Conference on Mathematical Fundamentals of Database Systems, Lecture Notes in Computer Science. Springer, June 1989
Th. Eiter, G. Gottlob, H. Veith. Modular Logic Programming and Generalized Quantifiers. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR' 97) Springer LNCS 1265, pp290-309
A. Leitsch and G. Gottlob. Deciding Horn clause implication problems by ordered semantic resolution. In Amsterdam F. Gardin Editor, North Holland, editor, Computational Intelligence II, Proceedings of the International Symposium, Milan, Italy, 25-27 Sept. 1989, 1989
G. Gottlob, M. Schre, and M. Stumptner. Datenbanksysteme (Vorlesungsskriptum). Course Lecture Notes. Technische Universität Wien, 1989
1988
G. Gottlob, P. Paolini, and R. Zicari. Properties and update semantics of consistent views. ACM Transactions on Database Systems, 13(4):486-524, December 1988Anuj Dawar, Georg Gottlob, and Lauri Hella. Capturing Relativized Complexity Classes without Order. Mathematical Logic Quarterly, 44(1998), pp109-122, 1988
E. Albino, G. Gottlob, and G. Dettori. A multiple answer Prolog system for decomposing a data base into Boyce Codd normal form. International Journal on Policy and Information, 12:53-74, 1988
G. Gottlob and R. Zicari. Closed world databases opened through null values. In Proceedings of the 14th International Conference on Very Large Data Bases, pages 395-402, August 1988
S. Ceri, S. Crespi-Reghizzi, G. Gottlob, F. Lampertini, and L. Lavazza. The ALGRES project. In Proceedings of the International Conference on Extending Database Technology, Lecture Notes in Computer Science 303, pages 551-555. Springer Verlag, March 1988
G. Gottlob and M. Stumptner. AI und Expertensysteme - Von Software Engineering zu Knowledge Engineering. In Technik und Trends, Schriftenreihe des Österreichischen Industriewissenschaftlichen Instituts, 1988
A. Ancona, G. Gottlob, A. Clematis, L. DeFloriani, G. Dodero, and Vl Gianuzzi. Permanent data structures for Modula2. Technical Report SP2-88, TU-184-2, 1988
1987
G. Gottlob. On the size of nonredundant FD-covers. Information Processing Letters, 24:355-360, April 1987G. Gottlob. Subsumption and implication. Subsumption and implication. Information Processing Letters, 24:109-111, January 1987
G. Gottlob. Computing covers for embedded functional dependencies. In Proceedings of the ACM SIGACT-SIGMOD-SIGACT Symposium on Principles of Database Systems, pages 58-69, March 1987
1986
S. Ceri and G. Gottlob. Optimizing joins between two partitioned relations in distributed databases. The Journal of Parallel and Distributed Computing, 3:183-205, 1986S. Ceri, G. Gottlob, and G. Pelagatti. Taxonomy and formal properies of distributed joins. Information Systems, 11(1):25-40, March 1986
S. Ceri and G. Gottlob. Normalization of relations and Prolog. Communications of the ACM, 29(6):524-544, June 1986
G. Gottlob, A. Leitsch, and W. Schimanovich. Automatisches Beweisen: Methoden und Implementation. Österreichische Zeitschrift für Statistik und Informatik, 16:35-55, 1986
S. Ceri, G. Gottlob, and L. Lavazza. Translation and optimization of logic queries: The algebraic approach. In Proceedings of the Twelfth International Conference on Very Large Data Bases, pages 395-402, August 1986
S. Ceri, G. Gottlob, and G. Wiederhold. Interfacing Prolog and relational databases efficiently. In Proceedings of the First International Conference on Expert Database Systems, April 1986
G. Gottlob. Promise: A redundancy detector for logic programs. In Proceedings of the International Computer Symposium 1986, pages 537- 546, December 1986
G. Gottlob and L. Tanca. Il Prolog e la progettazione di basi di dati. In Atti del Primo Convegno Nationale sulla Programmazione Logica, pages 96-103, March 1986
G. Gottlob and L. Tanca. Prolog and database design: A Prolog tool for database scheme decomposition. In Proceedings of the Third International Conference on System Research, Informatics and Cybernetics, August 1986
1985
S. Ceri and G. Gottlob. Translating SQL into relational algebra: Optimization, semantics and equivalence of SQL queries. IEEE Transactions on Software Engineering, 11(4):324-345, April 1985G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the ACM, 32(2):280-295, April 1985
G. Gottlob and A. Leitsch. Fast subsumption algorithms. In Proceedings of the EUROCAL 85 Conference on Computer Algebra, Lecture Notes in Computer Science. Springer Verlag, 1985
S. Copelli and G. Gottlob. Implementation of a distributed file system on a geographic network of personal computers. In Proceedings of the 3rd International Seminar on Distributed Data Sharing Systems, pages 203-219. Elsevier Science Publishers, 1985
S. Copelli, G. Gottlob, L. Grossi, D. Mandrioli und P. Paolini, L. Suppa, and A. Repichini. SAD: Sistema di Archivi Distribuiti. C.NR-DATANET, 1985
1983
P. Colombo, S. Copelli, G. Gottlob, L. Grossi, D. Mandrioli, G. Oldano, P. Paolini, and A. Pellegrini. Design of a distributed file 16 system for a geographic network. In Microcomputers: Developments in Industry, Business and Education - Proceedings of the 1983 EUROMICRO Conference. North Holland Publishing Company, 1983P. Colombo, S. Copelli, A. Florit, G. Gottlob, L. Grossi, D. Mandrioli, G. Oldano, P. Paolini, and A. Pellegrini. SAD: Un sistema di archivi distribuiti su una rete geografica. In Proceedings of the AICA-Conference, Naples, Italy, 1983
G. Gottlob. On the truth functional representations of some special extensions of the propositional calculus. Technical report, TU-184-2, 1983. Manuscript
1982
G. Gottlob. Semantic representation of logical operators of programming languages by means of three valued truth tables. In Proceedings of the Twelfth International Symposium on Multiple Valued Logic, pages 81-87. IEEE Computer Society Press, May 1982G. Gottlob. Man machine interaction in process oriented computer simulation. In Findler Trappl and Horn, editors, Progress in Cybernetics and System Research, pages 589-595, 1982
1981
G. Gottlob. Dissertation: Mehrwertige Logik - Aufbau und Anwendung in der Informatik. PhD thesis, Technische Universität Wien, 1981G. Gottlob. Operative dreiwertige Logiken zur Charakterisierung von Entscheidungsprozessen und Auswertunsvorgängen. In Manuscript. Talk and Abstract presented at the International Symposium on Logic and Philosophy of Science, Kirchberg, Austria, 1981