Jump to content

Georg Gottlob: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Line 4: Line 4:
| image_size =
| image_size =
| caption =
| caption =
| birth_date = {{Birth date and age|1956|6|30|df=y}}<ref name="whoswho">{{cite web |url=http://www.ukwhoswho.com/view/article/oupww/whoswho/U254851 |title=GOTTLOB, Prof. Georg|work=Who's Who 2014, A & C Black, an imprint of Bloomsbury Publishing plc, 2014; online edn, Oxford University Press }}{{subscription required}}</ref>
| birth_date = {{Birth date and age|1956|6|30|df=y}}
| birth_place = [[Vienna]], [[Austria]]
| birth_place = [[Vienna]], [[Austria]]
| death_date =
| death_date =
Line 12: Line 12:
| nationality = [[Austria]]n and [[Italians|Italian]]
| nationality = [[Austria]]n and [[Italians|Italian]]
| ethnicity =
| ethnicity =
| field = [[Computer Science]]
| field = {{Plainlist|
*[[Algorithm]]s in [[Artificial Intelligence]] and [[Information system]]s
⚫
| work_institution = [[University of Oxford]]
*[[Database]]s
* [[Database theory]]
* [[Computational complexity theory]]
* [[Logic in Computer Science]]<ref name="googlescholar"/>}}
⚫
| work_institution = {{Plainlist|
* [[University of Oxford]]
* [[St John's College, Oxford]]
* [[Oxford-Man Institute]]
* [[:de:Technische Universität Wien|Technische Universität Wien]]}}
| alma_mater = [[Vienna University of Technology]]
| alma_mater = [[Vienna University of Technology]]
| doctoral_advisor = Curt Christian<ref name="mathgene">{{MathGenealogy|id=102234}}</ref>
| doctoral_advisor = Curt Christian<ref name="mathgene">{{MathGenealogy|id=102234}}</ref>
| doctoral_students =
| doctoral_students = {{Plainlist|
* Dmitri Akatov<ref name="akatovphd">{{cite thesis |degree=PhD |first=Dmitri|last=Akatov |title=Exploiting parallelism in decomposition methods for constraint satisfaction |publisher=University of Oxford |date=2010 |url=http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531942}}</ref>
* Michal Ceresna
* Robert Chandradoss
* José Díaz Prado
* Thomas Eiter
* Christian Fermüller
* Michael Fink
* Wolfgang Gatterbauer
* Marcus Herzog
* Ondrej Jaura
* Stefan Katzenbeisser
* Thomas Korimort
* Bruno Marnette<ref name="marnettephd">{{cite thesis |degree=DPhil |first=Bruno|last=Marnette |title=Tractable schema mappings under oblivious termination|publisher=University of Oxford |date=2010 |url=http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.533832}}</ref>
* Zoltan Miklos<ref name="zoltanphd">{{cite thesis |degree=DPhil |first=Zoltan|last=Miklos |title=OXPath : a scalable, memory-efficient formalism for data extraction from modern web applications|publisher=University of Oxford |date=2008|url=http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491400}}</ref>
* Reinhard Pichler
* Kurt Reichinger
* Gernot Salzer
* Marko Samer
* Andrew Sellers<ref name="sellersphd">{{cite thesis |degree=DPhil |first=Andrew|last=Sellers |title=Understanding Tractable Decompositions for Constraint Satisfaction|publisher=University of Oxford |date=2011|url=http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555325}}</ref>
* Wolfgang Slany
* Stefan Szeider
* Hans Tompits
* Helmut Veith<ref name="mathgene"/>}}
| thesis_title = Mehrwertige Logik - Aufbau und Anwendung in der Informatik
| thesis_title = Mehrwertige Logik - Aufbau und Anwendung in der Informatik
| thesis_year = 1981
| thesis_year = 1981
| thesis_url = http://books.google.co.uk/books/about/Mehrwertige_Logik.html?id=53YYcgAACAAJ
| known_for =
| known_for =
| author_abbreviation_bot =
| author_abbreviation_bot =
Line 28: Line 61:
*[[Academia Europaea|MAE]]
*[[Academia Europaea|MAE]]
*[[Austrian Academy of Sciences|MAAS]]
*[[Austrian Academy of Sciences|MAAS]]
*Member of the [[German Academy of Sciences Leopoldina]]
*Member of the [[German Academy of Sciences Leopoldina|Leopoldina]]
*[[Fellow of the Royal Society|FRS]]<ref name="Royal Society Fellow">{{cite web |url= http://www.ox.ac.uk/media/news_stories/2010/100521_1.html|title= New Royal Society Fellows for 2010 |date= 21 May 2010|publisher= Oxford University|accessdate=24 May 2010}}</ref>
*[[Fellow of the Royal Society|FRS]] (2010)<ref name="Royal Society Fellow">{{cite web |url= http://www.ox.ac.uk/media/news_stories/2010/100521_1.html|title= New Royal Society Fellows for 2010 |date= 21 May 2010|publisher= Oxford University|accessdate=24 May 2010}}</ref>
*[[ISI highly cited researcher]]}}
*[[ISI highly cited researcher]]}}
| religion =
| religion =
| footnotes =
| footnotes =
| website = {{URL|http://www.cs.ox.ac.uk/people/georg.gottlob}}
| website = {{URL|http://www.cs.ox.ac.uk/people/georg.gottlob}}
⚫
}}'''Georg Gottlob''' [[Fellow of the Royal Society|FRS]] is an [[Austrians|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]].<ref name="googlescholar">{{GoogleScholar|i72_SkUAAAAJ}}</ref><ref name="acm">{{ACMPortal|id=81100270478}}</ref><ref>[http://www.sigmod.org/publications/interview/pdf/p27.winslett-gottlob.pdf/ Interview with Georg Gottlob in ACM SIGMOD Record 36(2), June 2007]</ref><ref name="scopus">{{Scopus|id=7005068491}}</ref><ref>{{cite doi|10.1145/1149114.1149117|noedit}}</ref><ref>{{cite doi| 10.1145/502807.502810|noedit}}</ref><ref name="dblp">{{DBLP|id=Gottlob:Georg}}</ref><ref>{{cite doi|10.1145/261124.261126|noedit}}</ref><ref>{{cite doi|10.1145/200836.200838|noedit}}</ref>
}}
⚫
'''Georg Gottlob''' [[Fellow of the Royal Society|FRS]] is an [[Austrians|Austrian]] computer scientist who works in the areas of [[database theory]], [[logic]], and [[artificial intelligence]] and is [[Professor]] at the [[University of Oxford]].<ref name="acm">{{ACMPortal|id=81100270478}}</ref><ref>[http://www.sigmod.org/publications/interview/pdf/p27.winslett-gottlob.pdf/ Interview with Georg Gottlob in ACM SIGMOD Record 36(2), June 2007]</ref>


==Education==
==Education==
Gottlob obtained his [[Doctor of Philosophy|PhD]] in computer science at [[Vienna University of Technology]] in 1981.
Gottlob obtained his undergraduate and [[Doctor of Philosophy|PhD]] degrees in computer science at [[Vienna University of Technology]] in 1981.


==Career and Research==
==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.<ref name="Royal Society Fellow"/> He is a founding member of the [[Oxford-Man Institute]].
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.<ref name="Royal Society Fellow"/> 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.<ref>Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990.</ref>
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.<ref>Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990. ISBN 9783642839542</ref>


In the area of [[artificial intelligence]], he is best known for his influential early work on the complexity of nonmonotonic logics<ref>Georg Gottlob: Complexity Results for Nonmonotonic Logics. J. Log. Comput. 2(3): 397-425 (1992)</ref><ref>{{cite doi|10.1145/137097.137886|noedit}}</ref> and on [[hypertree decomposition]]s,<ref>{{cite doi|10.1137/S0097539793250299|noedit}}</ref><ref>{{cite doi|10.1006/jcss.2001.1809|noedit}}</ref> 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 query|conjunctive queries]] on [[relational databases]] is equivalent to the constraint satisfaction problem.<ref>{{cite doi|10.1006/jcss.2000.1713|noedit}}</ref> His recent work on XML query languages (notably [[XPath]]) has helped create the complexity-theoretical foundations of this area.<ref>{{cite doi|10.1145/1071610.1071614|noedit}}</ref><ref>{{cite doi|10.1145/1059513.1059520|noedit}}</ref>
In the area of [[artificial intelligence]], he is best known for his influential early work on the complexity of nonmonotonic logics<ref>{{cite doi|10.1093/logcom/2.3.397|noedit}}</ref><ref>{{cite doi|10.1145/137097.137886|noedit}}</ref> and on [[hypertree decomposition]]s,<ref>{{cite doi|10.1137/S0097539793250299|noedit}}</ref><ref>{{cite doi|10.1006/jcss.2001.1809|noedit}}</ref> 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 query|conjunctive queries]] on [[relational databases]] is equivalent to the constraint satisfaction problem.<ref>{{cite doi|10.1006/jcss.2000.1713|noedit}}</ref> His recent work on [[XML]] [[query language|s]] (notably [[XPath]]) has helped create the complexity-theoretical foundations of this area.<ref>{{cite doi| 10.1007/s00778-012-0286-6|noedit}}</ref><ref>{{cite doi|10.1145/1071610.1071614|noedit}}</ref><ref>{{cite doi|10.1145/1059513.1059520|noedit}}</ref>
==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: {{centered pull quote|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 optimization|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 logic|non-monotonic reasoning]] and database theory.<ref name="royal">{{cite web |url=http://royalsociety.org/DServe/dserve.exe?dsqIni=Dserve.ini&dsqApp=Archive&dsqDb=Catalog&dsqCmd=show.tcl&dsqSearch=(RefNo==%27EC%2F2010%2F17%27) |title = EC/2010/17: Gottlob, Georg. Library and Archive Catalogue |publisher=The Royal Society |archivedate=2014-03-21 |archiveurl= http://www.webcitation.org/6OF0XhUQ3 |location=London}}</ref> }}


==References==
==References==
{{reflist}}
<references/>





Line 70: Line 103:
[[Category:Royal Society Wolfson Research Merit Award holders]]
[[Category:Royal Society Wolfson Research Merit Award holders]]
[[Category:Members of Oxford University Department of Computer Science]]
[[Category:Members of Oxford University Department of Computer Science]]
[[Category:Members of Academia Europaea]]
[[Category:1956 births]]
[[Category:1956 births]]
[[Category:Scientists from Vienna]]
[[Category:Scientists from Vienna]]

Revision as of 15:05, 21 March 2014

Georg Gottlob
Born (1956-06-30) 30 June 1956 (age 67)[9]
Vienna, Austria
NationalityAustrian and Italian
Alma materVienna University of Technology
Awards
Scientific career
Fields
Institutions
ThesisMehrwertige Logik - Aufbau und Anwendung in der Informatik (1981)
Doctoral advisorCurt Christian[4]
Doctoral students
  • Dmitri Akatov[5]
  • Michal Ceresna
  • Robert Chandradoss
  • José Díaz Prado
  • Thomas Eiter
  • Christian Fermüller
  • Michael Fink
  • Wolfgang Gatterbauer
  • Marcus Herzog
  • Ondrej Jaura
  • Stefan Katzenbeisser
  • Thomas Korimort
  • Bruno Marnette[6]
  • Zoltan Miklos[7]
  • Reinhard Pichler
  • Kurt Reichinger
  • Gernot Salzer
  • Marko Samer
  • Andrew Sellers[8]
  • Wolfgang Slany
  • Stefan Szeider
  • Hans Tompits
  • Helmut Veith[4]
Websitewww.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.[3][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.[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.[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 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 s (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]

References

  1. ^ "ACM Fellows". Association for Computer Machinery. 2009. Retrieved 24 May 2010.
  2. ^ a b "New Royal Society Fellows for 2010". Oxford University. 21 May 2010. Retrieved 24 May 2010.
  3. ^ a b Georg Gottlob publications indexed by Google Scholar
  4. ^ a b Georg Gottlob at the Mathematics Genealogy Project
  5. ^ Akatov, Dmitri (2010). Exploiting parallelism in decomposition methods for constraint satisfaction (PhD thesis). University of Oxford.
  6. ^ Marnette, Bruno (2010). Tractable schema mappings under oblivious termination (DPhil thesis). University of Oxford.
  7. ^ Miklos, Zoltan (2008). OXPath : a scalable, memory-efficient formalism for data extraction from modern web applications (DPhil thesis). University of Oxford.
  8. ^ Sellers, Andrew (2011). Understanding Tractable Decompositions for Constraint Satisfaction (DPhil thesis). University of Oxford.
  9. ^ "GOTTLOB, Prof. Georg". Who's Who 2014, A & C Black, an imprint of Bloomsbury Publishing plc, 2014; online edn, Oxford University Press.(subscription required)
  10. ^ Georg Gottlob author profile page at the ACM Digital Library
  11. ^ Interview with Georg Gottlob in ACM SIGMOD Record 36(2), June 2007
  12. ^ Georg Gottlob's publications indexed by the Scopus bibliographic database. (subscription required)
  13. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1145/1149114.1149117, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1145/1149114.1149117 instead.
  14. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi: 10.1145/502807.502810, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi= 10.1145/502807.502810 instead.
  15. ^ Georg Gottlob at DBLP Bibliography Server Edit this at Wikidata
  16. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1145/261124.261126, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1145/261124.261126 instead.
  17. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1145/200836.200838, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1145/200836.200838 instead.
  18. ^ Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990. ISBN 9783642839542
  19. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1093/logcom/2.3.397, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1093/logcom/2.3.397 instead.
  20. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1145/137097.137886, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1145/137097.137886 instead.
  21. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1137/S0097539793250299, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1137/S0097539793250299 instead.
  22. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1006/jcss.2001.1809, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1006/jcss.2001.1809 instead.
  23. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1006/jcss.2000.1713, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1006/jcss.2000.1713 instead.
  24. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi: 10.1007/s00778-012-0286-6, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi= 10.1007/s00778-012-0286-6 instead.
  25. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1145/1071610.1071614, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1145/1071610.1071614 instead.
  26. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1145/1059513.1059520, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1145/1059513.1059520 instead.
  27. ^ "EC/2010/17: Gottlob, Georg. Library and Archive Catalogue". London: The Royal Society. Archived from the original on 2014-03-21.


Template:Persondata

Retrieved from "https://en.wikipedia.org/w/index.php?title=Georg_Gottlob&oldid=600603561"