Georg Gottlob

Infobox_Scientist
name = Georg Gottlob


image_width =
caption =
birth_date = Birth date and age|1956|6|30|mf=y
birth_place = Vienna, Austria
death_date =
death_place =
residence = Oxford, United Kingdom
citizenship =
nationality = Austrian
ethnicity =
field = Computer Science
work_institution = University of Oxford
alma_mater = Technical University of Vienna
doctoral_advisor = Curt Christian
doctoral_students = Thomas Eiter, Helmut Veith
known_for =
author_abbreviation_bot =
author_abbreviation_zoo =
prizes = Wittgenstein Award (1998)
nowrap|Royal Society Wolfson Research Merit Award (2006)
nowrap|Fellow of the Association for Computing Machinery [ACM fellow citation: http://fellows.acm.org/fellow_citation.cfm?id=2684009&srt=all]
Member of Academia Europaea
Member of the Austrian Academy of Sciences
nowrap|Member of the German Academy of Sciences Leopoldina
ISI highly cited researcher
religion =
footnotes =

Georg Gottlob is an Austrian computer scientist who works in the areas of database theory, logic, and Artificial Intelligence.

Gottlob obtained his PhD in computer science at Technical University of Vienna in 1981. He is currently a chaired professor of computing science at the Oxford University Computing Laboratory, where he helped establish the information systems research group. He is also a Fellow of St Anne's College, Oxford. Previously, he was a professor of computer science at Technical University of Vienna, where he still maintains an adjunct position.

He has published more than 200 scientific articles in the areas of computational logic, database theory, and Artificial Intelligence, and one textbook on logic programming and databases [Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990.] .

In the area of Artificial Intelligence, he is best known for his influential early work on the complexity of nonmonotonic logics [Georg Gottlob: Complexity Results for Nonmonotonic Logics. J. Log. Comput. 2(3): 397-425 (1992)] [
Thomas Eiter and Georg Gottlob: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Proc. 11th ACM SIGACT-SIGMOD-SIGART PODS, 1992.] and on hypertree decompositions [Thomas Eiter, Georg Gottlob: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24(6): 1278-1304 (1995)] [Georg Gottlob, Nicola Leone, Francesco Scarcello: Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64(3): 579-627 (2002).] , a framework for obtaining tractable structural classes of constraint satisfaction problems, and a generalization of the notion of tree decomposition from graph theory. This work has also had substantial impact in database theory, since it is known that the problem of evaluating conjunctive queries on relational databases is equivalent to the constraint satisfaction problem [Phokion G. Kolaitis, Moshe Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2): 302-332 (2000).] . His recent work on XML query languages (notably XPath) has helped create the complexity-theoretical foundations of this area [Georg Gottlob, Christoph Koch, and Reinhard Pichler: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2): 444-491 (2005).] [Georg Gottlob, Christoph Koch, Reinhard Pichler, and Luc Segoufin: The complexity of XPath query evaluation and XML typing. J. ACM 52(2): 284-335 (2005).] .

Footnotes

References

* Georg Gottlob's homepage: http://www.comlab.ox.ac.uk/people/Georg.Gottlob/

* Interview with Georg Gottlob in ACM SIGMOD Record 36(2), June 2007: http://www.sigmod.org/sigmod/record/issues/0706/p27.winslett-gottlob.pdf

*MathGenealogy|id=102234