On the expressive power of database queries with intermediate types

We show that ECTL⁺, the classical extension of CTL with fairness properties, is expressively equivalent to BTL₂, a natural fragment of the monadic logic of order. BTL₂ is the branching-time logic with arbitrary quantification over paths, and where path ...

This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention ...

We exhibit a coordinate-based language, called PFOL, which is sound for the linear queries computable in first-order logic over the reals and extends the latter's restriction to linear arithmetic. To evaluate its expressive power, we first consider PFOL-...