Abstract

We investigate the semantics of framed temporal logic programs. We first present a projection temporal logic and its executable subset together with a framing technique. The semantics of a non-framed program is interpreted using the canonical model. However, since the framing operator destroys monotonicity, such a model may no longer be satisfactory, and so we develop a minimal model semantics. Within this model, negation by default is used to manipulate framing operators. We then discuss the existence of a minimal model for a given framed program (which may be non-terminating and/or non-deterministic).

Keywords

temporal logic programming, framing, semantics