Programming with non-determinism in deductive databases

  • Authors:
  • Fosca Giannotti;Sergio Greco;Domenico Saccà;Carlo Zaniolo

  • Affiliations:
  • -;-;-;-

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

While non-determinism has long been established as a key concept in logic pro-gramming, its importance in the context of deductive databases was recognized only recently. This paper provides an overview of recent results on this topic with the aim of providing an introduction to the theory and practice of non-determinism in deductive databases. In particular we (i) recall the main results linking non-deterministic constructs in database languages to the theory of data complexity and the expressibility hierarchy of query languages; (ii) provide a reasoned introduction to effective programming with non-deterministic constructs; (iii) compare the usage of non-deterministic constructs in languages such as LDL++ to that of traditional logic programming languages; (iv) discuss the link between the semantics of logic programs with non-deterministic constructs and the stable-model semantics of logic programs with negation.