“…Temporal logics in which one can assign a proper meaning to the association of statements about different grained temporal domains have been considered. See [8,12,18] for details. Nevertheless, it seems that the results concerning the issues of axiomatization/completeness and decidability/complexity presented in [3] and in this paper constitute the first steps towards a temporal logic based on different levels of abstraction.…”
“…Temporal logics in which one can assign a proper meaning to the association of statements about different grained temporal domains have been considered. See [8,12,18] for details. Nevertheless, it seems that the results concerning the issues of axiomatization/completeness and decidability/complexity presented in [3] and in this paper constitute the first steps towards a temporal logic based on different levels of abstraction.…”
This article considers the temporal logic of the lexicographic products of unbounded dense linear orders and provides via mosaics a new proof of the membership in N P of the satisfiability problem it gives rise to.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.