André Hernich

I am a postdoctoral researcher (wissenschaftlicher Mitarbeiter) at Humboldt-Universität Berlin in the Logic in Computer Science group headed by Prof. Martin Grohe.

My research interests include database theory, and logic in computer science (in particular, finite model theory).

From October 2012 to September 2013, I am visiting Phokion Kolaitis at the University of California, Santa Cruz. You can still contact me at my e-mail address given below.

Contact

E-Mail:
Phone:	+49-30-2093-3104
Office:	Johann von Neumann-Haus (Rudower Chaussee 25), house IV, room 404 (office hours by appointment)

Publications and Theses

• Well-Founded Semantics for Extended Datalog and Ontological Reasoning
  with Georg Gottlob, Clemens Kupke, and Thomas Lukasiewicz
  PODS 2013
• L-Recursion and a new Logic for Logarithmic Space
  with Martin Grohe, Berit Grußien, and Bastian Laubner
  Logical Methods in Computer Science 9(1), paper 11, 2013
  Also part of the Special Issue for CSL 2011
• Equality-Friendly Well-Founded Semantics and Applications to Description Logics
  with Georg Gottlob, Clemens Kupke, and Thomas Lukasiewicz
  AAAI 2012, p. 757-764. See here for the poster. This work was also presented at DL 2012.
• Computing Universal Models Under Guarded TGDs
  ICDT 2012, p. 222-235
• Answering Non-Monotonic Queries in Relational Data Exchange
  Logical Methods in Computer Science 7(3), paper 9, 2011
  Also part of the Special Issue for ICDT 2010
• L-Recursion and a new Logic for Logarithmic Space
  with Martin Grohe, Berit Grußien, and Bastian Laubner
  CSL 2011, p. 277-291
• Closed World Data Exchange
  with Leonid Libkin, and Nicole Schweikardt
  ACM Transactions on Database Systems 36(2), article 14, 2011
• Foundations of Query Answering in Relational Data Exchange
  Dissertation, Goethe-Universität Frankfurt am Main, Germany, 2010
  Also published at Logos Verlag Berlin, ISBN 978-3-8325-2735-8
• Answering Non-Monotonic Queries in Relational Data Exchange
  ICDT 2010, p. 143-154 (Best Student Paper Award)
• Logic and Data Exchange: Which Solutions are "Good" Solutions?
  with Nicole Schweikardt
  Logic and the Foundations of Game and Decision Theory - LOFT 8, p. 61-85, 2010
• Lower Bounds for Processing Data with Few Random Accesses to External Memory
  with Martin Grohe, and Nicole Schweikardt
  Journal of the ACM 56(3), article 12, 2009, Special Section for PODS 2006
• Reversal Complexity Revisited
  with Nicole Schweikardt
  Theoretical Computer Science 401(1-3), p. 191-205, 2008
• CWA-Solutions for Data Exchange Settings with Target Dependencies
  with Nicole Schweikardt
  PODS 2007, p. 113-122
• Randomized Computations on Large Data Sets: Tight Lower Bounds
  with Martin Grohe, and Nicole Schweikardt
  PODS 2006, p. 243-252
• Combining Self-Reducibility and Partial Information Algorithms
  with Arfst Nickelsen
  MFCS 2005, p. 422-434
• Combining Self-Reducibility with Partial Information Algorithms
  Diploma Thesis, Technische Universität Berlin, 2005

Teaching