M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277--295, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of reasoning about action and change (RAC) we found out that there are only few attempts to provide additional constructs for temporal reasoning within a logic programming (LP) setting. Many extensions have been proposed for limiting the validity of clauses to given time periods, like TEMPLOG [Bau88, AM89] and Temporal PROLOG [Hry88] Another example is given by the extension of logic programming proposed in [MRT97] in the style of valid time in temporal databases where temporal information represents the validity period of a fact. We desire, instead, an explicit representation of time and of ....

Martin Abadi and Zohar Manna. Temporal logic programming. Journal of Symbolic Computation, 8(3):277296 (or 277295??), September 1989.

....and rules of one of the following two forms [13] p n j=1 q j p r Here, p i , q j and r are simply literals. Note that, since any formula of the logic can be rewritten as a set of rules in this form, this does not represent a restriction of the logic such as Temporal Horn Clauses [1] the full power of temporal logic can be utilised. Although we will see later that some additional operational constraints are used, the simple form of the rules means that the behaviour of the system is usually obvious from its description. Finally, the temporal rules themselves can be seen ....

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277--295, 1989.

....called in certain situations. 1 Introduction The e ective mechanisation of temporal logic is vital to the application of temporal reasoning in many elds, for example the veri cation of reactive systems [12] the implementation of temporal query languages [4] and temporal logic programming [1]. Consequently, a range of proof methods have been developed, implemented and applied. The development of proof methods for temporal logic has followed three main approaches: tableau [16] automates [14] and resolution [2, 3, 10, 15] the approach adopted here. Resolution based methods have the ....

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277-295, 1989.

....database languages, explicit states are introduced via reification, i.e. by adding an additional argument to each relation, corresponding to versioning of relations. Following this way, in [BCW93] Datalog 1S ) and [Zan93] XY Datalog) Datalog has been extended to explicit states. Templog [AM89] is another extension of Datalog, using temporal logic operators. Datalog 1S , XY Datalog, and Templog have been proven to be equivalent. A similar concept with explicit states in Datalog, Statelog, has been presented in [LML96] There, every atom R(x) is augmented by a state term S to [S]R(x) ....

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8(3), September 1989.

....for Disjunctive Chronolog have been also investigated in [GRP97b] where it is shown that proof procedures developed for classical disjunctive logic programs [MRL91, LR91, LMR92] can be extended to apply to Disjunctive Chronolog programs. 3.1. 3 Templog Templog was proposed by Abadi Manna [AM89] Templog is based on a discrete linear time with unbounded future and uses the set N of natural numbers as the collection of moments in time. Templog extends classical Horn logic programming to allow the use of the temporal operators fl (next) 2 (always) and 3 (eventually) Templog programs ....

M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Computation, 8:277--295, 1989.

....frameworks underlying functional logic languages. We propose in this paper, a conservative extension of conditional equational logic [4] with time. Our approach is new and departs from the proposals already made in order to add time into (constraints) logic languages such as tcc [14] Templog [1], and Chronolog [16] Roughly speaking, timed programs are provided, as in synchronous languages, e.g. 8] with a canonical signal or clock, noted Sref which serves as a reference for other possible user de ned or input signals. In general, operator de nitions within a program P may depend on ....

....in the logic programming paradigm and thus the negative information problem of ccp. Another class of programming languages is the temporal logic programming languages based on temporal logics. Interesting overviews are presented in [13] The meaning of temporal for languages like Templog [1] and Temporal Prolog of Gabbay [7] is not the same as one in the synchronous world. The time is indeed represented in a constraint system and does not constraint temporally the execution of the program. The causality of the condition in timed conditional equations is not preserved in these ....

M. Abadi and Z. Manna. Temporal logic programming. J. of Symbolic Computation, 8(3):277-295, September 1989.

....of the refutation process. 1 Introduction The effective mechanisation of temporal logic is vital to the application of temporal reasoning in many fields, for example the verification of reactive systems [13] the implementation of temporal query languages [4] and temporal logic programming [1]. Consequently, a range of proof methods have been developed, implemented and applied. In addition to well known tableau [21] and automata theoretic [19] methods, there has been a resurgence in interest in resolution based methods [2, 3, 20, 9] Although clausal temporal resolution [9] has been ....

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277--295, 1989.

....guiding any subsequent search. 1 Introduction The effective mechanisation of temporal logic is vital to the application of temporal reasoning in many fields, for example the verification of reactive systems [11] the implementation of temporal query languages [4] and temporal logic programming [1]. Consequently, a range of proof methods have been developed, implemented and applied. In addition to well known tableau [18] and automata theoretic [16] methods, there has been a resurgence in interest in resolution based methods [2, 3, 17, 8] Although clausal temporal resolution [8] has been ....

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277--295, 1989.

....can be proved sound and complete with respect to the semantics based on the immediate consequence operator. An interesting aspect of MuTACLP is the fact that it integrates modularity and temporal reasoning, a feature which is not common to logical temporal languages (e.g. it is lacking in [1, 2, 9, 11, 14, 15, 20, 27]) Two exceptions are the language Temporal Datalog by Orgun [34] and the work on amalgamating knowledge bases by Subrahmanian [44] Temporal Datalog introduces a concept of module, which, however, seems to be used as a means for de ning new non standard algebraic operators, rather than as a ....

....di erent: events are the granularity of time chosen in Event Calculus, whereas we use time points and time periods. Furthermore no provision for multiple theories is given in Event Calculus. Kifer and Subrahmanian in [25] introduce generalized annotated logic programs (GAPs) and show how Templog [1] and an interval based temporal logic can be translated into GAPs. The annotations used there correspond to the th annotations of MuTACLP. To implement the annotated logic language, the paper proposes to use reductants , additional clauses which are derived from existing clauses to express all ....

M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Computation, 8:277-295, 1989. 28

....can be expressed as A Before B and B Before C . In addition, TL can also be used to express patterns such Hold(Stock) Until Bearish Market Sentiment , where Hold is a temporal predicate. Moreover, we propose to use TL for discovering temporal patterns by generating temporal logic programs (TLP) [7,8,9] for these patterns. TL provides several important advantages as a mechanism for the specification and discovery of patterns in temporal databases. It is a well studied, expressive and theoretically sound formalism that has been extensively used in various fields of computer science for dealing ....

....TLP systems make different assumptions about the structure of BODY and HEAD. For example, a rule that Employees who have been fired from a firm (worked there sometime in the past, but not now) cannot be hired by that firm in the future can be expressed in an extension of the TLP system, Templog [7] as: EMPLOY(firm, person) EMPLOY(firm, person) EMPLOY(firm, person) Alternatively, as done in Datalog 1S [14] we can also express TLP programs in first order logic using explicit references to time. For example, instead of using the temporal predicate EMPLOY(firm, person) we can use its FOL ....

Abadi, M., and Manna, Z., 1989. Temporal Logic Programming. J. of Symb. Computation v8, pp. 277-295.

....has come up several times, e.g. in XY Datalog [Zan93, ZAO93] to allow a unified semantics for active and deductive rules, and in [KLS92, LL94] as a means to specify updates in a declarative way. Flat Statelog [LHL95] XY Datalog, and the temporal query languages Datalog 1S and Templog [Cho90, AM89, Bau95] are closely related, since they all extend Datalog by a linear state space. In contrast, our present approach uses a branching hierarchical state space (similar to that of Datalog nS [CI93] which does not deal with active rules and procedures, however) The presented Kripke semantics ....

M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Comp., 8(3), 1989.

....to prove soundness and completeness of the operational semantics with respect to model theoretic semantics, and it works for the whole class of logics identified by the inclusion axioms. 1 Introduction Modal and temporal extensions of logic programming have recently received a lot of attention [20, 9, 1, 8, 15, 18], since they provide tools for formalizing temporal and epistemic knowledge and reasoning, while retaining the characterizing properties of logic programming languages, as, for instance, goal directed proof procedure, fixpoint semantics and the notion of minimal Herbrand model. In this paper we ....

....While, in languages of our framework, universal modalities are allowed to freely occur in front of clauses, clause heads and clause bodies (or goals) existential modal operators are not allowed. In particular, as a difference with other languages proposed in the literature, like TEMPLOG [1], Temporal Prolog [12] and the language in [3] existential modalities are not allowed to occur in front of goals. In spite of this limitation, the features of parametric modalities and the possibility of introducing inclusion axioms, make the language well suited for performing some epistemic ....

M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Computation, (8):277--295, 1989.

....Keywords: Multimodal Logic, Embedded Implication, Translation. 1 Introduction Modal logics are widely used in computer science and artificial intelligence to deal with knowledge and beliefs, time, actions, and several researchers have proposed modal extensions of logic programming languages [7, 1, 13, 19, 17, 6]. In particular, in [5] we have defined a modal logic programming language which allows both multiple modalities and embedded implications. The language has been shown to be well suited for structuring knowledge, and, in particular, for defining module constructs within programs, for representing ....

M. Abadi and Z. Manna. Temporal logic programming. J. Symbolic Computation, (8):277--295, 1989.

.... MOLOG, is proposed, and a resolution procedure, close to Prolog resolution, is defined for modal Horn clauses in the logic S5 which contain universal modal operators of the form Know(a) Another modal extension of logic programming is the temporal logic programming language TEMPLOG introduced in [1]. Moreover, in [20] a logic language extended with a modal operator assume is defined, which allows atomic updates to be performed on the program. Recently we have studied how structuring facilities, like blocks and modules, can be introduced in logic programming languages by making use of modal ....

....sequence of modal operators, we can generalize module definitions 2[m i ]D above, by allowing nested module definitions as follows: 2[m i ]2[m j ]D; where the module m j is defined locally to m i , and it becomes visible whenever m i is entered. Example 3 We present the Fibonacci example from [1]. We use a modal operator [next] to represent the next instant of time. We want fib(x) to hold after n instants of time, if x is the n th Fibonacci number. The formulation is the following: 1. T oe fib(0) 2. T oe [next]fib(1) 3. 2(fib(Y ) next]fib(Z) X is Y Z oe [next] next]fib(X) ....

