G
Georg Gottlob
Researcher at University of Oxford
Publications - 478
Citations - 25439
Georg Gottlob is an academic researcher from University of Oxford. The author has contributed to research in topics: Datalog & Conjunctive query. The author has an hindex of 77, co-authored 462 publications receiving 24253 citations. Previous affiliations of Georg Gottlob include Stanford University & Polytechnic University of Milan.
Papers
More filters
Journal ArticleDOI
The DLV system for knowledge representation and reasoning
Nicola Leone,Gerald Pfeifer,Wolfgang Faber,Thomas Eiter,Georg Gottlob,Simona Perri,Francesco Scarcello +6 more
TL;DR: The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.
Journal ArticleDOI
Complexity and expressive power of logic programming
TL;DR: This article surveys various complexity and expressiveness results on different forms of logic programming, in particular, propositional logic programming and datalog, but it also mentions general logic programming with function symbols.
Book
Logic programming and databases
TL;DR: This book presents a systematic overview of the interaction between logic programming and database systems, and provides a careful introduction to the underlying paradigms and their theoretical foundations, and stresses the problems involved in achieving efficiency when interfacing logic programming formalisms with large databases.
Journal ArticleDOI
What you always wanted to know about Datalog (and never dared to ask)
TL;DR: The syntax and semantics of Datalog and its use for querying a relational database are presented, and the most relevant methods for achieving efficient evaluations of Daloog queries are presented.
Journal ArticleDOI
Disjunctive datalog
TL;DR: It is demonstrated that problems relevant in practice such as computing the optimal tour value in the Traveling Salesman Problem and eigenvector computations can be handled in disjunctive Datalog, but not Datalogs with negation (unless the Polynomial Hierarchy collapses).