While non-determinism has long been established as a key concept in logic programming, 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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Programming with non-determinism in deductive databases|
|Data di pubblicazione:||1997|
|Citazione:||Programming with non-determinism in deductive databases / Giannotti, F.; Greco, Sergio; Sacca', Domenico; Zaniolo, C.. - In: ANNALS OF MATHEMATICS AND OF ARTIFICIAL INTELLIGENCE. - ISSN 1012-2443. - 19:1-2(1997), pp. 97-125.|
|Appare nelle tipologie:||1.1 Articolo in rivista|