Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In Kazunori Saraswat, Vijay; Ueda, editor, Proceedings of the 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the advantage being that our model provides a declarative and operational language for system specification. The idea of providing, in one way or other, a dual logic and operational flavor has been achieved by other formalisms; most notably, by temporal logic programming languages (tpl) Brz91] Mos86] BFG 95] Mer95] which provide direct execution of temporal formulas. Another example is the modal process logic (mpl) of [LT88] where process constructs are included as connectives and formulae are given operational interpretations. Our approach differs from that of the (tpl) ....

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In Kazunori Saraswat, Vijay; Ueda, editor, Proceedings of the 1991 International Symposium on Logic Programming (ISLP'91), pages 661--677, San Diego, CA, October 1991. MIT Press.

....systems. For example, consider the following Chronolog [4] program simulating the operation of the traffic lights: first light(green) next light(amber) light(green) next light(red) light(amber) next light(green) light(red) However, Chronolog as well as most temporal languages [1, 5, 6, 7, 8, 9, 10] are based on linear flow of time, a fact that makes them unsuitable for certain types of applications. For example, as M. Ben Ari, A. Pnueli and Z. Manna indicate [11] branching time logics are necessary in order to express certain properties of non deterministic programs. Moreover, as it is ....

....nodes into a list. This definition corresponds to the left to right preorder traversal of the tree. preorder( X] leaf(X) preorder( XjL] node(X) next 0 preorder(L1) next 1 preorder(L2) append(L1; L2; L) By posing the goal clause 7 first preorder(L) we will obtain the list [8,5,2,7,12,9,15] which corresponds to the preorder traversal of the tree shown in figure 4. Notice that by posing the goal clause first next 0 preorder(L) we will obtain the list [5,2,7] which corresponds to the preorder traversal of the left subtree of the tree under consideration. Generalizing the ....

[Article contains additional citation context not shown here]

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proc. of the Logic Programming Symposium, pages 661--677. MIT Press, 1991.

....a candidate next atom if it is in the scope of at most one 3 in the canonical form of the goal. It can be proved that there is at least one candidate next atom in any nonempty goal. TSLD resolution is a sound and complete proof procedure for Templog [Bau93] Alternatively, as Brzoska showed in [Brz91] Templog programs can be considered as CLP(A) programs over a suitable algebra A. A meaning preserving transformation for the translation of Templog programs and goal clauses into classical constraint logic programs and goal clauses, respectively, is also given in [Brz91] 3.1.4 Metric Temporal ....

....as Brzoska showed in [Brz91] Templog programs can be considered as CLP(A) programs over a suitable algebra A. A meaning preserving transformation for the translation of Templog programs and goal clauses into classical constraint logic programs and goal clauses, respectively, is also given in [Brz91] 3.1.4 Metric Temporal Logic Programming Brzoska [Brz98, Brz93] investigated temporal logic programming languages based on metric temporal logics. The time in Brzoska s work is linear and may be either discrete or dense. A fragment of metric temporal logic which can be handled within the ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. Saraswat and K. Ueda, editors, Logic Programming: Proc. of the 1991 International Symposium, pages 661--677. MIT Press, 1991.

....Programming (Ext. Abstract) 7 6 Related Work and Concluding Remarks Related Work. The issue of developing a formalism for timed systems with both a logic and an operational avor has been considered in several works, particularly in the area of temporal logic programming languages (tpl) [4], 20] 2] 17] These proposals provide the machinery for the direct execution of temporal formulas. In contrast to tpl, our approach is not based on logic programming but on ccp. Consequently, some of the main advantages of ccp over logic programming can also be claimed for ntcc over tpl, in ....

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In Kazunori Saraswat, Vijay; Ueda, editor, Proceedings of the

....do not specify the occurrence time of the rendezvous. Consequently, program execution is inherently indeterminate. Furthermore, this results in inadequate support for preemption, which is not integrated into the calculi. 2. 3 Temporal logic programming Temporal logic programming languages [Brz91,BFG 90,Bau89,Mos86,Mer93] achieve bounded response by imposing syntactic restrictions. This paradigm is inherently nondeterministic. Furthermore, the languages are forced to identify a priori, global and fixed notions of system variables and environmentvariables to ensure true ....

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In Vijay A. Saraswat and Kazunori Ueda, editors, Logic Programming: Proceedings of the 1991 International Symposium, pages 661 -- 677, 1991.

....to several pieces of work that have inspired and influenced this paper. 43] is an eminently readable survey of concurrent logic programming languages. This line of work has now developed into extensive work on temporal logic programming languages with perhaps some notions of distribution (e.g. [7, 4, 5, 39, 36, 22]) Our work differs from this literature in that our approach has tended to emphasize the reuse of the extensive existing work in the design, implementation and analysis of (concurrent) programming languages. For example, the compatibility of our work with existing threads standards and event ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. A. Saraswat and K. Ueda, editors, Logic Programming: Proc. 1991 Intl. Symp., pages 661 -- 677, 1991.

.... 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 translation: every predicate receives another argument, representing time. Then, at time t, next is represented by t 0 = t 1, and the future (for always and sometime) is represented by t ....

C. Brzoska, Temporal Logic Programming and its Relation to Constraint Logic Programming, Proc. International Logic Programming Symposium, 661--677, 1991.

....the conditions under which a property will hold for a given real time system. Our framework also suggests new types of formalisms that we call Constraint Automata and Timed Push down Automata. 1 Introduction There has been tremendous amount of research in specification of real time system [6, 12, 7]however, the process of designing and verifying the correctness of a realtime system is still not completely automated. Verifying the implementation of a real time system manually can be error prone. In this paper we present a framework for specifying and automatically verifying real time systems. ....

....tree logic) etc. There are also automata based realtime formalisms such as timed automata [3, 20] and timed transition systems. Few proposals have been made for modeling real time systems using a logic programming or a constraint logic programming framework. The most notable is that of Brzoska [7, 8], which provides a translation of simple temporal formulas (following the structure of Templog [1] into a simple CLP scheme over an algebra based on the set of integer numbers with and . BNR Prolog [9] a constraint logic language on interval arithmetics, has also been used to capture temporal ....

C. Brzoska. Temporal Logic Programming and its Relation to Constraint Logic Programming. In Proc. International Logic Programming Symposium. MIT Press, 1991.

....few years [8, 10] Temporal Logics[6] have found application in many domains, such as, planning, temporal deductive data bases, verification of concurrent systems, VLSI design, etc. Some work has also been reported in Constraint Logic Programming (CLP) and its application to Temporal Reasoning [2, 3, 5]. Many practical systems which implement Temporal Logics have also been reported[8] However, most of them are implementations of Modal temporal logics [6, 8] In this paper we propose an extension of the Horn clause logic programming language (PROLOG) called Horn Temporal Reference Language ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proc. of the Logic Programming Symposium, pages 661--677. MIT Press, 1991.

....text. Further technical information on CLP(R) is available on language design and implementation [12, 13] metaprogramming [7] and delay mechanisms [14] Additionally, much has been written about applications in electrical engineering [6, 18] differential equations [5, 8] temporal reasoning [1, 2, 3], protocol testing [4] structural analysis and synthesis [15] mechanical engineering [21] user interfaces [23] model based diagnosis [24] options trading [16] music theory [9] molecular biology [22] etc. This document is both an introductory tutorial and reference manual describing the ....

.... 9, S = 1, M = 1, C1 = 0, C2 = 0, C3 = 0, C4 = 0, C1 = 1, C2 = 1, C3 = 1, C4 = 1, M = C1, C2 S M = O C1 10, C3 E O = N 10 C2, C4 N R = E 10 C3, D E = Y 10 C4, bit(C1) bit(C2) bit(C3) bit(C4) bit(0) bit(1) gendiffdigits(L) gendiffdigits(L, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) gendiffdigits( gendiffdigits( H T] L) select(H, L, L2) gendiffdigits(T, L2) select(H, H T] T) select(H, H2 T] H2 T2] select(H, T, T2) solve(S, E, N, D, M, O, R, Y) Critical Path Analysis CHAPTER 3. PROGRAMMING IN CLP(R) 27 This program uses ....

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In Logic Programming: Proceedings of the 1991 International Symposium, pages 661--677, October 1991.

....are given. The operational semantics is a bottom up execution mechanism which deals with negative literals in the same way as positive ones. As programs in TLP languages such as Templog [1] Tokio [2] Temporal Prolog [14] Tempura [32] and Chronology [47] can be translated into CLP programs [7, 34], our operational semantics offers a bottom up execution mechanism for these TLP languages which use extensions of the SLD resolution as operational semantics. Temporality is expressed in Starlog by explicitly timing truth. The operational semantics works on the class of Starlog programs that can ....

....of constraint logic programming [21] 2 Starlog Language Starlog was developed for specification and implementation of applications which require temporal reasoning. Starlog doesn t directly support temporal operators. However, most temporal operators can be programmed in Starlog as indicated in [7]. Moreover, Starlog allows more explicit temporal relationships to be expressed directly. As a CLP language, Starlog can adopt any model semantics developed for the CLP scheme. This paper defines the model semantics of Starlog based on the stable model semantics [17] Unlike other CLP languages ....

[Article contains additional citation context not shown here]

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proceedings of the 1991 International Symposium on Logic Programming, pages 661--677. The MIT Press, 1991.

....programming languages based upon temporal logic [FO93, Cav93] One such implementation is called Templog and is used to specify and program dynamically changing situations and non terminating computations. Since temporal logic can be translated into ordinary first order classical logic, Brzoska [Brz91] details a method for translating Templog programs into classical logic programs. He then proves that Templog programs are another instance of the CLP scheme. In a similar vein, Fruwirth [Fru93] has extended the language of CLP programs with temporal annotations. These give the time(s) at which ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. Saraswat and K. Ueda, editors, Proc. International Symposium on Logic Programming, San Diego, USA, pages 661--677. MIT Press, 1991.

....via rendezvous. However, these calculi do not specify the occurrence time of the rendezvous. Consequently, program execution is inherently indeterminate. Furthermore, this results in inadequate support for preemption, which is not integrated into the calculi. Temporal logic programming languages (Brzoska (1991), Barringer et al. 1990) Baudinet (1989) Moszkowski (1986) Merz (1993) achieve bounded response by imposing syntactic restrictions for example, by identifying a priori, global and fixed notions of system variables and environment variables to ensure true reactivity. This paradigm is also ....

Brzoska, C. (1991). Temporal logic programming and its relation to constraint logic programming.

....temporal operators called Templog. The interested reader can consult [BCW93] for a thorough discussion of the expressive power and complexity of various languages for infinite periodic data. Other logic programming languages with modal operators have been presented in [RB89a, Gab89a, Gab89b, OW92, Brz91, Brz93a] 2.8 Indefinite Information in Relational Databases There have been many attempts to extend the relational model to deal with indefinite or incomplete information. This is quite natural because many real world applications sometimes involve 24 The term 1 in meets(1; mary) should ....

....for which query evaluation is tractable. The work of [vdM92] is an important first step towards this direction. Our concern for temporal constraints has been shared by researchers in real time temporal logics [Alu91] timed automata [Dil89] and logic programming with real time modal operators [Brz91, Brz93a, Brz93b] It will be fruitful to investigate the connections among the above formalisms. Preliminary work towards this direction has been reported in [BCW93, Brz91, Brz93a, Brz93b] Another important area of future research is the development of practical algorithms for solving the ....

[Article contains additional citation context not shown here]

C. Brzoska. Temporal Logic Programming and its Relation to Constraint Logic Programming. In Proceedings of the 1991 Logic Programming Symposium, 1991.

....to Chronolog(Z) Molog [11] is a framework for modal logic programming in which a specific modal resolution method is required for each particular modal logic used. Jackson and Reichgelt [19] gives a more general proof method for modal predicate logic which can also be applied to Molog. Brzoska [8] showed that Templog can be regarded as an instance of the CLP scheme of Jaffar and Lassez [20] over a suitable algebra, which suggests that Chronolog(Z) can also be regarded as an instance of the CLP. For more details on temporal and modal logic programming and their applications, we refer the ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. Saraswat and K. Ueda, editors, Proceedings of the 1991 International Logic Programming Symposium, pages 661--677, San Diego, Calif, October 28-31 1991.

