2023 - Research.com Computer Science in United Kingdom Leader Award
2010 - Fellow of the Royal Society, United Kingdom
2007 - ACM Fellow For contributions to the theory of artificial intelligence and database systems.
2006 - Member of Academia Europaea
2006 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
Georg Gottlob spends much of his time researching Theoretical computer science, Conjunctive query, Datalog, Discrete mathematics and Time complexity. Georg Gottlob mostly deals with Stable model semantics in his studies of Theoretical computer science. His research in Conjunctive query intersects with topics in SQL, Description logic, Constraint satisfaction problem and Boolean conjunctive query.
His Datalog study is associated with Programming language. The various areas that Georg Gottlob examines in his Programming language study include Query language and Rotation formalisms in three dimensions. His Discrete mathematics research is multidisciplinary, relying on both Decision problem, Treewidth and Combinatorics.
Theoretical computer science, Datalog, Discrete mathematics, Conjunctive query and Programming language are his primary areas of study. His research investigates the connection between Theoretical computer science and topics such as Knowledge representation and reasoning that intersect with issues in Circumscription. His studies deal with areas such as Ontology, Negation, Semantic Web, Ontology and Query language as well as Datalog.
His work deals with themes such as Computational complexity theory, Treewidth and Combinatorics, which intersect with Discrete mathematics. The study incorporates disciplines such as Ontology language, Description logic, Boolean conjunctive query, Decidability and Constraint satisfaction problem in addition to Conjunctive query. His work in Programming language is not limited to one particular discipline; it also encompasses Relational database.
Georg Gottlob mostly deals with Theoretical computer science, Datalog, Conjunctive query, Hyperbolic tree and Constraint satisfaction problem. A large part of his Theoretical computer science studies is devoted to Logic programming. His Datalog study introduces a deeper knowledge of Programming language.
Georg Gottlob combines subjects such as Ontology, SPARQL, Existential quantification and Knowledge representation and reasoning with his study of Programming language. His biological study spans a wide range of topics, including Open problem, Containment, Tree, Algorithm and Query optimization. His Constraint satisfaction problem study combines topics from a wide range of disciplines, such as Hypergraph, Decomposition, Treewidth and Projection.
His main research concerns Datalog, Theoretical computer science, Conjunctive query, Programming language and Big data. His Datalog research includes themes of Ontology, Set, Knowledge graph, Query language and SPARQL. His research integrates issues of Computational complexity theory, Scalability and Rotation formalisms in three dimensions in his study of Theoretical computer science.
His study in Conjunctive query is interdisciplinary in nature, drawing from both Algorithm, Query optimization and Constraint satisfaction problem. His Programming language research includes elements of Applications of artificial intelligence, Decidability, Undecidable problem and Core. His Decidability study is concerned with Discrete mathematics in general.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The DLV system for knowledge representation and reasoning
Nicola Leone;Gerald Pfeifer;Wolfgang Faber;Thomas Eiter.
ACM Transactions on Computational Logic (2006)
Logic programming and databases
Stefano Ceri;Georg Gottlob;Letizia Tanca.
Complexity and expressive power of logic programming
Evgeny Dantsin;Thomas Eiter;Georg Gottlob;Andrei Voronkov.
ACM Computing Surveys (2001)
Efficient algorithms for processing XPath queries
Georg Gottlob;Christoph Koch;Reinhard Pichler.
ACM Transactions on Database Systems (2005)
What you always wanted to know about Datalog (and never dared to ask)
S. Ceri;G. Gottlob;L. Tanca.
IEEE Transactions on Knowledge and Data Engineering (1989)
Visual Web Information Extraction with Lixto
Robert Baumgartner;Sergio Flesca;Georg Gottlob.
very large data bases (2001)
Thomas Eiter;Georg Gottlob;Heikki Mannila.
ACM Transactions on Database Systems (1997)
A general Datalog-based framework for tractable query answering over ontologies
Andrea Calí;Georg Gottlob;Thomas Lukasiewicz.
Journal of Web Semantics (2012)
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Thomas Eiter;Georg Gottlob.
Artificial Intelligence (1992)
The complexity of logic-based abduction
Thomas Eiter;Georg Gottlob.
Journal of the ACM (1995)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: