Checking functional consistency in deductive databases

E. Lambrechts; P. Nees; J. Paredaens; P. Peelman; L. Tanca

doi:10.1016/0020-0190(90)90059-7

Checking functional consistency in deductive databases

E. Lambrechts, P. Nees, J. Paredaens, P. Peelman, L. Tanca

Mathematics and Computer Science

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	115-120
Tijdschrift	Information Processing Letters
Volume	35
Nummer van het tijdschrift	3
DOI's	https://doi.org/10.1016/0020-0190(90)90059-7
Status	Gepubliceerd - 1990

Toegang tot document

10.1016/0020-0190(90)90059-7

Citeer dit

@article{95b8df7c707649e5a3c07f77be40a7cf,

title = "Checking functional consistency in deductive databases",

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.",

author = "E. Lambrechts and P. Nees and J. Paredaens and P. Peelman and L. Tanca",

year = "1990",

doi = "10.1016/0020-0190(90)90059-7",

language = "English",

volume = "35",

pages = "115--120",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Checking functional consistency in deductive databases

AU - Lambrechts, E.

AU - Nees, P.

AU - Paredaens, J.

AU - Peelman, P.

AU - Tanca, L.

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

U2 - 10.1016/0020-0190(90)90059-7

DO - 10.1016/0020-0190(90)90059-7

M3 - Article

SN - 0020-0190

VL - 35

SP - 115

EP - 120

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Checking functional consistency in deductive databases

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit