This paper investigates semantics of framed temporallogic programs. To this end, a projection temporallogic and its executable subset are presented. Based on this language, a framing technique is introduced. The sem...
详细信息
ISBN:
(纸本)354029208X
This paper investigates semantics of framed temporallogic programs. To this end, a projection temporallogic and its executable subset are presented. Based on this language, a framing technique is introduced. The semantics of a non-framed program is well interpreted by the canonical model. However, since introducing a framing operator destroys monotonicity, a canonical model may no longer capture the intended meaning of a program. Hence, a minimal model theory is developed. Within this model, negation by default is used to manipulate frame operator. Further, the temporal semantics of framed programs is captured by means of the minimal models. The existence of a minimal model for a given framed program is also proved. An example is given to illustrate how the semantics of framed programs can be captured.
temporalprogramming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear flow of time, a fact that makes them unsuitable for c...
详细信息
ISBN:
(纸本)3540630953
temporalprogramming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear flow of time, a fact that makes them unsuitable for certain types of applications. In this paper we introduce the new temporal logic programming language Cactus, which is based on a branching notion of time. In Cactus, the truth value of a predicate depends on a hidden time parameter which has a tree-like structure. As a result, Cactus appears to be especially appropriate for expressing non-deterministic computations or generally algorithms that involve the manipulation of tree data structures.
Chronolog(z) is a logicprogramming language based on a linear-time temporallogic with unbounded past and future. By adding 'choice predicates' to Chronolog(z), it is possible to obtain exactly one answer to ...
详细信息
Chronolog(z) is a logicprogramming language based on a linear-time temporallogic with unbounded past and future. By adding 'choice predicates' to Chronolog(z), it is possible to obtain exactly one answer to a given goal when we want to model dataflow, style of stream-oriented computations. In this paper, we propose a parallel execution model for Chronclog(z) that supports AND- and OR-parallelism in the highly distributed dataflow environment. In order to exploit the inherent context-paralellism that exist in temporallogic programs, we introduce the concept of parallel context-processes into the model. We also introduce an intermediate virtual machine (CVM), which is granulated to exploit the argument parallelism through temporal unification. The details of the CVM instruction set are given. The use of a warehouse facility as an associate memory to store the results of previous computations is an important feature of this model. This paper discusses the structure of the warehouse, its role and use in parallel execution of Chronolog programs. We in particular outline an algorithm to manage the warehouse.
暂无评论