Georg Gottlob joint winner of 2021 Alonzo Church Award
Posted: 5th May 2021
Georg Gottlob (together with co-authors Christoph Koch, Reinhard Pichler, Klaus U. Schulz, and Luc Segouﬁn) has won the prestigious Alonzo Church Award. The award was made for fundamental work on logic-based web data extraction and querying tree-structured data.
The Alonzo Church Award for Outstanding Contributions to Logic and Computation was established in 2015 by the ACM Special Interest Group for Logic and Computation (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Gödel Society (KGS). The award is for an outstanding contribution represented by a paper or small group of papers within the past 25 years. The papers [1-4] for which Gottlob and his co-authors received the award are listed below.
Members of our department also won the Alonzo Church Award back in 2017.
 Georg Gottlob and Christoph Koch. “Monadic Datalog and the Expressive Power of Lan- guages for Web Information Extraction.” Journal of the ACM (JACM) 51.1 (2004): 74-113.
 Georg Gottlob, Christoph Koch, and Klaus U. Schulz. “Conjunctive Queries Over Trees.” Journal of the ACM (JACM) 53.2 (2006): 238-272.
 Georg Gottlob, Christoph Koch, and Reinhard Pichler. “Eﬃcient Algorithms for Processing XPath Queries.” ACM Transactions on Database Systems (TODS) 30.2 (2005): 444-491.
 Georg Gottlob, Christoph Koch, Reinhard Pichler, and Luc Segouﬁn. “The Complexity of XPath Query Evaluation and XML Typing.” Journal of the ACM (JACM) 52.2 (2005): 284-335.