| 词条 | Georg Gottlob |
| 释义 |
| name = Georg Gottlob | image = Georg gottlob-official3.png | image_size = | caption = | birth_date = {{Birth date and age|df=yes|1956|6|30}}[1] | birth_place = Vienna, Austria | death_date = | death_place = | residence = Oxford, United Kingdom | citizenship = | nationality = Austrian and Italian | ethnicity = | field = {{Plainlist|
| work_institution = {{Plainlist|
| alma_mater = Vienna University of Technology | doctoral_advisor = Curt Christian[2] | doctoral_students = {{Plainlist|
| thesis_title = Mehrwertige Logik – Aufbau und Anwendung in der Informatik | thesis_year = 1981 | thesis_url = https://books.google.com/books/about/Mehrwertige_Logik.html?id=53YYcgAACAAJ | known_for = | author_abbreviation_bot = | author_abbreviation_zoo = | prizes = {{Plainlist|
| religion = | footnotes = | website = {{URL|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.[5][6][7][8][9][10][11][12][13] EducationGottlob obtained his undergraduate and PhD degrees in computer science at Vienna University of Technology in 1981. Career and ResearchGottlob 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.[4] 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 honoursGottlob has received numerous awards and honours including election to the Royal Society in 2010. His nomination for the Royal Society reads: {{Cquote|text=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.[23] }} Gottlob has also been designated as an ECCAI fellow [https://web.archive.org/web/20110123075833/http://www.eccai.org/fellow.php?sort=year] in 2002. References1. ^{{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}} {{FRS 2010}}{{Authority control}}{{DEFAULTSORT:Gottlob, Georg}}2. ^1 {{MathGenealogy|id=102234}} 3. ^{{cite web |url= http://fellows.acm.org/fellow_citation.cfm?id=2684009&srt=all|title= ACM Fellows|year= 2009|publisher= Association for Computer Machinery|accessdate=24 May 2010}} 4. ^1 {{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 |deadurl=yes |archiveurl=https://web.archive.org/web/20100527062015/http://www.ox.ac.uk/media/news_stories/2010/100521_1.html |archivedate=27 May 2010 |df= }} 5. ^1 {{GoogleScholar|i72_SkUAAAAJ}} 6. ^{{ACMPortal|id=81100270478}} 7. ^{{Cite journal|doi=10.1145/1328854.1328860 |title=Georg Gottlob speaks out |journal=ACM SIGMOD Record |volume=36 |issue=2 |pages=27 |year=2007 |url=http://www.sigmod.org/publications/interview/pdf/p27.winslett-gottlob.pdf |last1=Winslett |first1=M. |authorlink=Marianne Winslett |deadurl=yes |archiveurl=https://web.archive.org/web/20110611062514/http://www.sigmod.org/publications/interview/pdf/p27.winslett-gottlob.pdf/ |archivedate=11 June 2011 |df= }} 8. ^{{Scopus|id=7005068491}} 9. ^{{Cite journal | doi = 10.1145/1149114.1149117| title = The DLV system for knowledge representation and reasoning| journal = ACM Transactions on Computational Logic| volume = 7| issue = 3| pages = 499| year = 2006| last1 = Leone | first1 = N. | last2 = Pfeifer | first2 = G. | last3 = Faber | first3 = W. | last4 = Eiter | first4 = T. | last5 = Gottlob | first5 = G. | last6 = Perri | first6 = S. | last7 = Scarcello | first7 = F. | arxiv = cs/0211004}} 10. ^{{Cite journal | doi = 10.1145/502807.502810| title = Complexity and expressive power of logic programming| journal = ACM Computing Surveys| volume = 33| issue = 3| pages = 374| year = 2001| last1 = Dantsin | first1 = E. | last2 = Eiter | first2 = T. | last3 = Gottlob | first3 = G. | authorlink3 = Georg Gottlob| last4 = Voronkov | first4 = A. | authorlink4 = Andrei Voronkov| citeseerx = 10.1.1.28.4997}} 11. ^{{DBLP|name=Georg Gottlob}} 12. ^{{Cite journal | doi = 10.1145/261124.261126| title = Disjunctive datalog| journal = ACM Transactions on Database Systems| volume = 22| issue = 3| pages = 364| year = 1997| last1 = Eiter | first1 = T. | last2 = Gottlob | first2 = G. | last3 = Mannila | first3 = H. }} 13. ^{{Cite journal | doi = 10.1145/200836.200838| title = The complexity of logic-based abduction| journal = Journal of the ACM| volume = 42| pages = 3–42| year = 1995| last1 = Eiter | first1 = T. | last2 = Gottlob | first2 = G. }} 14. ^Stefano Ceri, Georg Gottlob, and Letizia Tanca: Logic programming and databases. Springer-Verlag, 1990. {{ISBN|9783642839542}} 15. ^{{Cite journal | doi = 10.1093/logcom/2.3.397| title = Complexity Results for Nonmonotonic Logics| journal = Journal of Logic and Computation| volume = 2| issue = 3| pages = 397–425| year = 1992| last1 = Gottlob | first1 = G. }} 16. ^{{Cite book | doi = 10.1145/137097.137886| chapter = On the complexity of propositional knowledge base revision, updates, and counterfactuals| title = Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '92| pages = 261| year = 1992| last1 = Eiter | first1 = T. | last2 = Gottlob | first2 = G. | isbn = 978-0897915199}} 17. ^{{Cite journal | doi = 10.1137/S0097539793250299| title = Identifying the Minimal Transversals of a Hypergraph and Related Problems| journal = SIAM Journal on Computing| volume = 24| issue = 6| pages = 1278| year = 1995| last1 = Eiter | first1 = T. | last2 = Gottlob | first2 = G. | citeseerx = 10.1.1.37.883}} 18. ^{{Cite journal | doi = 10.1006/jcss.2001.1809| title = Hypertree Decompositions and Tractable Queries| journal = Journal of Computer and System Sciences| volume = 64| issue = 3| pages = 579| year = 2002| last1 = Gottlob | first1 = G. | last2 = Leone | first2 = N. | last3 = Scarcello | first3 = F. }} 19. ^{{Cite journal| last = Kolaitis| first = Phokion G.| last2 = Vardi| first2 = Moshe Y.| authorlink2 = Moshe Y. Vardi| title = Conjunctive-Query Containment and Constraint Satisfaction| journal = Journal of Computer and System Sciences| volume = 61| issue = 2| pages = 302–332| year = 2000| doi = 10.1006/jcss.2000.1713 }} 20. ^{{Cite journal | doi = 10.1007/s00778-012-0286-6| title = OXPath: A language for scalable data extraction, automation, and crawling on the deep web| journal = The VLDB Journal| volume = 22| pages = 47–72| year = 2012| last1 = Furche | first1 = T. | last2 = Gottlob | first2 = G. | last3 = Grasso | first3 = G. | last4 = Schallhart | first4 = C. | last5 = Sellers | first5 = A. }} 21. ^{{Cite journal | doi = 10.1145/1071610.1071614| title = Efficient algorithms for processing XPath queries| journal = ACM Transactions on Database Systems| volume = 30| issue = 2| pages = 444| year = 2005| last1 = Gottlob | first1 = G. | last2 = Koch | first2 = C. | last3 = Pichler | first3 = R. | citeseerx = 10.1.1.18.9591}} 22. ^{{Cite journal | doi = 10.1145/1059513.1059520| title = The complexity of XPath query evaluation and XML typing| journal = Journal of the ACM| volume = 52| issue = 2| pages = 284| year = 2005| last1 = Gottlob | first1 = G. | last2 = Koch | first2 = C. | last3 = Pichler | first3 = R. | last4 = Segoufin | first4 = L. | citeseerx = 10.1.1.598.1938}} 23. ^{{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=21 March 2014 |archiveurl=https://www.webcitation.org/6OF0XhUQ3?url=http://royalsociety.org/DServe/dserve.exe?dsqIni=Dserve.ini&dsqApp=Archive&dsqDb=Catalog&dsqCmd=show.tcl&dsqSearch=%28RefNo%3D%3D%27EC%2F2010%2F17%27%29 |location=London |deadurl=yes |df=dmy-all }} 14 : 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 the Department of Computer Science, University of Oxford|Members of Academia Europaea|1956 births|Scientists from Vienna|Vienna University of Technology alumni|Fellows of St Anne's College, Oxford|Fellows of St John's College, Oxford|Vienna University of Technology faculty |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。