Logic Programming and Databases: An Overview

Ceri, Stefano; Gottlob, Georg; Tanca, Letizia

doi:10.1007/978-3-642-83952-8_1

Cited by 71 publications

(138 citation statements)

References 0 publications

Supporting

Mentioning

136

Contrasting

Unclassified

Order By: Relevance

“…1988; Ceri et al 1990). In Temporal DATALOG, this is not possible due to the infinitary nature of time-varying predicates.…”

Section: Compljtatlonal Intelligencementioning

confidence: 94%

“…In many nondeductive models for temporal data, temporal relations are restricted to the interval from the beginning up to the current moment in time. The infinitary nature of temporal relations does not cause any problems during the evaluation of TRA expressions, because, under certain constraints (Chomicki 1990) snapshots (slices) of temporal relations at particular moments in time can be retrieved from a given temporal deductive database by bottom-up evaluation strategies (Ceri et al 1990).…”

Section: Temporal Datalogmentioning

confidence: 99%

“…Logic programs without any function symbols, that is, DATALOG programs (Ceri et al 1990;Ullman 1988) are regarded as deductive databases. In a DATALOG program, all predicates are guaranteed to represent finite relations, because the domain of any Herbrand inter-pretation of the program is finite, owing to the restriction to the function-free subset of logic programs.…”

Section: Temporal Deductive Databasesmentioning

confidence: 99%

“…Slices of temporal relations from a given temporal database are finite at particular moments in time or over periods of time, because the domain of any (temporal) Herbrand interpretation of the database is still finite, but they are infinite in the whole. However, we only need slices of temporal relations in TRA expressions (see the next section), which are computable by bottom-up evaluation strategies such as the fixed point computation (Ceri et al 1990;Lloyd 1984) 2.1. Temporal DATALOG Temporal logic (Rescher and Urquhart 1971) is a kind of modal logic in which the set of possible worlds models a collection of moments in time.…”

Section: Temporal Deductive Databasesmentioning

confidence: 99%

“…We also refer to temporal program clauses as mZes and unconditional rules as facts. The set of facts from a given program forms the extensional database, whereas the set of rules forms the intensional database (Ceri et al 1990).…”

Section: Temporal Deductive Databasesmentioning

confidence: 99%

See 4 more Smart Citations

On Temporal Deductive Databases

Orgun

1996

Computational Intelligence

View full text Add to dashboard Cite

This article introduces a temporal deductive database system featuring a logic prOb@ammhg language and an algebraic front-end. The language, called Temporal DATALOG, is an extension of DATALOG based on a linear-time temporal logic in which the flow of time is modeled by the set of natural numbers. Programs of Temporal DATALOG considered as temporal deductive databases, specifying temporal relationships among data and providing base relations to the algebraic frontend. The minimum model of a given Temporal DATALOG program is regarded as the temporal database the program models intensionally. The algebraic front-end, called TRA, is a point-wise extension of the relational algebra upon the set of natural numbers. When needed during the evaluation of TRA expressions, slices of temporal relations over intervals can be retrieved from a given temporal deductive da!abase by bottom-up evaluation strategies.A modular extension of Temporal DATALOG is also proposed, through which temporal relations created during the evaluation of TRA expressions may be fed back to the deductive part for further manipulation. Modules therefore enable the algebra to have full access to the deductive capabilities of Temporal DATALOG and to extend it with nonstandard algebraic operators. This article also shows that the temporal opemtors of TRA can be simulated in Temporal D~A L O G by program clauses.

show abstract

“…1988; Ceri et al 1990). In Temporal DATALOG, this is not possible due to the infinitary nature of time-varying predicates.…”

Section: Compljtatlonal Intelligencementioning

confidence: 94%

Section: Temporal Datalogmentioning

confidence: 99%

Section: Temporal Deductive Databasesmentioning

confidence: 99%

Section: Temporal Deductive Databasesmentioning

confidence: 99%

Section: Temporal Deductive Databasesmentioning

confidence: 99%

See 3 more Smart Citations

On Temporal Deductive Databases

Orgun

1996

Computational Intelligence

View full text Add to dashboard Cite

show abstract

The GPR system: An architecture for integrating active and deductive rules on complex database objects

Angiulli

Palopoli

Torlone

1997

Theory Pract. Obj. Syst.

View full text Add to dashboard Cite

show abstract

Probabilistic datalog: Implementing logical information retrieval for advanced applications

Fuhr

2000

J. Am. Soc. Info. Sci.

View full text Add to dashboard Cite

In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Datalog (function‐free Horn clause predicate logic) with probability theory. Therefore, probabilistic weights may be attached to both facts and rules. The underlying semantics extends the well‐founded semantics of modularly stratified Datalog to a possible worlds semantics. By using default independence assumptions with explicit specification of disjoint events, the inference process always yields point probabilities. We describe an evaluation method and present an implementation. This approach allows for easy formulation of specific retrieval models for arbitrary applications, and classical probabilistic IR models can be implemented by specifying the appropriate rules. In comparison to other approaches, the possibility of recursive rules allows for more powerful inferences, and predicate logic gives the expressiveness required for multimedia retrieval. Furthermore, probabilistic Datalog can be used as a query language for integrated information retrieval and database systems.

show abstract

Logic Programming and Databases: An Overview

Cited by 71 publications

References 0 publications

On Temporal Deductive Databases

On Temporal Deductive Databases

The GPR system: An architecture for integrating active and deductive rules on complex database objects

Probabilistic datalog: Implementing logical information retrieval for advanced applications

Contact Info

Product

Resources

About