Zobrazeno 1 - 10
of 131
pro vyhledávání: '"KRÖTZSCH, MARKUS"'
Autor:
Hanisch, Philipp, Krötzsch, Markus
The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to terminate.
Externí odkaz:
http://arxiv.org/abs/2403.16712
Autor:
Ivliev, Alex, Ellmauthaler, Stefan, Gerlach, Lukas, Marx, Maximilian, Meißner, Matthias, Meusel, Simon, Krötzsch, Markus
Publikováno v:
EPTCS 385, 2023, pp. 333-335
This system demonstration presents Nemo, a new logic programming engine with a focus on reliability and performance. Nemo is built for data-centric analytic computations, modelled in a fully declarative Datalog dialect. Its scalability for these task
Externí odkaz:
http://arxiv.org/abs/2308.15897
Several types of dependencies have been proposed for the static analysis of existential rule ontologies, promising insights about computational properties and possible practical uses of a given set of rules, e.g., in ontology-based query answering. U
Externí odkaz:
http://arxiv.org/abs/2207.09669
We study satisfiability for HyperLTL with a $\forall^*\exists^*$ quantifier prefix, known to be highly undecidable in general. HyperLTL can express system properties that relate multiple traces (so-called hyperproperties), which are often combined wi
Externí odkaz:
http://arxiv.org/abs/2205.15138
We study reasoning with existential rules to perform query answering over streams of data. On static databases, this problem has been widely studied, but its extension to rapidly changing data has not yet been considered. To bridge this gap, we exten
Externí odkaz:
http://arxiv.org/abs/2205.02220
Autor:
Borgwardt, Stefan, Hoffmann, Jörg, Kovtunova, Alisa, Krötzsch, Markus, Nebel, Bernhard, Steinmetz, Marcel
State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-world state constraints formalized by planning over a description logic
Externí odkaz:
http://arxiv.org/abs/2203.09361
Autor:
Bromberger, Martin, Dragoste, Irina, Faqeh, Rasha, Fetzer, Christof, González, Larry, Krötzsch, Markus, Marx, Maximilian, Murali, Harish K, Weidenbach, Christoph
In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Sch\"onfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation
Externí odkaz:
http://arxiv.org/abs/2201.09769
Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. The situation changes drastically for queries with negation, where there is no agreed-upon semantics or
Externí odkaz:
http://arxiv.org/abs/2112.07376
Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable
Externí odkaz:
http://arxiv.org/abs/2107.07811