-
1
-
2
First-order query evaluation on structures of bounded degree
Published 2011-06-01“…Logical Methods in Computer Science…”
Get full text
Article -
3
First-order queries on classes of structures with bounded expansion
Published 2020-02-01“…Logical Methods in Computer Science…”
Get full text
Article -
4
Tameness and the power of programs over monoids in DA
Published 2022-08-01“…Logical Methods in Computer Science…”
Get full text
Article -
5
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
Published 2016-04-01“…Logical Methods in Computer Science…”
Get full text
Article -
6
A decidable characterization of locally testable tree languages
Published 2011-11-01“…Logical Methods in Computer Science…”
Get full text
Article -
7
Bottom-up automata on data trees and vertical XPath
Published 2017-11-01“…Logical Methods in Computer Science…”
Get full text
Article -
8
Piecewise testable tree languages
Published 2012-09-01“…Logical Methods in Computer Science…”
Get full text
Article -
9
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Published 2010-10-01“…Logical Methods in Computer Science…”
Get full text
Article -
10
Datalog Rewritings of Regular Path Queries using Views
Published 2015-12-01“…Logical Methods in Computer Science…”
Get full text
Article -
11
Enumerating Answers to First-Order Queries over Databases of Low Degree
Published 2022-05-01“…Logical Methods in Computer Science…”
Get full text
Article -
12
Deciding definability in FO2(<h,<v) on trees
Published 2015-09-01“…Logical Methods in Computer Science…”
Get full text
Article