Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Barbara Aquilani
Roberto Bergamaschi
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Hamdi Amroun
Shigeki Takeda
Home
/
Author
/
ANDRÉ HERNICH
Author Info
Open Visualization
Name
Affiliation
Papers
ANDRÉ HERNICH
Institut für Informatik, Johann Wolfgang Goethe-Universität, Robert-Mayer-Straβe 11-15, 60054 Frankfurt am Main, Germany
19
Collaborators
Citations
PageRank
14
87
8.30
Referers
Referees
References
135
310
370
Search Limit
100
310
Publications (19 rows)
Collaborators (14 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
2
0.36
2018
Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying.
1
0.35
2018
Query Answering in DL-Lite with Datatypes: A Non-Uniform Approach.
4
0.40
2017
Horn Rewritability vs PTime Query Answering for Description Logic TBoxes.
0
0.34
2017
Constraint Patterns for Tractable Ontology-Mediated Queries with Datatypes.
0
0.34
2016
Stable Model Semantics for Guarded Existential Rules and Description Logics.
11
0.54
2014
Semantics for Non-Monotone Queries in Data Exchange and Data Integration.
1
0.37
2013
Well-founded semantics for extended datalog and ontological reasoning
7
0.52
2013
Equality-Friendly Well-Founded Semantics and Applications to Description Logics.
9
0.49
2012
Computing universal models under guarded TGDs
0
0.34
2012
L-Recursion and a new Logic for Logarithmic Space
3
0.42
2011
Closed world data exchange
6
0.49
2011
Grundlagen der Anfrageverarbeitung beim relationalen Datenaustausch.
0
0.34
2010
Answering non-monotonic queries in relational data exchange
6
0.50
2010
Lower bounds for processing data with few random accesses to external memory
9
0.53
2009
Logic and data exchange: which solutions are "good" solutions?
4
0.42
2008
Randomized computations on large data sets: tight lower bounds
16
0.76
2006
Reversal complexity revisited
8
0.46
2006
Combining self-reducibility and partial information algorithms
0
0.34
2005
1