Abstract
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear temporal logic with Since and Until. We define a query language (where queries are non-recursive Datalog programs and atoms are complex DLRus expressions) and investigate the problem of checking query containment under the constraints defined by DLRus conceptual schemas - i.e., DLRus knowledge bases - as well as the problems of schema satisfiability and logical implication