Temporal DL-Lite over finite traces (preliminary results)
MetadataShow full item record
We transfer results on the temporal DL-Lite family of logics, moving from infinite models of linear time to the case of finite traces. In particular, we investigate the complexity of the satisfiability problem in various fragments of TU-DL-Lite^N_bool , distinguishing the case of global ax- ioms from the case where axioms are interpreted locally. We also consider satisfiability on traces bounded by a fixed number of time points.