OPTIMIZING DATALOG PROGRAMS.

Yehoshua Sagiv

doi:10.1145/28659.28696

OPTIMIZING DATALOG PROGRAMS.

Yehoshua Sagiv^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

41 Scopus citations

Abstract

Datalog programs, i. e, Prolog programs without function symbols, are considered. It is assumed that a variable appearing in the head of a rule must also appear in the body of the rule. The input of a program is a set of ground atoms (which are given in addition to the program's rules) and, therefore, can be viewed as an assignment of relations to some of the program's predicates. The equivalence problem for Datalog programs is known to be undecidable. It is shown that uniform equivalence is decidable, and an algorithm is given for minimizing a Datalog program under uniform equivalence.

Original language	English
Title of host publication	Unknown Host Publication Title
Publisher	ACM
Pages	349-362
Number of pages	14
ISBN (Print)	0897912233, 9780897912235
DOIs	https://doi.org/10.1145/28659.28696
State	Published - 1987
Externally published	Yes

Access to Document

10.1145/28659.28696

Cite this

@inproceedings{0d2eefc7d82f42ea963429fc9b80a1f0,

title = "OPTIMIZING DATALOG PROGRAMS.",

abstract = "Datalog programs, i. e, Prolog programs without function symbols, are considered. It is assumed that a variable appearing in the head of a rule must also appear in the body of the rule. The input of a program is a set of ground atoms (which are given in addition to the program's rules) and, therefore, can be viewed as an assignment of relations to some of the program's predicates. The equivalence problem for Datalog programs is known to be undecidable. It is shown that uniform equivalence is decidable, and an algorithm is given for minimizing a Datalog program under uniform equivalence.",

author = "Yehoshua Sagiv",

year = "1987",

doi = "10.1145/28659.28696",

language = "אנגלית",

isbn = "0897912233",

publisher = "ACM",

pages = "349--362",

booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - OPTIMIZING DATALOG PROGRAMS.

AU - Sagiv, Yehoshua

PY - 1987

Y1 - 1987

N2 - Datalog programs, i. e, Prolog programs without function symbols, are considered. It is assumed that a variable appearing in the head of a rule must also appear in the body of the rule. The input of a program is a set of ground atoms (which are given in addition to the program's rules) and, therefore, can be viewed as an assignment of relations to some of the program's predicates. The equivalence problem for Datalog programs is known to be undecidable. It is shown that uniform equivalence is decidable, and an algorithm is given for minimizing a Datalog program under uniform equivalence.

AB - Datalog programs, i. e, Prolog programs without function symbols, are considered. It is assumed that a variable appearing in the head of a rule must also appear in the body of the rule. The input of a program is a set of ground atoms (which are given in addition to the program's rules) and, therefore, can be viewed as an assignment of relations to some of the program's predicates. The equivalence problem for Datalog programs is known to be undecidable. It is shown that uniform equivalence is decidable, and an algorithm is given for minimizing a Datalog program under uniform equivalence.

UR - https://www.scopus.com/pages/publications/0023535527

U2 - 10.1145/28659.28696

DO - 10.1145/28659.28696

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0023535527

SN - 0897912233

SN - 9780897912235

SP - 349

EP - 362

BT - Unknown Host Publication Title

PB - ACM

ER -

OPTIMIZING DATALOG PROGRAMS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this