Education
Gottlob obtained his undergraduate and Doctor of Philosophy degrees in computer science at Vienna University of Technology in 1981.
university professor computer scientist
Gottlob obtained his undergraduate and Doctor of Philosophy degrees in computer science at Vienna University of Technology in 1981.
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 Street 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 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.
In the area of artificial intelligence, he is best known for his influential early work on the complexity of nonmonotonic logics and on (generalized) hypertree decompositions, 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.
His recent work on eXtensible Markup Language query languages (notably XPath) has helped create the complexity-theoretical foundations of this area.
German Academy of Sciences Leopoldina. Royal Society; Austrian Academy of Sciences. Academia Europaea]
He was elected a member of the Royal Society in May, 2010.
He is a founding member of the Oxford-Manitoba Institute.