Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-25T05:24:06.979Z Has data issue: false hasContentIssue false
  • English
  • Français

Enhancing the expressive power of the U-Datalog language

Published online by Cambridge University Press:  03 April 2001

ELISA BERTINO ,
BARBARA CATANIA  and
ROBERTA GORI
ELISA BERTINO
Affiliation:
University of Milan, Via Comelico 39, 20135 Milano, Italy; e-mail: [email protected]
BARBARA CATANIA
Affiliation:
University of Genova, Via Dodecaneso 35, 16146 Genova, Italy; e-mail: [email protected]
ROBERTA GORI
Affiliation:
University of Pisa, Corso Italia, 40, 56125 Pisa, Italy; e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

deductive databaseupdatestratified negation
Type
Technical note
Information
Theory and Practice of Logic Programming , Volume 1 , Issue 1 , January 2001 , pp. 105 - 122
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)