Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Frochaux, André"'
Autor:
Frochaux, André, Kleest-Meißner, Sarah
A query model for sequence data was introduced in [11] in the form of subsequence-queries with wildcards and gap-size constraints (swg-queries, for short). These queries consist of a pattern over an alphabet of variables and types, as well as a globa
Externí odkaz:
http://arxiv.org/abs/2305.08236
Autor:
Frochaux, André
Die vorliegende Dissertation beinhaltet eine umfassende Untersuchung der Entscheidbarkeit und Komplexität der Probleme, die sich durch eine statische Analyse von monadischem Datalog auf endlichen gefärbten Bäumen stellen. Statische Analyse bedeute
Externí odkaz:
http://edoc.hu-berlin.de/18452/18371
Autor:
Frochaux, André, Heimberg, Lucas
Building on the locality conditions for first-order logic by Hanf and Gaifman, Barthelmann and Schwentick showed in 1999 that every first-order formula is equivalent to a formula of the shape $\exists x_1 \dotsc \exists x_k \forall y\,\phi$ where qua
Externí odkaz:
http://arxiv.org/abs/1810.12077
Autor:
Frochaux, André, Schweikardt, Nicole
In their AMW14-paper, Frochaux, Grohe, and Schweikardt showed that the query containment problem for monadic datalog on finite unranked labeled trees is Exptime-complete when (a) considering unordered trees using the child-axis, and when (b) consider
Externí odkaz:
http://arxiv.org/abs/1608.06130
We show that the query containment problem for monadic datalog on finite unranked labeled trees can be solved in 2-fold exponential time when (a) considering unordered trees using the axes child and descendant, and when (b) considering ordered trees
Externí odkaz:
http://arxiv.org/abs/1404.0606
Autor:
Frochaux, André, Schweikardt, Nicole
In the article 'Recursive queries on trees and data trees' (ICDT'13), Abiteboul et al., asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is decidable.
Externí odkaz:
http://arxiv.org/abs/1310.1316