Name
Affiliation
Papers
EGOR V. KOSTYLEV
University of Edinburgh
64
Collaborators
Citations 
PageRank 
60
218
26.04
Referers 
Referees 
References 
383
738
695
Search Limit
100738
Title
Citations
PageRank
Year
GNNQ: A Neuro-Symbolic Approach to Query Answering over Incomplete Knowledge Graphs.00.342022
Ontology Reshaping for Knowledge Graph Construction: Applied on Bosch Welding Case.00.342022
DatalogMTL with Negation Under Stable Models Semantics.00.342021
Stratified Negation In Datalog With Metric Temporal Operators00.342021
Towards Ontology Reshaping for KG Generation with User-in-the-Loop - Applied to Bosch Welding.00.342021
Two variable logic with ultimately periodic counting00.342020
The Expressive Power of Graph Neural Networks as a Query Language10.352020
Tractable Fragments of Datalog with Metric Temporal Operators00.342020
The Logical Expressiveness of Graph Neural Networks10.342020
DatalogMTL over the Integer Timeline.00.342020
Complexity And Expressive Power Of Disjunction And Negation In Limit Datalog00.342020
Bagging the DL-Lite Family Further.00.342019
Logical foundations of linked data anonymisation00.342019
DatalogMTL - Computational Complexity and Expressive Power.00.342019
Foundations of Ontology−Based Data Access under Bag Semantics10.362019
Towards Explainable Entity Matching via Comparison Queries.00.342019
Limit Datalog: A Declarative Query Language for Data Analysis00.342019
Bag Semantics of DL-Lite with Functionality Axioms.00.342019
Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable.00.342019
Satisfaction and Implication of Integrity Constraints in Ontology-based Data Access.00.342019
Query-Based Entity Comparison in Knowledge Graphs Revisited00.342019
Complexity and Expressive Power of Weakly Well-Designed SPARQL.00.342018
Stratified Negation in Limit Datalog Programs.10.352018
Logical foundations of information disclosure in ontology-based data integration.30.502018
A Note on the Hardness of the Critical Tuple Problem.10.352018
Containment of queries for graphs with data.00.342018
Estimating the Cardinality of Conjunctive Queries over RDF Data Using Graph Summarisation.30.442018
SemFacet: Making Hard Faceted Search Easier.30.372017
Query Nesting, Assignment, and Aggregation in SPARQL 1.130.382017
Source Information Disclosure in Ontology-Based Data Integration.20.352017
Reformulating Queries: Theory and Practice.20.362017
Ranking, Aggregation, and Reachability in Faceted Search with SemFacet.30.372017
Foundations of Declarative Data Analysis Using Limit Datalog Programs.20.432017
Semantic Faceted Search with Aggregation and Recursion.80.432017
The Bag Semantics of Ontology-Based Data Access.00.342017
A Note on Computing Certain Answers to Queries over Incomplete Databases.00.342017
Logical Foundations of Privacy-Preserving Publishing of Linked Data.50.572016
Beyond Well-designed SPARQL.130.562016
Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1.50.432016
On Expressibility of Non-Monotone Operators in SPARQL.70.542016
Reverse Engineering SPARQL Queries.100.612016
Static analysis of navigational XPath over graph databases.20.372016
Nested Constructs vs. Sub-Selects in SPARQL.00.342016
Semantics of SPARQL under OWL 2 Entailment Regimes.00.342015
Queries with negation and inequalities over lightweight ontologies60.452015
CONSTRUCT Queries in SPARQL.50.422015
Xpath For Dl Ontologies70.442015
Complexity of answering counting aggregate queries over DL-Lite.30.372015
Controlled Query Evaluation for Datalog and OWL 2 Profile Ontologies.30.372015
SPARQL with Property Paths250.702015
  • 1
  • 2