Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410): Difference between revisions

Fundamental properties of deterministic and non-deterministic extensions of Datalog from Abiteboul and Vianu (1988) are studied. The extensions involve the use of negative literals both in bodies and heads of rules. Negative literals in heads are interpreted as deletions. A deterministic semantics is obtained by firing in parallel all applicable rules. The nondeterministic semantics results from firing (non-deterministically) one rule at a time. In the nondeterministic case programs do not describe functions but relations between database states. In both cases, the result is an increase in expressive power over Datalog. The price for it is that programs do not always terminate. It is studied when a program (i) is such that on a given input, all its successful computations reach a unique fixpoint, (ii) yields at least one output on every input and (iii) has only loop-free computations. It is also shown how to simulate programs containing loops by loop-free programs.