21 citations · 64 across the 16 of their papers we have counts for
1 paper · 2 filters
Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis
A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend…