2026 Georg Gottlob: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	88	688	667	4	4	465	29322

Research.com Recognitions

2026 - Research.com Computer Science in Italy Leader Award
2025 - Research.com Computer Science in United Kingdom Leader Award
2023 - Research.com Computer Science in United Kingdom Leader Award
2022 - 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 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
2006 - Member of Academia Europaea

Overview

Georg Gottlob is affiliated with the University of Oxford in the United Kingdom. Their research primarily spans the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Management Science and Operations Research, and Signal Processing.

The main topics of Georg Gottlob's work include:

Semantic Web and Ontologies
Advanced Database Systems and Queries
Logic, Reasoning, and Knowledge
Constraint Satisfaction and Optimization
Data Quality and Management
Natural Language Processing Techniques
Data Management and Algorithms

Their recent papers reflect interests in database systems, reasoning, and knowledge graphs. Selected papers include:

"Vadalog: A modern architecture for automated reasoning with large knowledge graphs" (2020), published in Information Systems
"Data science with Vadalog: Knowledge Graphs with machine learning and reasoning in practice" (2021), published in Future Generation Computer Systems
"Equality-Friendly Well-Founded Semantics and Applications to Description Logics" (2021), published in Proceedings of the AAAI Conference on Artificial Intelligence
"Semantic Optimization of Conjunctive Queries" (2020), published in Journal of the ACM
"HyperBench" (2021), published in ACM Journal of Experimental Algorithmics

Frequent co-authors include Matthias Lanzinger, Reinhard Pichler, Cem Okulmus, Davide Mario Longo, and Emanuel Sallinger. These collaborations have resulted in numerous joint publications contributing to the advancement of their core research areas.

Georg Gottlob's work has been published extensively in multiple venues. Notable publication venues are:

arXiv (Cornell University)
Zenodo (CERN European Organization for Nuclear Research)
Proceedings of the AAAI Conference on Artificial Intelligence
Journal of the ACM
Theory and Practice of Logic Programming

The scientist has been recognized with several honors and awards, including:

Fellow of the Royal Society, United Kingdom (2010)
ACM Fellow (2007) for contributions to the theory of artificial intelligence and database systems
Member of the German National Academy of Sciences Leopoldina (2006) in Informatics
Member of Academia Europaea (2006)

Best Publications

The DLV system for knowledge representation and reasoning

Nicola Leone;Gerald Pfeifer;Wolfgang Faber;Thomas Eiter

1561
Citations
Logic programming and databases

Stefano Ceri;Georg Gottlob;Letizia Tanca

1247
Citations
Complexity and expressive power of logic programming

Evgeny Dantsin;Thomas Eiter;Georg Gottlob;Andrei Voronkov

1165
Citations
Efficient algorithms for processing XPath queries

Georg Gottlob;Christoph Koch;Reinhard Pichler

1040
Citations
What you always wanted to know about Datalog (and never dared to ask)

S. Ceri;G. Gottlob;L. Tanca

1020
Citations
Visual Web Information Extraction with Lixto

Robert Baumgartner;Sergio Flesca;Georg Gottlob

838
Citations
Taming the infinite chase: query answering under expressive relational constraints

Andrea Calì;Georg Gottlob;Michael Kifer

799
Citations
Disjunctive datalog

Thomas Eiter;Georg Gottlob;Heikki Mannila

680
Citations
A general Datalog-based framework for tractable query answering over ontologies

Andrea Calí;Georg Gottlob;Thomas Lukasiewicz

666
Citations
On the complexity of propositional knowledge base revision, updates, and counterfactuals

Thomas Eiter;Georg Gottlob

595
Citations
The complexity of logic-based abduction

Thomas Eiter;Georg Gottlob

584
Citations
Identifying the Minimal Transversals of a Hypergraph and Related Problems

Thomas Eiter;Georg Gottlob

578
Citations
A comparison of structural CSP decomposition methods

Georg Gottlob;Nicola Leone;Francesco Scarcello

572
Citations
Complexity Results for Nonmonotonic Logics

Georg Gottlob

487
Citations
On the computational cost of disjunctive logic programming: Propositional case

Thomas Eiter;Georg Gottlob

482
Citations
Extending object-oriented systems with roles

Georg Gottlob;Michael Schrefl;Brigitte Röck

476
Citations
Hypertree Decompositions and Tractable Queries

Georg Gottlob;Nicola Leone;Francesco Scarcello

464
Citations
Visual and interactive wrapper generation, automated information extraction from web pages, and translation into xml

Robert Baumgartner;Sergio Flesca;Georg Gottlob;Marcus Herzog

385
Citations
Pure Nash equilibria: hard and easy games

Georg Gottlob;Gianluigi Greco;Francesco Scarcello

354
Citations
Monadic datalog and the expressive power of languages for Web information extraction

Georg Gottlob;Christoph Koch

341
Citations

Frequent Co-Authors

Thomas Eiter TU Wien

Nicola Leone University of Calabria

Thomas Lukasiewicz University of Oxford

Christoph Koch École Polytechnique Fédérale de Lausanne

Stefano Ceri Polytechnic University of Milan

Letizia Tanca Polytechnic University of Milan

Thomas Schwentick TU Dortmund University

Gerhard Friedrich University of Klagenfurt

Helmut Veith TU Wien

Wolfgang Faber University of Klagenfurt

External Links

Wikipedia of Georg Gottlob Personal website of Georg Gottlob Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees can open up a wide range of career opportunities in Computer Science and related fields. Flexible study options make it easier than ever to combine education with work or family commitments. Many students are now searching for the cheapest doctoral programs available, helping to minimize student debt while earning advanced credentials.

For those interested in educational leadership or moving into higher-level positions quickly, the fastest edd program online options are worth considering. These fast-track programs are designed for motivated students who want to complete their studies rapidly and move forward in their careers.

If you're looking for a faster pathway to start your professional journey, the best associate degree in 6 months online allows you to earn a recognized qualification in as little as half a year. This is an excellent choice for those eager to enter the workforce quickly or switch careers.

Additionally, many professionals explore technology-related roles within business as a career strategy. Understanding the online business degree cost can help you plan your education budget effectively, making long-term financial sense for aspiring business leaders and entrepreneurs.