H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 76 Citations 26,117 314 World Ranking 558 National Ranking 36

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Artificial intelligence
  • Database

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.

His most cited work include:

  • The DLV system for knowledge representation and reasoning (1059 citations)
  • Complexity and expressive power of logic programming (673 citations)
  • Logic programming and databases (657 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Theoretical computer science (29.01%)
  • Datalog (21.70%)
  • Discrete mathematics (21.10%)

What were the highlights of his more recent work (between 2014-2021)?

  • Theoretical computer science (29.01%)
  • Datalog (21.70%)
  • Conjunctive query (19.88%)

In recent papers he was focusing on the following fields of study:

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.

Between 2014 and 2021, his most popular works were:

  • Hypertree Decompositions: Questions and Answers (55 citations)
  • The Vadalog system: datalog-based reasoning for knowledge graphs (44 citations)
  • Data Wrangling for Big Data: Challenges and Opportunities (35 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Artificial intelligence
  • Database

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.

Top Publications

The DLV system for knowledge representation and reasoning

Nicola Leone;Gerald Pfeifer;Wolfgang Faber;Thomas Eiter.
ACM Transactions on Computational Logic (2006)

1409 Citations

Logic programming and databases

Stefano Ceri;Georg Gottlob;Letizia Tanca.
(1990)

1172 Citations

Complexity and expressive power of logic programming

Evgeny Dantsin;Thomas Eiter;Georg Gottlob;Andrei Voronkov.
ACM Computing Surveys (2001)

916 Citations

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)

779 Citations

Visual Web Information Extraction with Lixto

Robert Baumgartner;Sergio Flesca;Georg Gottlob.
very large data bases (2001)

761 Citations

Efficient algorithms for processing XPath queries

Georg Gottlob;Christoph Koch;Reinhard Pichler.
ACM Transactions on Database Systems (2005)

648 Citations

Disjunctive datalog

Thomas Eiter;Georg Gottlob;Heikki Mannila.
ACM Transactions on Database Systems (1997)

616 Citations

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

Andrea Calí;Georg Gottlob;Thomas Lukasiewicz.
Journal of Web Semantics (2012)

569 Citations

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

Thomas Eiter;Georg Gottlob.
Artificial Intelligence (1992)

531 Citations

Identifying the Minimal Transversals of a Hypergraph and Related Problems

Thomas Eiter;Georg Gottlob.
SIAM Journal on Computing (1995)

524 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Georg Gottlob

Thomas Eiter

Thomas Eiter

TU Wien

Publications: 162

Nicola Leone

Nicola Leone

University of Calabria

Publications: 155

Stefan Woltran

Stefan Woltran

TU Wien

Publications: 131

Torsten Schaub

Torsten Schaub

University of Potsdam

Publications: 99

Wolfgang Faber

Wolfgang Faber

University of Klagenfurt

Publications: 80

Hans Tompits

Hans Tompits

TU Wien

Publications: 78

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 71

Riccardo Rosati

Riccardo Rosati

Sapienza University of Rome

Publications: 66

Miroslaw Truszczynski

Miroslaw Truszczynski

University of Kentucky

Publications: 66

Martin Gebser

Martin Gebser

University of Klagenfurt

Publications: 65

Leonid Libkin

Leonid Libkin

University of Edinburgh

Publications: 61

Thomas Lukasiewicz

Thomas Lukasiewicz

University of Oxford

Publications: 59

Diego Calvanese

Diego Calvanese

Free University of Bozen-Bolzano

Publications: 52

Michael Zakharyaschev

Michael Zakharyaschev

Birkbeck, University of London

Publications: 49

Marcelo Arenas

Marcelo Arenas

Pontificia Universidad Católica de Chile

Publications: 49

Something went wrong. Please try again later.