8 citations · 18 across the 10 of their papers we have counts for
12 papers
Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable
Mark Kaminski, Egor V. Kostylev
Weakly well-designed SPARQL patterns is a recent generalisation of well-designed patterns, which preserve good computational properties but also capture almost all patterns that ap…
The Window Validity Problem in Rule-Based Stream Reasoning
Alessandro Ronca, Mark Kaminski, Bernardo Cuenca Grau +1
Rule-based temporal query languages provide the expressive power and flexibility required to capture in a natural way complex analysis tasks over streaming data. Stream processing…
Stratified Negation in Limit Datalog Programs
Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev +2
There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation…
Stream Reasoning in Temporal Datalog
Alessandro Ronca, Mark Kaminski, Bernardo Cuenca Grau +2
In recent years, there has been an increasing interest in extending traditional stream processing engines with logical, rule-based, reasoning capabilities. This poses significant t…
The Bag Semantics of Ontology-Based Data Access
Charalampos Nikolaou, Egor V. Kostylev, George Konstantinidis +3
Ontology-based data access (OBDA) is a popular approach for integrating and querying multiple data sources by means of a shared ontology. The ontology is linked to the sources usin…
Foundations of Declarative Data Analysis Using Limit Datalog Programs
Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev +2
Motivated by applications in declarative data analysis, we study ---an extension of positive Datalog with arithmetic functions over integers. This la…