MTL(ID:6843/)Temporal extensions to prolog Related languages
References: MTL (temporal logic programming with metric and past operators) proposed by Brzoska has linear and unbounded (in both directions) time attributes. It is shown that MTL can be considered as an instance of the CLP-scheme over a suitable algebra. This work is in fact a continuation of the earlier results for Templog reported by Brzoska [1991]. The operational semantics of MTL-programs is based on MTL-resolution, which is a restriction of the CLP-derivations over the considered algebra for tractability reasons. |