Georg Gottlob

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Georg Gottlob
Georg gottlob-official3.png
Born (1956-06-30) 30 June 1956 (age 62)[1]
Vienna, Austria
ResidenceOxford, United Kingdom
NationalityAustrian and Italian
Alma materVienna University of Technology
Scientific career
ThesisMehrwertige Logik – Aufbau und Anwendung in der Informatik (1981)
Doctoral advisorCurt Christian[5]
Doctoral students

Georg Gottlob FRS is an Austrian computer scientist who works in the areas of database theory, logic, and artificial intelligence and is Professor of Informatics at the University of Oxford.[4][6][7][8][9][10][11][12][13]


Gottlob obtained his undergraduate and PhD degrees in computer science at Vienna University of Technology in 1981.

Career and Research[edit]

Gottlob is currently a chaired professor of computing science at the Oxford University Department of Computer Science, where he helped establish the information systems research group. He is also a Fellow of St John'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.[3] 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.[14]

In the area of artificial intelligence, he is best known for his influential early work on the complexity of nonmonotonic logics[15][16] and on (generalised) hypertree decompositions,[17][18] a framework for obtaining tractable structural classes of constraint satisfaction problems, and a generalisation 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.[19] His recent work on XML query languages (notably XPath) has helped create the complexity-theoretical foundations of this area.[20][21][22]

Awards and honours[edit]

Gottlob has received numerous awards and honours including election to the Royal Society in 2010. His nomination for the Royal Society reads:

Gottlob has also been designated as an ECCAI fellow [1] in 2002.


  1. ^ "GOTTLOB, Prof. Georg". Who's Who 2014, A & C Black, an imprint of Bloomsbury Publishing plc, 2014; online edn, Oxford University Press.(subscription required)
  2. ^ "ACM Fellows". Association for Computer Machinery. 2009. Retrieved 24 May 2010.
  3. ^ a b "New Royal Society Fellows for 2010". Oxford University. 21 May 2010. Archived from the original on 27 May 2010. Retrieved 24 May 2010.
  4. ^ a b Georg Gottlob publications indexed by Google Scholar
  5. ^ a b Georg Gottlob at the Mathematics Genealogy Project
  6. ^ Georg Gottlob author profile page at the ACM Digital Library
  7. ^ Winslett, M. (2007). "Georg Gottlob speaks out". ACM SIGMOD Record. 36 (2): 27. doi:10.1145/1328854.1328860. Archived from the original (PDF) on 11 June 2011.
  8. ^ Georg Gottlob's publications indexed by the Scopus bibliographic database. (subscription required)
  9. ^ Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; Scarcello, F. (2006). "The DLV system for knowledge representation and reasoning". ACM Transactions on Computational Logic. 7 (3): 499. arXiv:cs/0211004. doi:10.1145/1149114.1149117.
  10. ^ Dantsin, E.; Eiter, T.; Gottlob, G.; Voronkov, A. (2001). "Complexity and expressive power of logic programming". ACM Computing Surveys. 33 (3): 374. CiteSeerX doi:10.1145/502807.502810.
  11. ^ Georg Gottlob at DBLP Bibliography Server Edit this at Wikidata
  12. ^ Eiter, T.; Gottlob, G.; Mannila, H. (1997). "Disjunctive datalog". ACM Transactions on Database Systems. 22 (3): 364. doi:10.1145/261124.261126.
  13. ^ Eiter, T.; Gottlob, G. (1995). "The complexity of logic-based abduction". Journal of the ACM. 42: 3–42. doi:10.1145/200836.200838.
  14. ^ Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990. ISBN 9783642839542
  15. ^ Gottlob, G. (1992). "Complexity Results for Nonmonotonic Logics". Journal of Logic and Computation. 2 (3): 397–425. doi:10.1093/logcom/2.3.397.
  16. ^ Eiter, T.; Gottlob, G. (1992). "On the complexity of propositional knowledge base revision, updates, and counterfactuals". Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '92. p. 261. doi:10.1145/137097.137886. ISBN 978-0897915199.
  17. ^ Eiter, T.; Gottlob, G. (1995). "Identifying the Minimal Transversals of a Hypergraph and Related Problems". SIAM Journal on Computing. 24 (6): 1278. CiteSeerX doi:10.1137/S0097539793250299.
  18. ^ Gottlob, G.; Leone, N.; Scarcello, F. (2002). "Hypertree Decompositions and Tractable Queries". Journal of Computer and System Sciences. 64 (3): 579. arXiv:cs/9812022. doi:10.1006/jcss.2001.1809.
  19. ^ Kolaitis, Phokion G.; Vardi, Moshe Y. (2000). "Conjunctive-Query Containment and Constraint Satisfaction". Journal of Computer and System Sciences. 61 (2): 302–332. doi:10.1006/jcss.2000.1713.
  20. ^ Furche, T.; Gottlob, G.; Grasso, G.; Schallhart, C.; Sellers, A. (2012). "OXPath: A language for scalable data extraction, automation, and crawling on the deep web". The VLDB Journal. 22: 47–72. doi:10.1007/s00778-012-0286-6.
  21. ^ Gottlob, G.; Koch, C.; Pichler, R. (2005). "Efficient algorithms for processing XPath queries". ACM Transactions on Database Systems. 30 (2): 444. CiteSeerX doi:10.1145/1071610.1071614.
  22. ^ Gottlob, G.; Koch, C.; Pichler, R.; Segoufin, L. (2005). "The complexity of XPath query evaluation and XML typing". Journal of the ACM. 52 (2): 284. CiteSeerX doi:10.1145/1059513.1059520.
  23. ^ "EC/2010/17: Gottlob, Georg. Library and Archive Catalogue". London: The Royal Society. Archived from the original on 21 March 2014.