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.
