Georg Gottlob

Georg Gottlob
Born (1956-06-30) 30 June 1956[1]
Vienna, Austria
Residence Oxford, United Kingdom
Nationality Austrian and Italian
Fields
Institutions
Alma mater Vienna University of Technology
Thesis Mehrwertige Logik - Aufbau und Anwendung in der Informatik (1981)
Doctoral advisor Curt Christian[3]
Doctoral students
  • Dmitri Akatov[4]
  • Michal Ceresna
  • Robert Chandradoss
  • José Díaz Prado
  • Thomas Eiter
  • Christian Fermüller
  • Michael Fink
  • Wolfgang Gatterbauer
  • Xiaonan Guo
  • Marcus Herzog
  • Ondrej Jaura
  • Stefan Katzenbeisser
  • Thomas Korimort
  • Bruno Marnette[5]
  • Zoltan Miklos[6]
  • Reinhard Pichler
  • Kurt Reichinger
  • Gernot Salzer
  • Marko Samer
  • Andrew Sellers[7]
  • Wolfgang Slany
  • Stefan Szeider
  • Hans Tompits
  • Helmut Veith[3]
Notable awards
Website
www.cs.ox.ac.uk/people/georg.gottlob

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.[2][10][11][12][13][14][15][16][17]

Education

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

Career and Research

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.[9] 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.[18]

In the area of artificial intelligence, he is best known for his influential early work on the complexity of nonmonotonic logics[19][20] and on (generalized) hypertree decompositions,[21][22] 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.[23] His recent work on XML query languages (notably XPath) has helped create the complexity-theoretical foundations of this area.[24][25][26]

Awards and honours

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

“ Georg Gottlob has made fundamental contributions to both artificial intelligence and to database systems. His research has centred on the algorithmic and logical aspects of knowledge representation, database queries, and recently for web data processing. His work has resulted in the invention of several efficient algorithms for constraint satisfaction, web data extraction and database query processing, some of which are now in widespread use. He has developed a common core to the underlying principles of artificial intelligence and databases. In his work on clarifying the intrinsic complexity of problems in these areas, Gottlob has solved open problems in computational logic, non-monotonic reasoning and database theory.[27] ”

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

References

  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. 1 2 Georg Gottlob's publications indexed by Google Scholar, a service provided by Google
  3. 1 2 Georg Gottlob at the Mathematics Genealogy Project
  4. ↑ Akatov, Dmitri (2010). Exploiting parallelism in decomposition methods for constraint satisfaction (PhD thesis). University of Oxford.
  5. ↑ Marnette, Bruno (2010). Tractable schema mappings under oblivious termination (DPhil thesis). University of Oxford.
  6. ↑ Miklos, Zoltan (2008). Understanding Tractable Decompositions for Constraint Satisfaction (DPhil thesis).
  7. ↑ Sellers, Andrew (2011). OXPath : a scalable, memory-efficient formalism for data extraction from modern web applications (DPhil thesis). University of Oxford publisher=University of Oxford.
  8. ↑ "ACM Fellows". Association for Computer Machinery. 2009. Retrieved 24 May 2010.
  9. 1 2 "New Royal Society Fellows for 2010". Oxford University. 21 May 2010. Retrieved 24 May 2010.
  10. ↑ Georg Gottlob from the Association for Computing Machinery (ACM) Digital Library
  11. ↑ Winslett, M. (2007). "Georg Gottlob speaks out" (PDF). ACM SIGMOD Record 36 (2): 27. doi:10.1145/1328854.1328860.
  12. ↑ Georg Gottlob's publications indexed by the Scopus bibliographic database, a service provided by Elsevier.
  13. ↑ 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. doi:10.1145/1149114.1149117.
  14. ↑ Dantsin, E.; Eiter, T.; Gottlob, G.; Voronkov, A. (2001). "Complexity and expressive power of logic programming". ACM Computing Surveys 33 (3): 374. doi:10.1145/502807.502810.
  15. ↑ Georg Gottlob's publications indexed by the DBLP Bibliography Server at the University of Trier
  16. ↑ Eiter, T.; Gottlob, G.; Mannila, H. (1997). "Disjunctive datalog". ACM Transactions on Database Systems 22 (3): 364. doi:10.1145/261124.261126.
  17. ↑ Eiter, T.; Gottlob, G. (1995). "The complexity of logic-based abduction". Journal of the ACM 42: 3. doi:10.1145/200836.200838.
  18. ↑ Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990. ISBN 9783642839542
  19. ↑ Gottlob, G. (1992). "Complexity Results for Nonmonotonic Logics". Journal of Logic and Computation 2 (3): 397. doi:10.1093/logcom/2.3.397.
  20. ↑ 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 0897915194.
  21. ↑ Eiter, T.; Gottlob, G. (1995). "Identifying the Minimal Transversals of a Hypergraph and Related Problems". SIAM Journal on Computing 24 (6): 1278. doi:10.1137/S0097539793250299.
  22. ↑ Gottlob, G.; Leone, N.; Scarcello, F. (2002). "Hypertree Decompositions and Tractable Queries". Journal of Computer and System Sciences 64 (3): 579. doi:10.1006/jcss.2001.1809.
  23. ↑ 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.
  24. ↑ 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. doi:10.1007/s00778-012-0286-6.
  25. ↑ Gottlob, G.; Koch, C.; Pichler, R. (2005). "Efficient algorithms for processing XPath queries". ACM Transactions on Database Systems 30 (2): 444. doi:10.1145/1071610.1071614.
  26. ↑ 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. doi:10.1145/1059513.1059520.
  27. ↑ "EC/2010/17: Gottlob, Georg. Library and Archive Catalogue". London: The Royal Society. Archived from the original on 2014-03-21.


This article is issued from Wikipedia - version of the Tuesday, April 12, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.