Prof. Dr. Georg Gottlob Univ

Total Page：16

File Type：pdf, Size：1020Kb

Speaker: Prof. Dr. Georg Gottlob Univ. Oxford, TU Wien Title: My adventures with Datalog: Walking the thin line between theory and practice Abstract: I have worked on various subjects, but ever since my years as PostDoc, I have been fascinated by Datalog, a logical programming language for reasoning and database querying. I will start this talk with a short introduction to Datalog, followed by an overview of some theoretical results on Datalog variants. This will be interleaved with a tale of four Datalog-related companies I co-founded: DLVSystem, Lixto, Wrapidity, and DeepReason.ai. I will also comment on the difficulties an academic has to face when spinning out a start-up, and on the satisfaction you may experience when your results are used in practice. Short Bio: Georg Gottlob is a Royal Society Research Professor and a Professor of Informatics at Oxford University. and at TU Wien. At Oxford he is a Fellow of St John's College. His interests include knowledge representation, logic and complexity, and database and Web querying. He has received various awards, among which the Wittgenstein Award (Austria) and the Ada Lovelace Medal (UK). He is a Fellow of the Royal Society, of the Austrian and German National Academies of Science, and of the Academia Europaea. He was a founder of Lixto, a company specialised in semi-automatic web data extraction which was acquired by McKinsey in 2013. Gottlob was awarded an ERC Advanced Investigator's Grant for the project "DIADEM: Domain-centric Intelligent Automated Data Extraction Methodology". Based on the results of this project, he co-founded Wrapidity Ltd, a company that specialised in fully automated web data extraction, which was acquired in 2016 by Meltwater. He is also a founder of two other (currently active) companies: DLVSYSTEM and DeepReason.AI. .

Copy Link

Recommended publications

