1 citations · 1 across the 5 of their papers we have counts for
5 papers
Puzzling over Subsequence-Query Extensions: Disjunction and Generalised Gaps
André Frochaux, Sarah Kleest-Meißner
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…
An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree
André Frochaux, Lucas Heimberg
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 o…
Monadic Datalog Containment on Trees Using the Descendant-Axis
André Frochaux, Nicole Schweikardt
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) c…
Monadic Datalog Containment on Trees
André Frochaux, Martin Grohe, Nicole Schweikardt
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…
A note on monadic datalog on unranked trees
André Frochaux, Nicole Schweikardt
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 tr…