M. Abadi and Z. Manna. Temporal logic programming. J.Symbolic Computation, (8):277--295, 1989.

....have obvious value. We show how (1) and (2) above can be expressed via taps just before the beginning of Section 4. We can also express Baudinet s temporal logic programming framework (Baudinet 1992) as instances of taps as well as part but not all of Abadi and Manna s TEMPLOG framework (Abadi and Manna 1987) (see Section 7) 1) and (2) above are just as hard to express in these other logics. Active databases: There has also been extensive work on active databases (U. Dayal and E. Hanson and J. Widom 1995) via the notion of an eventcondition action (ECA) rule. ECA rules have the form If condition ....

....deontic machinery. We have in addition the compact representation of status sets, whereas nothing comparable is provided in Brzoska (1995) and the distinguished time point t now (to evaluate our rules by distinguishing between the past and the future) Similar remarks apply to (Fr uhwirth 1995) Abadi and Manna (1987) proposed a language called TEMPLOG which was later extensively studied by another student of Manna, viz. Baudinet (1992) They take classical rst order logic and de ne a next atom to be of the form i A where i 0 and A is an atom in rst order logic. As usual, A is true at time t if A is ....

Abadi, M. and Z. Manna (1987). Temporal Logic Programming. In Proc. of the 1987 IEEE Symposium on Logic Programming, San Francisco, CA, pp. 4-16.

....are no temporal annotations, we are left with ordinary CLP. We also have shown in companion papers [Fru93, Fru94b] that TACLP languages have their formal justification as expressive fragments of temporal logics. One of the first temporal logic programming languages was TEMPLOG, a temporal Prolog [AbMa89]. TEMPLOG implements a fragment of first order temporal logic (tense logic) For example, in tense logic, the temporal operator fl denotes the next instant of time, and thus the TEMPLOG clause flfired(X) stole(X,Y) reads If X stole something, then he was fired immediately after . TEMPLOG is ....

M. Abadi and Z. Manna, Temporal Logic Programming, Journal of Symbolic Computation (1989) 8, pp 277-295.

....These extensions have obvious value. We show how (1) 2) above can be expressed via taps just before the start of Section 4. We can also express Baudinet s temporal logic programming framework (Baudinet 1992) as instances of taps as well as part but not all of Abadi and Manna s TEMPLOG framework (Abadi and Manna 1987) (see Section 7) 1) 2) above are just as hard to express in these other logics. Active databases: There has also been extensive work on active databases (U. Dayal and E. Hanson and J. Widom 1995) via the notion of an eventcondition action (ECA) rule. ECA rules have the form If condition C ....

....machinery. We have in addition the compact representation of status sets, whereas nothing comparable is provided in Brzoska (1995) and the distinguished timepoint t now (to evaluate our rules by distinguishing between the past 46 and the future) Similar remarks apply to (Fr uhwirth 1995) Abadi and Manna (1987) proposed a language called TEMPLOG which was later extensively studied by another student of Manna, viz. Baudinet (1992) They take classical rst order logic and de ne a next atom to be of the form i A where i 0 and A is an atom in rst order logic. As usual, A is true at time t if A is ....

Abadi, M. and Z. Manna (1987). Temporal Logic Programming. In Proc. of the 1987 IEEE Symposium on Logic Programming, San Francisco, CA, pp. 4-16.

....language for expressing time related concepts. Temporal logic adds to standard first order logic such constructs as next (meaning, roughly, in the next time instant 40 ) always (meaning in every future time instant ) and sometime (meaning in some future time instant ) The language Templog [1] was designed based on a Horn like subset of temporal logic in which the meaning of function symbols does not vary with time, but the meaning of predicate symbols does. It was shown in [39] that the operational behavior of Templog could be mimicked by a CLP language via the following natural ....

M. Abadi & Z. Manna, Temporal Logic Programming, Journal of Symbolic Computation, 8, 277--295, 1989.

No context found.

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277--295, 1989.

No context found.

M. Abadi and Z. Manna. Temporal logic programming. In Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 4-16, San Francisco, August - September 1987. IEEE, Computer Society Press.

No context found.

M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Computation, 8:277-295, 1989.

No context found.

M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8(3):277--295, 1989.

No context found.

Abadi, M. and Manna, Z. 1987. Temporal logic programming, In Proc. Symposium on Logic Programming (San Francisco, August), S. Haridi (Ed.), IEEE Computer Society Press, pp.416. America, P. 1987. POOL-T: A parallel object-oriented language. In A. Yonezawa and M. Tokoro, editors, object oriented concurrent programming, pp55-86. MIT Press, 1987.

No context found.

M. Abadi & Z. Manna, Temporal Logic Programming, Journal of Symbolic Computation, 8, 277--295, 1989.

No context found.

Abadi, M., Manna, Z. (1989). Temporal logic programming. Journal of Symbolic Computation 8, 277--295.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC