Stable Semantics of Temporal Deductive Databases
نویسندگان
چکیده
We de ne a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be represented and queried: timepoint and timestamp formulas, and show how each of them can be translated into the other. Because of their generality, our formalism and our semantics can serve as a basis for comparing and extending other temporal deductive database frameworks.
منابع مشابه
Non-Monotonic Negation in Probabilistic Deductive Databases
In this paper we study tlw uses and the se mantics of non-monotonic negation in prob abilistic deductive databases. Based on the stahl<semantics for classical logic program ming, we in I roduce the notion of stable for mula functions. We show that. stable for mula functions are minimal fixpoints of op erators associated with probabilistic dednc1 ive databases with negation. Furthermore, s...
متن کاملPartial Evidential Stable Models for Disjunctive Deductive Databases
In this paper we consider the basic semantics of stable and partial stable models for disjunctive deductive databases (with default negation), cf. [9,16]. It is well–known that there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics. We define a consistent variant of each class of models, wh...
متن کاملProcessing Deductive Databases under the Disjunctive Stable Model Semantics
Cyclic covers are shown to characterise disjunctive stable models of unstratified deductive databases, and to facilitate top-down query processing, query compilation and view updating under the disjunctive stable model semantics. Such processing is shown to be more complex than comparable processing of stratified databases.
متن کاملMinimal founded semantics for disjunctive logic programs and deductive databases
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...
متن کاملDeclarative Semantics for Active Rules
In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model, and maximal stable model semantics. The semantics of an active program AP is given by first rewritin...
متن کامل