Abstract

We survey a number of approaches to the problem of finite representation of infinite temporal extensions. Two of them, Datalog 1S and Templog, are syntactical extensions of Datalog; the third is based on repetition and arithmetic constraints. We provide precise characterizations of the expressiveness and the computational complexity of these languages. We also describe query evaluation methods.

Citations