Search Results for author: Mark Kaminski

Found 8 papers, 0 papers with code

The Window Validity Problem in Rule-Based Stream Reasoning

no code implementations7 Aug 2018 Alessandro Ronca, Mark Kaminski, Bernardo Cuenca Grau, Ian Horrocks

Rule-based temporal query languages provide the expressive power and flexibility required to capture in a natural way complex analysis tasks over streaming data.

Stratified Negation in Limit Datalog Programs

no code implementations25 Apr 2018 Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev, Boris Motik, Ian Horrocks

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 are delegated to a general-purpose query engine.

Negation

Stream Reasoning in Temporal Datalog

no code implementations10 Nov 2017 Alessandro Ronca, Mark Kaminski, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks

In recent years, there has been an increasing interest in extending traditional stream processing engines with logical, rule-based, reasoning capabilities.

Foundations of Declarative Data Analysis Using Limit Datalog Programs

no code implementations19 May 2017 Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev, Boris Motik, Ian Horrocks

Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers.

The Bag Semantics of Ontology-Based Data Access

no code implementations19 May 2017 Charalampos Nikolaou, Egor V. Kostylev, George Konstantinidis, Mark Kaminski, Bernardo Cuenca Grau, Ian Horrocks

The ontology is linked to the sources using mappings, which assign views over the data to ontology predicates.

Computing Horn Rewritings of Description Logics Ontologies

no code implementations20 Apr 2015 Mark Kaminski, Bernardo Cuenca Grau

We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset.

Ontology Module Extraction via Datalog Reasoning

no code implementations19 Nov 2014 Ana Armas Romero, Mark Kaminski, Bernardo Cuenca Grau, Ian Horrocks

Module extraction - the task of computing a (preferably small) fragment M of an ontology T that preserves entailments over a signature S - has found many applications in recent years.

Cannot find the paper you are looking for? You can Submit a new open access paper.