On the Expressiveness of Temporal Logic Programming

Baudinet, Marianne

doi:10.1006/inco.1995.1036

Cited by 20 publications

(12 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In TeDiLog, the explicit use of temporal connectives, together with the fact that such connectives are more expressive, facilitates readability and understanding of program and goal clauses. In Baudinet [1995], Baudinet shows (by means of TL1) that Templog and Chronolog have the same expressive power. Hence Chronolog can be considered as a syntactical variant of Templog.…”

Section: Related Workmentioning

confidence: 97%

“…In order to study Templog's expressiveness, Baudinet considers in Baudinet [1989bBaudinet [ , 1995 the propositional fragment TL1 where the connective is not allowed at all and is not allowed in clause heads. Consequently, TL1 program clauses are of the form…”

Section: Related Workmentioning

confidence: 99%

“…We finally review the three existing declarative TLP languages that are based on pure extensions of classical logic programming languages and resolution, which are Chronolog [Wadge 1988;Orgun 1991Orgun , 1995 Templog Manna 1987, 1989;Baudinet 1988Baudinet , 1989aBaudinet , 1989bBaudinet , 1992Baudinet , 1995 and Gabbay's temporal Prolog [Gabbay 1987b]. Chronolog and Templog are the most studied and the most representative languages in the purely declarative approach.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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: Related Workmentioning

confidence: 97%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

show abstract

“…In the latter paper, the authors formally establish the relationship between the expressive power of the relational calculus (or algebra) on relations with linear repeating points, and Datalogls (which is equivalent to the function-free version of Templog, the language studied by Abadi et al [2,4] [41] is the closest to our approach. This language cannot express infinite periodic sets because it lacks even a rudimentary arithmetic capability.…”

Section: Constraintsmentioning

confidence: 98%

Finite representation of infinite query answers

Chomicki

Imieliński

1993

ACM Trans. Database Syst.

View full text Add to dashboard Cite

and TOMASZ IMIELINSKI Rutgers UniversityWe define here a formal notion of finite representation of infinite query answers in logic programs. We apply this notion to Datalog.s (Datalog with n successors): an extension of Datalog capable of representing infinite phenomena like flow of time or plan construction. Predicates in Datalogns can have arbitrary unary and limited n-ary function symbols m one fixed position. This class of logic programs is known to be decidable.However, least Herbrand modek of Data log.~programs may be infinite and consequently queries may have infinite answers.We present a method to finitely represent infinite least Herbrand models of Datalog.s programs as relational specifications. A relational specificationconsistsof a finite set of facts and a finitely specified congruencerelation. A relational specification has the following desirable properties: First, it is explicit in the sense that once it is computed, the original Datalog,zs program (and its underlying computational engine) can be forgotten. Given a query to be evaluated, it is easy to obtain from the relational specification finitely many answer substitutions that represent infinitely many answer substitutions to the query. The method involved is a combination of a simple, unificationless, computational mechanism(graph traversal, congruence closure, or term rewriting) and standard relational query evaluation methods. Second,a relationa I specificationis effectively computable and its computation is no harder, in the senseof the comp~exityclass,than answering yes-noqueries.Our method is applicable to every range-restricted Datalogns program. We also showthat for somevery simple non-Datalogn~logic programs, finite representations of query answers do not exist.

show abstract

“…Each Templog program is a finite set of program clauses. Computation in Templog programs is based on a temporal logic resolution method, termed TSLD-resolution (Abadi and Manna 1989;Baudinet 1995). Semantics for temporal logic formulas are provided w.r.t.…”

Section: Bodymentioning

confidence: 99%

Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states

Gómez

Augusto

2006

Artif Intell Rev

View full text Add to dashboard Cite

Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence (AI). The expressive power of temporal databases/query languages has been studied from different perspectives, but the kind of temporal information they are able to store and retrieve is not always conveniently addressed. Here we assess a number of temporal query languages with respect to the modelling of time intervals, interval relationships and states, which can be thought of as the building blocks to represent and reason about a large and important class of historic information. To survey the facilities and issues which are particular to certain temporal query languages not only gives an idea about how useful they can be in particular contexts, but also gives an interesting insight in how these issues are, in many cases, ultimately inherent to the database paradigm.While in the area of AI declarative languages are usually the preferred choice, other areas of CS heavily rely on the extended relational paradigm. This paper, then, will be concerned with the representation of historic information in two well known temporal query languages: Templog in the context of temporal deductive databases, and TSQL2 in the context of temporal relational databases. We hope the results highlighted here will increase cross-fertilisation between different communities. This article can be related to recent publications drawing the attention towards the different approaches followed by the Databases and AI communities when using time-related concepts.

show abstract

On the Expressiveness of Temporal Logic Programming

Cited by 20 publications

References 28 publications

Logical foundations for more expressive declarative temporal logic programming languages

Logical foundations for more expressive declarative temporal logic programming languages

Finite representation of infinite query answers

Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states

Contact Info

Product

Resources

About