Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T20:02:48.474Z Has data issue: false hasContentIssue false

Enhancing the expressive power of the U-Datalog language

Published online by Cambridge University Press:  03 April 2001

ELISA BERTINO
Affiliation:
University of Milan, Via Comelico 39, 20135 Milano, Italy; e-mail: bertino@dsi.unimi.it
BARBARA CATANIA
Affiliation:
University of Genova, Via Dodecaneso 35, 16146 Genova, Italy; e-mail: catania@disi.unige.it
ROBERTA GORI
Affiliation:
University of Pisa, Corso Italia, 40, 56125 Pisa, Italy; e-mail: gori@di.unipi.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

U-Datalog has been developed with the aim of providing a set-oriented logical update language, guaranteeing update parallelism in the context of a Datalog-like language. In U-Datalog, updates are expressed by introducing constraints (+p(X), to denote insertion, and −p(X), to denote deletion) inside Datalog rules. A U-Datalog program can be interpreted as a CLP program. In this framework, a set of updates (constraints) is satisfiable if it does not represent an inconsistent theory, that is, it does not require the insertion and the deletion of the same fact. This approach resembles a very simple form of negation. However, on the other hand, U-Datalog does not provide any mechanism to explicitly deal with negative information, resulting in a language with limited expressive power. In this paper, we provide a semantics, based on stratification, handling the use of negated atoms in U-Datalog programs, and we show which problems arise in defining a compositional semantics.

Information

Type
Technical note
Copyright
© 2001 Cambridge University Press