....the conditions under which a property will hold for a given real time system. Our framework also suggests new types of formalisms that we call Constraint Automata and Timed Push down Automata. 1. Introduction There has been tremendous amount of research in specification of real time system [6, 12, 7], however, the process of designing and verifying the correctness of a realtime system is still not completely automated. Verifying the implementation of a real time system manually can be error prone. In this paper we present a framework for specifying and automatically verifying real time ....

....tree logic) etc. There are also automata based realtime formalisms such as timed automata [3, 20] and timed transition systems. Few proposals have been made for modeling real time systems using a logic programming or a constraint logic programming framework. The most notable is that of Brzoska [7, 8], which provides a translation of simple temporal formulas (following the structure of Templog [1] into a simple CLP scheme over an algebra based on the set of integer numbers with Gamma and . BNR Prolog [9] a constraint logic language on interval arithmetics, has also been used to capture ....

C. Brzoska. Temporal Logic Programming and its Relation to Constraint Logic Programming. In Proc. International Logic Programming Symposium. MIT Press, 1991.

....systems. For example, consider the following Chronolog [Wad88] program simulating the operation of the traffic lights: first light(green) next light(amber) light(green) next light(red) light(amber) next light(green) light(red) However, Cronolog as well as most temporal languages [OM94, Hry93, OWD93, Bau93, OW92, Brz91, Brz93, GRP96] are based on linear flow of time, a fact that This work has been funded by the Greek General Secretariat of Research and Technology under the project TimeLogic of PiENE Delta 0 95, contract no 1134. This paper appears in the Proceedings of the First International Joint Conference on ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proc. of the Logic Programming Symposium, pages 661--677. MIT Press, 1991.

....Programming Another way to escape the limitations of temporal logic is to keep its syntax but use different semantics for its Horn subset. This is analogous to the move from first order logic to logic programming. Indeed, proposals by Abadi and Manna [AM89] Baudinet [Bau92, Bau95] and Brzoska [Brz91, Brz93, Brz95] have been made to extend the language of Horn clauses with temporal connectives in such a way that there is still some notion of least model and resolution based operational semantics, see [Con98] Not surprisingly, those languages can be usually translated to the standard logic ....

....successor function symbol [BCW93, CI88] In this way, an exact correspondence is obtained between function free Templog and Datalog 1S , an extension of Datalog with the successor function symbol in one predicate argument. More sophisticated temporal connectives involving numeric bounds on time [Brz91, Brz93, Brz95] can be simulated using arithmetic constraints in the Constraint Logic Programming paradigm of Jaffar and Lassez [JL87] One can also study the extensions of the above Horn clause languages with various kinds of negation [AB94] Recently, Datalog 1S with negation has been used to ....

Ch. Brzoska. Temporal Logic Programming and its Relation to Constraint Logic Programming. In Vijay Saraswat and Kazunori Ueda, editors, International Logic Programming Symposium, pages 661--677. MIT Press, 1991. 38 Temporal Logic in Information Systems

.... for describing dynamic systems, and have been widely used in many application areas such as program specification and verification [LO97] in modelling temporal databases [Org96] as well as in knowledge representation [LO96] and temporal reasoning [Vil94] However, most temporal languages [Wad88, OM94, Hry93, OWD93, Bau93, Brz91, GRP96] are based on linear flow of time, a fact that makes them unsuitable for certain types of applications. For example, as M. Ben Ari, A. Pnueli and Z. Manna have pointed out in [BAPM83] branching time logics are necessary in order to express certain properties of non deterministic programs. In ....

C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proc. of the Logic Programming Symposium, pages 661--677. MIT Press, 1991.

....to a fragment of TL of Vardi [98] allowing only least fixed points to be applied to positive formulas. Note that Templog is in fact equivalent in expressive power to a fragment of itself, called TL1, in which the only temporal operator is the next time operator fl [18, section 5] Brzoska [25] showed that Templog can be considered as an instance of the CLP scheme of Jaffar and Lassez [58] over a suitable algebra A. Templog programs are translated into classical logic programs and Templog goals into classical goals through a meaning preserving transformation, Pi. Translated programs ....

....of 2 operators in bodies, or 3 operators in heads. MTL is, however, more expressive than either Templog or Chronolog. It is shown that MTL can be considered as an instance of the CLP scheme over a suitable algebra [26] This work is in fact a continuation of the earlier results reported by Brzoska [25], but the translation function Pi in MTL is different from that of [25] It is based on the free term algebra of an MTL program plus the algebra (Z; 0; 1; Gamma1; Z ; Z ) where Z is the set of integers. The function Pi maps an MTL program P and a goal G to the corresponding classical ....

[Article contains additional citation context not shown here]

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. Saraswat and K. Ueda, editors, Proceedings of the 1991 International Logic Programming Symposium, pages 661--677, San Diego, Calif, October 28-31 1991.

.... languages which are not based on the logic programming paradigm and the Horn subset of temporal logic, for example, the interval logic language Tempura [27] There are also first order treatments of temporal modalities in the logic programming framework, including those of Hrycej [22] and Brzoska [10, 11]. This paper in particular focuses on TLP languages that are directly based on the Horn subset of temporal logic and resolution type proof procedures, such as Chronolog [29, 31, 37] and Templog [1, 2] In Chronolog, non terminating computations can be naturally modeled through time varying ....

....the residue list [2,3,5] at time 1, meaning that the second Hamming number is 2. At time 2, again by the third clause, 2 is removed from the residue list and then multiples of 2 are merged with the rest of the residue list (the list [3,5] The residue predicate represents the residue list [3,4,5,6,10] at time 2, meaning that the third Hamming number is 3. At the following moments in time, the computation proceeds along these lines. A non terminating computation of Hamming numbers is triggered by the openended goal clause hamming(N) The goal clause is interpreted as an infinite series of ....

[Article contains additional citation context not shown here]

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In V. Saraswat and K. Ueda, editors, Proceedings of the 1991 International Logic Programming Symposium, pages 661--677, San Diego, Calif, October 28-31 1991.

....Programming. Another way to escape the limitations of temporal logic is to keep its syntax but use different semantics for its Horn subset. This is analogous to the move from first order logic to logic programming. Indeed, proposals by Abadi and Manna [AM89] Baudinet [Bau92; Bau95] and Brzoska [Brz91; Brz93; Brz95] have been made to extend the language of Horn clauses with temporal connectives in such a way that there is still some notion of least model and resolution based operational semantics, see Chapter . Not surprisingly, those languages can be usually translated to the standard logic ....

....successor function symbol [BCW93; CI88] In this way, an exact correspondence is obtained between function free Templog and Datalog 1S , an extension of Datalog with the successor function symbol in one predicate argument. More sophisticated temporal connectives involving numeric bounds on time [Brz91; Brz93; Brz95] can be simulated using arithmetic constraints in the Constraint Logic Programming paradigm of Jaffar and Lassez [JL87] One can also study the extensions of the above Horn clause languages with various kinds of negation [AB94] Recently, Datalog 1S with negation has been used to ....

Ch. Brzoska. Temporal Logic Programming and its Relation to Constraint Logic Programming. In Vijay Saraswat and Kazunori Ueda, editors, International Logic Programming Symposium, pages 661--677. MIT Press, 1991.

....The paper then shows that for various combinations of constraint formalisms and query languages, the bottom up evaluation of queries is of reasonable data complexity. More precisely, depending on the chosen constraint and query languages, the complexity ranges from NC to PTIME. 5 Related Work In [Brz91] Templog is seen as an instance of the Constraint Logic Programming schema [JL87] This paper gives an elegant description of TSLD resolution as resolution enhanced with linear equation solving. In [TK89] a different semantics for Datalog is proposed with a view towards temporal applications. ....

Ch. Brzoska. Temporal Logic Programming and its Relation to Constraint Logic Programming. In International Logic Programming Symposium, 1991.

No context found.

Christoph Brzoska. Temporal logic programming and its relation to constraint logic programming. In Kazunori Saraswat, Vijay; Ueda, editor, Proceedings of the 1991.

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