default search action
André Hernich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Christoforos Svingos, André Hernich, Hinnerk Gildhoff, Yannis Papakonstantinou, Yannis E. Ioannidis:
Foreign Keys Open the Door for Faster Incremental View Maintenance. Proc. ACM Manag. Data 1(1): 40:1-40:25 (2023) - 2021
- [j7]Georg Gottlob, André Hernich, Clemens Kupke, Thomas Lukasiewicz:
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity. J. ACM 68(5): 35:1-35:87 (2021) - 2020
- [j6]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. ACM Trans. Comput. Log. 21(3): 20:1-20:47 (2020)
2010 – 2019
- 2018
- [c20]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying. IJCAI 2018: 1861-1867 - [i3]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. CoRR abs/1804.06894 (2018) - 2017
- [c19]André Hernich, Julio Lemos, Frank Wolter:
Query Answering in DL-Lite with Datatypes: A Non-Uniform Approach. AAAI 2017: 1142-1148 - [c18]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Horn Rewritability vs PTime Query Answering for Description Logic TBoxes. Description Logics 2017 - [c17]André Hernich, Phokion G. Kolaitis:
Foundations of information integration under bag semantics. LICS 2017: 1-12 - [c16]André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. PODS 2017: 185-199 - 2016
- [c15]André Hernich, Julio Lemos, Frank Wolter:
Constraint Patterns for Tractable Ontology-Mediated Queries with Datatypes. Description Logics 2016 - 2015
- [c14]André Hernich, Carsten Lutz, Ana Ozaki, Frank Wolter:
Schema.org as a Description Logic. Description Logics 2015 - [c13]André Hernich, Carsten Lutz, Ana Ozaki, Frank Wolter:
Schema.org as a Description Logic. IJCAI 2015: 3048-3054 - 2014
- [c12]Georg Gottlob, André Hernich, Clemens Kupke, Thomas Lukasiewicz:
Stable Model Semantics for Guarded Existential Rules and Description Logics. KR 2014 - 2013
- [c11]André Hernich, Clemens Kupke, Thomas Lukasiewicz, Georg Gottlob:
Well-Founded Semantics for Extended Datalog and Ontological Reasoning. Description Logics 2013: 209-220 - [c10]André Hernich, Clemens Kupke, Thomas Lukasiewicz, Georg Gottlob:
Well-founded semantics for extended datalog and ontological reasoning. PODS 2013: 225-236 - [p2]André Hernich:
Semantics for Non-Monotone Queries in Data Exchange and Data Integration. Data Exchange, Information, and Streams 2013: 161-184 - 2012
- [j5]Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner:
L-Recursion and a new Logic for Logarithmic Space. Log. Methods Comput. Sci. 9(1) (2012) - [c9]Georg Gottlob, André Hernich, Clemens Kupke, Thomas Lukasiewicz:
Equality-Friendly Well-Founded Semantics and Applications to Description Logics. AAAI 2012: 757-764 - [c8]Georg Gottlob, André Hernich, Clemens Kupke, Thomas Lukasiewicz:
Equality-Friendly Well-Founded Semantics and Applications to Description Logics. Description Logics 2012 - [c7]André Hernich:
Computing universal models under guarded TGDs. ICDT 2012: 222-235 - 2011
- [j4]André Hernich:
Answering Non-Monotonic Queries in Relational Data Exchange. Log. Methods Comput. Sci. 7(3) (2011) - [j3]André Hernich, Leonid Libkin, Nicole Schweikardt:
Closed world data exchange. ACM Trans. Database Syst. 36(2): 14:1-14:40 (2011) - [c6]Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner:
L-Recursion and a new Logic for Logarithmic Space. CSL 2011: 277-291 - 2010
- [b1]André Hernich:
Foundations of query answering in relational data exchange. Goethe University Frankfurt am Main, 2010, ISBN 978-3-8325-2735-8, pp. 1-217 - [c5]André Hernich:
Answering non-monotonic queries in relational data exchange. ICDT 2010: 143-154 - [p1]André Hernich:
Grundlagen der Anfrageverarbeitung beim relationalen Datenaustausch. Ausgezeichnete Informatikdissertationen 2010: 111-120
2000 – 2009
- 2009
- [j2]Martin Grohe, André Hernich, Nicole Schweikardt:
Lower bounds for processing data with few random accesses to external memory. J. ACM 56(3): 12:1-12:58 (2009) - 2008
- [j1]André Hernich, Nicole Schweikardt:
Reversal complexity revisited. Theor. Comput. Sci. 401(1-3): 191-205 (2008) - [c4]André Hernich, Nicole Schweikardt:
Logic and Data Exchange: Which Solutions Are "Good" Solutions? LOFT 2008: 61-85 - 2007
- [c3]André Hernich, Nicole Schweikardt:
CWA-solutions for data exchange settings with target dependencies. PODS 2007: 113-122 - [i2]Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized Computations on Large Data Sets: Tight Lower Bounds. CoRR abs/cs/0703081 (2007) - 2006
- [c2]Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized computations on large data sets: tight lower bounds. PODS 2006: 243-252 - [i1]André Hernich, Nicole Schweikardt:
Reversal Complexity Revisited. CoRR abs/cs/0608036 (2006) - 2005
- [c1]André Hernich, Arfst Nickelsen:
Combining Self-reducibility and Partial Information Algorithms. MFCS 2005: 483-494
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint