Georg Gottlob
| Georg Gottlob | |
|---|---|
 |
|
| Born | 30 June 1956 Vienna, Austria |
| Residence | Oxford, United Kingdom |
| Nationality | Austrian and Italian |
| Fields | Computer Science |
| Institutions | University of Oxford |
| Alma mater | Vienna University of Technology |
| Doctoral advisor | Curt Christian |
| Doctoral students | Wolfgang Nejdl, Gerhard Friedrich, Thom Fruehwirth, Thomas Eiter, Helmut Veith, Zoltan Miklos, Bruno Marnette and others |
| Notable awards |
awarded
|
Georg Gottlob FRS is an Oxford-based Austrian computer scientist who works in the areas of database theory, logic, and artificial intelligence.
Gottlob obtained his PhD in computer science at Vienna University of Technology 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 Vienna University of Technology, where he still maintains an adjunct position. He was elected a member of the Royal Society in May, 2010.[2] He is a founding member of the Oxford-Man Institute.
He has published more than 250 scientific articles in the areas of computational logic, database theory, and artificial intelligence, and one textbook on logic programming and databases.[3]
In the area of artificial intelligence, he is best known for his influential early work on the complexity of nonmonotonic logics[4][5] and on hypertree decompositions,[6][7] 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.[8] His recent work on XML query languages (notably XPath) has helped create the complexity-theoretical foundations of this area.[9][10]
[edit] Footnotes
- ^ "ACM Fellows". Association for Computer Machinery. 2009. http://fellows.acm.org/fellow_citation.cfm?id=2684009&srt=all. Retrieved 24 May 2010.
- ^ a b "New Royal Society Fellows for 2010". Oxford University. 21 May 2010. http://www.ox.ac.uk/media/news_stories/2010/100521_1.html. Retrieved 24 May 2010.
- ^ Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990.
- ^ 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.
- ^ 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).
- ^ Phokion G. Kolaitis, Moshe Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2): 302-332 (2000).
- ^ 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).
[edit] References
- Austrian computer scientists
- Fellows of the Association for Computing Machinery
- Fellows of the Royal Society
- Database researchers
- Living people
- Royal Society Wolfson Research Merit Award holders
- Members of Oxford University Computing Laboratory
- 1956 births
- People from Vienna
- Vienna University of Technology alumni
- Fellows of St Anne's College, Oxford
- Vienna University of Technology faculty
