In this paper we address the problem of integrating functions in Datalog. We extend Datalog to a language containing negation, functions, and a strong type system. This type system is used by an algorithm that, given a program, checks for its -consistency (a stronger form of consistency) by using the notions of local dependencies and global dependencies.
Checking functional consistency in deductive databases
TANCA, LETIZIA
1990-01-01
Abstract
In this paper we address the problem of integrating functions in Datalog. We extend Datalog to a language containing negation, functions, and a strong type system. This type system is used by an algorithm that, given a program, checks for its -consistency (a stronger form of consistency) by using the notions of local dependencies and global dependencies.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
