Chronolog(Z): linear-time logic programming

Orgun, Mehmet A.; Wadge, William W.; Du, Weichang

doi:10.1109/icci.1993.315313

Cited by 5 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, nowadays, Templog, Chronolog, and Gabbay's temporal Prolog remain as the most expressive proposals of declarative TLP languages. Later extensions of Chronolog (e.g., Orgun et al [1993], Orgun and Wadge [1994], Rondogiannis et al [1997Rondogiannis et al [ , 1998, and Gergatsoulis et al [2000]) did not add significant temporal expressiveness. In the case of Gabbay's temporal Prolog, although the expressive power was considerably high, it seems that the lack of completeness was a handicap for further study and development.…”

Section: Introductionmentioning

confidence: 80%

See 1 more Smart Citation

Logical foundations for more expressive declarative temporal logic programming languages

Gaintzarain

Lucio

2013

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

In this article, we present a declarative propositional temporal logic programming language called TeDiLog that is a combination of the temporal and disjunctive paradigms in logic programming. TeDiLog is, syntactically, a sublanguage of the well-known Propositional Linear-time Temporal Logic (PLTL). TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. The operational semantics of TeDiLog relies on a restriction of the invariant-free temporal resolution procedure for PLTL that was introduced by Gaintzarain et al. in [2013]. We define a fixpoint semantics that captures the reverse (bottom-up) operational mechanism and prove its equivalence with the logical semantics. We also provide illustrative examples and comparison with other proposals. ACM Reference Format:Gaintzarain, J. and Lucio, P. 2013. Logical foundations for more expressive declarative temporal logic programming languages.

show abstract

Section: Introductionmentioning

confidence: 80%

“…In classical LP (see, e.g., Lloyd [1984]), and also in some extensions like Templog [Baudinet 1989b] and Chronolog [Wadge 1988;Orgun et al 1993;Orgun 1995], the declarative meaning of a program is formalized in three equivalent ways:…”

Section: Logical Semanticsmentioning

confidence: 99%

Logical foundations for more expressive declarative temporal logic programming languages

Gaintzarain

Lucio

2013

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

show abstract

“…The first two clauses define the first two Fibonacci numbers as 0 and 1; the last clause defines the current Fibonacci number as the sum of the previous two. In order to address certain applications such as temporal databases and knowledgebased simulation, Chronolog has been extended with an unbounded past as well as an unbounded future Orgun et al, 1993;Orgun, 1995), in which the collection of moments in time is modeled by the set of integers Z. The resulting language, called Chronolog(Z), has an additional operator, prev, to look into the past.…”

Section: The Language Familymentioning

confidence: 99%

Executable Temporal Logic Systems

1996

Journal of Symbolic Computation

View full text Add to dashboard Cite

Temporal disjunctive logic programming

2001

View full text Add to dashboard Cite

In this paper we introduce the logic programming language Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.

show abstract

Chronolog(Z): linear-time logic programming

Cited by 5 publications

References 7 publications

Logical foundations for more expressive declarative temporal logic programming languages

Logical foundations for more expressive declarative temporal logic programming languages

Executable Temporal Logic Systems

Temporal disjunctive logic programming

Contact Info

Product

Resources

About