ANDREAS PIERIS School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh, EH8 9AB, UK [email protected]
ANDREAS PIERIS School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh, EH8 9AB, UK [email protected] UNIVERSITY EDUCATION • D.Phil. in Computer Science, 2011 Department of Computer Science, University of Oxford Thesis: Ontological Query Answering: New Languages, Algorithms and Complexity Supervisor: Professor Georg Gottlob • M.Sc. in Mathematics anD FounDations oF Computer Science (with Distinction), 2007 Mathematical Institute, University of Oxford Thesis: Data Exchange and Schema Mappings Supervisor: Professor Georg Gottlob • B.Sc. in Computer Science (with Distinction, GPA: 9.06/10), 2006 Department of Computer Science, University of Cyprus Thesis: The Fully Mixed Nash Equilibrium Conjecture Supervisor: Professor Marios Mavronicolas EMPLOYMENT HISTORY • Lecturer (equivalent to Assistant ProFessor) in Databases, 09/2016 – present School of Informatics, University of Edinburgh • PostDoctoral Researcher, 11/2014 – 09/2016 Institute of Logic and Computation, Vienna University of Technology • PostDoctoral Researcher, 09/2011 – 10/2014 Department of Computer Science, University of Oxford RESEARCH Major research interests • Data management: knowledge-enriched data, uncertain data • Knowledge representation and reasoning: ontology languages, complexity of reasoning • Computational logic and its applications to computer science Research grants • EfFicient Querying oF Inconsistent Data, 09/2018 – 08/2022 Principal Investigator Funding agency: Engineering and Physical Sciences Research Council (EPSRC) Total award: £758,049 • Value AdDeD Data Systems: Principles anD Architecture, 04/2015 – 03/2020 Co-Investigator Funding agency: Engineering and Physical Sciences Research Council (EPSRC) Total award: £1,546,471 Research supervision experience • Marco Calautti, postdoctoral supervision, University of Edinburgh, 09/2016 – present • Markus Schneider, Ph.D. supervisor, University of Edinburgh, 09/2018 – present • Gerald Berger, Ph.D.
[Show full text]
Toward an Open Knowledge Research Graph.Pdf
THE SERIALS LIBRARIAN https://doi.org/10.1080/0361526X.2019.1540272 Toward an Open Knowledge Research Graph Sören Auera and Sanjeet Mann b aPresenter; bRecorder ABSTRACT KEYWORDS Knowledge graphs facilitate the discovery of information by organizing it into Knowledge graph; scholarly entities and describing the relationships of those entities to each other and to communication; Semantic established ontologies. They are popular with search and e-commerce com- Web; linked data; scientific panies and could address the biggest problems in scientific communication, research; machine learning according to Sören Auer of the Technische Informationsbibliothek and Leibniz University of Hannover. In his NASIG vision session, Auer introduced attendees to knowledge graphs and explained how they could make scientific research more discoverable, efficient, and collaborative. Challenges include incentiviz- ing researchers to participate and creating the training data needed to auto- mate the generation of knowledge graphs in all fields of research. Change in the digital world Thank you to Violeta Ilik and the NASIG Program Planning Committee for inviting me to this conference. I would like to show you where I come from. Leibniz University of Hannover has a castle that belonged to a prince, and next to the castle is the Technische Informationsbibliothek (TIB), responsible for supporting the scientific and technology community in Germany with publications, access, licenses, and digital information services. Figure 1 is an example of a knowledge graph about TIB. The basic ingredients of a knowledge graph are entities and relationships. We are the library of Leibniz University of Hannover and we are a member of Leibniz Association (a German research association).
[Show full text]
AAAI-11 Program Schedule.IAAI.EAAI
AAAI-11 Technical Program Schedule Monday, August 8 6:00 – 7:00 pm AAAI-11 Opening Reception Tuesday, August 9 8:30 - 9:00 am Grand Ballroom, Street Level AAAI-11/IAAI-11 Opening Ceremony Welcome and Opening Remarks Outstanding Award Presentations -- Papers, SPC Member, PC Member Wolfram Burgard and Dan Roth, AAAI-11 Program Cochairs IAAI Welcome, Robert S. Engelmore Award, Deployed Application Award Announcements Daniel Shapiro, IAAI-11 Conference Chair, Markus Fromherz, IAAI-11 Program Cochair, and David Leake, AI Magazine Editor-in-Chief Feigenbaum Prize, AAAI Classic Paper Award, Distinguished Service Award Fellows Announcement, Senior Member Recognition Eric Horvitz, AAAI Past President and Awards Committee Chair Henry Kautz, AAAI President 9:15 – 10:00 am AAAI-11 25th Conference Anniversary Panel Moderator: Manuela Veloso, AAAI President-Elect (Carnegie Mellon University) 10:00 – 10:20 am Coffee Break 10:20 - 11:20 am IAAI-11/AAAI-11 Joint Invited Talk: Building Watson: An Overview of DeepQA for the Jeopardy! Challenge David Ferrucci (IBM T J Watson Research Center) 11:30 am – 12:30 pm Description Logics 1 281: Revisiting Semantics for Epistemic Extensions of Description Logics Anees Mehdi, Sebastian Rudolph 242: Integrating Rules and Description Logics by Circumscription Qian Yang, Jia-Huai You, Zhiyong Feng 626: Conjunctive Query Inseparability of OWL 2QL TBoxes B. Konev, R. Kontchakov, M. Ludwig, T. Schneider, F. Wolter, M. Zakharyaschev Machine Learning 1 6024: Nectar: Quantity Makes Quality: Learning with Partial Views Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir 31: Symmetric Graph Regularized Constraint Propagation Zhenyong Fu, Zhiwu Lu, Horace H. S.
[Show full text]
Internationale Mathematische Nachrichten
INTERNATIONALE MATHEMATISCHE NACHRICHTEN INTERNATIONAL MATHEMATICAL NEWS NOUVELLES MATHEMA¶ TIQUES INTERNATIONALES NACHRICHTEN DER OSTERREICHISCHENÄ MATHEMATISCHEN GESELLSCHAFT EDITED BY OSTERREICHISCHEÄ MATHEMATISCHE GESELLSCHAFT Nr. 181 August 1999 WIEN INTERNATIONALE MATHEMATISCHE NACHRICHTEN INTERNATIONAL MATHEMATICAL NEWS NOUVELLES MATHEMA¶ TIQUES INTERNATIONALES GegrundetÄ 1947 von R. Inzinger, fortgefuhrtÄ von W. Wunderlich Herausgeber: OSTERREICHISCHEÄ MATHEMATISCHE GESELLSCHAFT Redaktion: P. Flor (U Graz; Herausgeber), U. Dieter (TU Graz), M. Drmota (TU Wien), L. Reich (U Graz) und J. Schwaiger (U Graz), unter stÄandiger Mit- arbeit von R. Mlitz (TU Wien) und E. Seidel (U Graz). ISSN 0020-7926. Korrespondenten DANEMARK:Ä M. E. Larsen (Dansk Matematisk Forening, Kopenhagen) FRANKREICH: B. Rouxel (Univ. Bretagne occ., Brest) GRIECHENLAND: N. K. Stephanidis (Univ. Saloniki) GROSSBRITANNIEN: The Institute of Mathematics and Its Applications (Southend-on-Sea), The London Mathematical Society JAPAN: K. Iseki¶ (Japanese Asoc. of Math. Sci) JUGOSLAWIEN: S. Pre·sic¶ (Univ. Belgrad) KROATIEN: M. Alic¶ (Zagreb) NORWEGEN: Norsk Matematisk Forening (Oslo) OSTERREICH:Ä C. Binder (TU Wien) RUMANIEN:Ä F.-K. Klepp (Timisoara) SCHWEDEN: Svenska matematikersamfundet (GÄoteborg) 2 SLOWAKEI: J. Sira· n· (Univ. Pre¼burg) SLOWENIEN: M. Razpet (Univ. Laibach) TSCHECHISCHE REPUBLIK: B. Maslowski (Akad. Wiss. Prag) USA: A. Jackson (Amer. Math. Soc., Providende RI) INTERNATIONALE MATHEMATISCHE NACHRICHTEN INTERNATIONAL MATHEMATICAL NEWS NOUVELLES MATHEMA¶
[Show full text]
Conference Program
Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI-11) Twenty-Third Conference on Innovative Applications of Artificial Intelligence (IAAI-11) Second Symposium on Educational Advances in Artificial Intelligence (EAAI-11) August 7 – 11, 2011 Hyatt Regency San Francisco San Francisco, California, USA Sponsored by the Association for the Advancement of Artificial Intelligence Cosponsored by the National Science Foundation, AI Journal, Google, Inc. Microsoft Research, Cornell University Institute for Computational Sustainability Naval Research Laboratory, Yahoo! Research Labs, NASA Ames Research Center University of Southern California/Information Sciences Institute, ACM/SIGART IBM Research, Videolectures.net, and David E. Smith Conference Program Acknowledgments Robotics Program Chair Contents The Association for the Advancement of Artifi- Andrea Thomaz (Georgia Institute of Technology, USA) cial Intelligence acknowledges and thanks the Acknowledgments / 2 following individuals for their generous contri- Poker Competition Cohairs AI Video Competition / 18 butions of time and energy to the successful Nolan Bard (University of Alberta, Canada) Awards / 2–4 creation and planning of the Twenty-Fifth AAAI Jonathan Rubin (University of Auckland, New Competitions / 18–19 Conference on Artificial Intelligence and the Zealand) Conference at a Glance / 5 Twenty-Third Conference on Innovative Appli- AI Video Competition Cochairs Doctoral Consortium / 8 cations of Artificial Intelligence. David Aha (Naval Research Laboratory, USA) EAAI-11 Program / 9 Arnav Jhala (University of California, Santa Cruz, Exhibition / 16 AAAI-11 Conference Committee USA) General Information / 20 IAAI-11 Program / 10–15 AAAI Conference Committee Chair A complete listing of the AAAI-11 / IAAI-11 / Invited Presentations / 3, 6–7 Dieter Fox (University of Washington, USA) EAAI-11 Program Committee members appears in Poker Competition / 18 AAAI-11 Program Cochairs the conference proceedings.
[Show full text]
Today Oxford
www.oxfordtoday.ox.ac.uk Michaelmas Term 2010 Volume 23 No 1 OX FOR D TODAY THE UNIVERSITY MAGAZINE 20 | WILFRED THESIGER AFRICA SEEN THROUGH HIS LENS 30 | SCIENCE WHEN TO SHARE GENE DATA? 45 | GEOFFREY HILL SEAMUS PERRY ON OUR GREATEST LIVING POET PRIME MINISTERS Why has Oxford produced so many? OXF01.cover 1 8/10/10 3:37:5 pm FROM HOME Since 1821 the Oxfordand Cambridge Club has provided alumni of both universities with an exclusive home from home in the heartofthe Capital. Todaymembers can relax, dine and meetfriends in supremely elegant surroundings thatalso featurewell stocked libraries,sports facilities and first-class bedroom accommodation. Reciprocal clubs welcome members of the Oxfordand Cambridge Club in 35 countriesaround the world. Formoreinformation, please contact: [email protected] or call +44 (0)20 7321 5110 Oxfordand Cambridge Club,71Pall Mall,LondonSW1Y 5HD www.oxfordandcambridgeclub.co.uk OX FOR D TODAY EDITOR: Dr Richard Lofthouse DEPUTY ART EDITOR: Steven Goldring DESIGNER: Victoria Ford HEAD OF PUBLICATIONS AND WEB OFFICE: Anne Brunner-Ellis PRODUCTION EDITOR: Kate Lloyd SUB EDITOR: Elizabeth Tatham PICTURE EDITOR: Joanna Kay DESIGN DIRECTOR: Dylan Channon Thanks to Simon Kirrane, Esther Woodman, Helen Cox, Emma Swift EDITORIAL ENQUIRIES: Janet Avison Public Affairs Directorate Tel: 01865 280545 Fax: 01865 270178 [email protected] www.oxfordtoday.ox.ac.uk ALUMNI ENQUIRIES, INCLUDING CHANGE OF ADDRESS: Claire Larkin Alumni Ofﬁ ce Tel: 01865 611610 Michaelmas [email protected] COVER IMAGE: HARRY BORDEN/CORBIS OUTLINE, ROB JUDGES www.alumni.ox.ac.uk Term 2010 University of Oxford, University Ofﬁ ces, Wellington Square, Oxford OX1 2JD ADVERTISING ENQUIRIES: Marie Longstaff Future Plus, Beaufort Court, 30 Monmouth Street, Bath BA1 2BW Tel: 01225 822849 [email protected] www.futureplc.com Oxford Today is published in February, June and October.
[Show full text]
Size and Treewidth Bounds for Conjunctive Queries
Size and Treewidth Bounds for Conjunctive Queries GEORG GOTTLOB University of Oxford, UK STEPHANIE TIEN LEE University of Oxford, UK GREGORY VALIANT University of California, Berkeley and PAUL VALIANT University of California, Berkeley This paper provides new worst-case bounds for the size and treewith of the result Q(D) of a conjunctive query Q applied to a database D. We derive bounds for the result size |Q(D)| in terms of structural properties of Q, both in the absence and in the presence of keys and functional dependencies. These bounds are based on a novel “coloring” of the query variables that associates a coloring number C(Q) to each query Q. Intuitively, each color used represents some possible entropy of that variable. Using this coloring number, we derive tight bounds for the size of Q(D) in case (i) no functional dependencies or keys are speciﬁed, and (ii) simple functional dependencies (keys) are given. These results generalize recent size-bounds for join queries obtained by Atserias et al. [2008]. In the case of arbitrary (compound) functional dependencies, we use tools from information theory to provide lower and upper bounds, establishing a close connection between size bounds and a basic question in information theory. Our new coloring scheme also allows us to precisely characterize (both in the absence of keys and with simple keys) the treewidth-preserving queries—the queries for which the treewidth of the output relation is bounded by a function of the treewidth of the input database. Finally, we give some results on the computational complexity of determining the size bounds, and of deciding whether the treewidth is preserved.
[Show full text]
Reasoning on Anonymity in Datalog+/-∗
Reasoning on Anonymity in Datalog+/-∗ Giovanni Amendola1, Nicola Leone2, Marco Manna3, and Pierfrancesco Veltri4 1 DEMACS, University of Calabria, Italy [email protected] 2 DEMACS, University of Calabria, Italy [email protected] 3 DEMACS, University of Calabria, Italy [email protected] 4 DEMACS, University of Calabria, Italy [email protected] Abstract In this paper we empower the ontology-based query answering framework with the ability to reason on the properties of “known” (non-anonymous) and anonymous individuals. To this end, we extend Datalog+/- with epistemic variables that range over “known” individuals only. The res- ulting framework, called datalog∃,K , offers good and novel knowledge representation capabilities, allowing for reasoning even on the anonymity of individuals. To guarantee effective computab- ility, we define shyK, a decidable subclass of datalog∃,K , that fully generalizes (plain) Datalog, enhancing its knowledge modeling features without any computational overhead: OBQA for shyK keeps exactly the same (data and combined) complexity as for Datalog. To measure the express- iveness of shyK, we borrow the notion of uniform equivalence from answer set programming, and show that shyK is strictly more expressive than the DL ELH. Interestingly, shyK keeps a lower complexity, compared to other Datalog+/- languages that can express this DL. 1998 ACM Subject Classification D.1.6 Logic Programming Keywords and phrases Datalog, query answering, Datalog+/-, ontologies, expressiveness Digital Object Identifier 10.4230/OASIcs.ICLP.2017.3 1 Introduction In ontology-based query answering (OBQA), a user query q is evaluated over a logical theory consisting of an extensional database D paired with an ontology Σ.
[Show full text]
Computer Science As the Continuation of Logic by Other Means
Computer Science as the continuation of Logic by other means Georg Gottlob Oxford University & TU Vienna Formal Logic All Sciences classify statements as true or false. Formal Logic establishes rules for deriving true statements from other true statements, and for refutation. Logic is the mother of all sciences. Some formal logic should be taught in all sciences and disciplines. Goethe´s Faust STUDENT ASKS: I want to be a true scholar, I want to grasp, by the collar, What´s on earth, in heaven above In Science, and in Nature too. ... ANSWER: ... My dear friend, I´d advise in sum First, the Collegium Logicum. There your mind will be trained, As if in Spanish boots, constrained, So that painfully, as it ought, It creeps along the way of thought, Not flitting about all over, Wandering here and there. .... Goethe´s Faust STUDENT ASKS: I want to be a true scholar, I want to grasp, by the collar, What´s on earth, in heaven above In Science, and in Nature too. ... ANSWER: ... My dear friend, I´d advise in sum First, the Collegium Logicum. There your mind will be trained, As if in Spanish boots, constrained, So that painfully, as it ought, It creeps along the way of thought, Not flitting about all over, Wandering here and there. .... Computer Science While logical methods are omnipresent in all sciences, there is a unique "new" discipline that: is historically rooted in Logic uses predominantly logical methods continually poses logical problems and . challenges to Formal Logic takes logic further Computer Science While logical methods are omnipresent in all sciences, there is a unique "new" discipline that: is historically rooted in Logic uses predominantly logical methods continually poses logical problems and .
[Show full text]
Achieving New Upper Bounds for the Hypergraph Duality Problem Through Logic
ORE Open Research Exeter TITLE Achieving new upper bounds for the hypergraph duality problem through logic AUTHORS Gottlob, G; Malizia, E JOURNAL SIAM Journal on Computing DEPOSITED IN ORE 28 November 2017 This version available at http://hdl.handle.net/10871/33327 COPYRIGHT AND REUSE Open Research Exeter makes this work available in accordance with publisher policies. A NOTE ON VERSIONS The version presented here may diﬀer from the published version. If citing, you are advised to consult the published version for pagination, volume/issue and date of publication SIAM J. COMPUT. c 2018 Society for Industrial and Applied Mathematics Vol. 47, No. 2, pp. 456{492 ACHIEVING NEW UPPER BOUNDS FOR THE HYPERGRAPH DUALITY PROBLEM THROUGH LOGIC∗ y z GEORG GOTTLOB AND ENRICO MALIZIA Abstract. The hypergraph duality problem Dual is deﬁned as follows: given two simple hyper- graphs G and H, decide whether H consists precisely of all minimal transversals of G (in which case we say that G is the dual of H or, equivalently, the transversal hypergraph of H). This problem is equivalent to deciding whether two given nonredundant monotone disjunctive normal forms/conjunctive normal forms are dual. It is known that Dual, the complementary problem to 2 Dual, is in GC(log n, PTIME), where GC(f(n), C) denotes the complexity class of all problems that after a nondeterministic guess of O(f(n)) bits can be decided (checked) within complexity class C. It was conjectured that Dual is in GC(log2 n, LOGSPACE). In this paper we prove this conjecture and actually place the Dual problem into the complexity class GC(log2 n, TC0) which is a subclass of GC(log2 n, LOGSPACE).
[Show full text]
Hypertree Decompositions for Optimal Winner Determination in Combinatorial Auctions
.............................. Univ.Prof. Dr. Georg Gottlob masterarbeit Hypertree Decompositions for Optimal Winner Determination in Combinatorial Auctions ausgeführt am Institut fürInformationssysteme Abteilung fürDatenbanken und Artificial Intelligence der Technischen UniversitätWien unter der Anleitung von O.Univ.Prof. Dr.techn. Georg Gottlob Privatdoz. Dr.techn. Nysret Musliu Projektass. Dipl.-Ing. Werner Schafhauser durch Ekaterina Lebedeva Wien, 10. März 2008 . Ekaterina Lebedeva ii .............................. Univ.Prof. Dr. Georg Gottlob Master Thesis Hypertree Decompositions for Optimal Winner Determination in Combinatorial Auctions carried out at the Institute of Information Systems Database and Artificial Intelligence Group of the Vienna University of Technology under the instruction of O.Univ.Prof. Dr.techn. Georg Gottlob Privatdoz. Dr.techn. Nysret Musliu Projektass. Dipl.-Ing. Werner Schafhauser by Ekaterina Lebedeva Vienna, March 10, 2008 . Ekaterina Lebedeva ii Contents Abstract vii Dedication ix Acknowledgements xi 1 Introduction 1 2 Basic Concepts 5 2.1 Combinatorial Auctions (CA) . 5 2.1.1 Basic Definitions of Combinatorial Auctions . 5 2.1.2 The WDP for CAs . 6 2.2 Constraint Satisfaction Problems . 6 2.3 Graphs . 9 2.3.1 Basic Definitions of Graphs . 9 2.3.2 Tree Decompositions of Graphs . 9 2.4 Hypergraphs . 10 2.4.1 Basic Definitions of Hypergraphs . 10 2.4.2 Hypertree Decompositions of Hypergraphs . 13 2.4.3 Maximum-Weighted Set Packing Problem . 16 2.5 Decomposition Methods for CSPs . 17 2.5.1 General Framework of Decomposition Methods for CSPs 18 2.5.2 Hypertree Decomposition Method for CSPs . 19 3 Solving the WDP for CAs 21 3.1 Complexity of the WDP for CAs .
[Show full text]
The Space-Efficient Core of Vadalog
The Space-Eﬀicient Core of Vadalog Gerald Berger Georg Gottlob Institute of Logic and Computation Department of Computer Science TU Wien University of Oxford & TU Wien Andreas Pieris Emanuel Sallinger School of Informatics Department of Computer Science University of Edinburgh University of Oxford ABSTRACT 1.1 The Vadalog System Vadalog is a system for performing complex reasoning tasks such Vadalog is a system for performing complex reasoning tasks such as those required in advanced knowledge graphs. The logical core as those required in advanced knowledge graphs [6, 15, 25]. It is of the underlying Vadalog language is the warded fragment of Oxford’s contribution to the VADA research project [23], a joint tuple-generating dependencies (TGDs). This formalism ensures eﬀort of the universities of Oxford, Manchester, and Edinburgh, as tractable reasoning in data complexity, while a recent analysis well as around 20 industrial partners such as Facebook, BP, and the focusing on a practical implementation led to the reasoning al- NHS (UK national health system). One of the most fundamental gorithm around which the Vadalog system is built. A fundamen- reasoning tasks performed by Vadalog is ontological query answer- tal question that has emerged in the context of Vadalog is the ing: given a database D, an ontology Σ (which is essentially a set following: can we limit the recursion allowed by wardedness in of logical assertions that allow us to derive new intensional knowl- order to obtain a formalism that provides a convenient syntax edge from D), and a query q(x¯) (typically a conjunctive query), the for expressing useful recursive statements, and at the same time goal is to compute the certain answers to q w.r.t.
[Show full text]