Extension table evaluation of datalog programs with negation

Chia Fang Shih, Suzanne Dietrich

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The authors describe the ET* NOT algorithm, which uses the ET* algorithm to evaluate the predicates in negative literals and uses the resulting extension tables to represent the positive facts. If the literal is in the extension table, the result of the negation is false; otherwise, it is true. Applying the ET* NOT algorithm to evaluate negation has two advantages. The first advantage is that the ET* NOT algorithm extends the implementation of the negation as failure rule to evaluate negation under the more powerful closed world assumption. The second advantage is that the ET* NOT algorithm uses the materialized views of the predicates in the extension table and may avoid expensive recomputation.

Original languageEnglish (US)
Title of host publicationConference Proceedings - Annual Phoenix Conference
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages792-798
Number of pages7
ISBN (Print)0818621338
StatePublished - Mar 1991
EventProceedings of the 10th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA
Duration: Mar 27 1991Mar 30 1991

Other

OtherProceedings of the 10th Annual International Phoenix Conference on Computers and Communications
CityScottsdale, AZ, USA
Period3/27/913/30/91

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Shih, C. F., & Dietrich, S. (1991). Extension table evaluation of datalog programs with negation. In Conference Proceedings - Annual Phoenix Conference (pp. 792-798). Piscataway, NJ, United States: Publ by IEEE.

Extension table evaluation of datalog programs with negation. / Shih, Chia Fang; Dietrich, Suzanne.

Conference Proceedings - Annual Phoenix Conference. Piscataway, NJ, United States : Publ by IEEE, 1991. p. 792-798.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shih, CF & Dietrich, S 1991, Extension table evaluation of datalog programs with negation. in Conference Proceedings - Annual Phoenix Conference. Publ by IEEE, Piscataway, NJ, United States, pp. 792-798, Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications, Scottsdale, AZ, USA, 3/27/91.
Shih CF, Dietrich S. Extension table evaluation of datalog programs with negation. In Conference Proceedings - Annual Phoenix Conference. Piscataway, NJ, United States: Publ by IEEE. 1991. p. 792-798
Shih, Chia Fang ; Dietrich, Suzanne. / Extension table evaluation of datalog programs with negation. Conference Proceedings - Annual Phoenix Conference. Piscataway, NJ, United States : Publ by IEEE, 1991. pp. 792-798
@inproceedings{ef07bc4f5279451ca13aa7c40f4c55a1,
title = "Extension table evaluation of datalog programs with negation",
abstract = "The authors describe the ET* NOT algorithm, which uses the ET* algorithm to evaluate the predicates in negative literals and uses the resulting extension tables to represent the positive facts. If the literal is in the extension table, the result of the negation is false; otherwise, it is true. Applying the ET* NOT algorithm to evaluate negation has two advantages. The first advantage is that the ET* NOT algorithm extends the implementation of the negation as failure rule to evaluate negation under the more powerful closed world assumption. The second advantage is that the ET* NOT algorithm uses the materialized views of the predicates in the extension table and may avoid expensive recomputation.",
author = "Shih, {Chia Fang} and Suzanne Dietrich",
year = "1991",
month = "3",
language = "English (US)",
isbn = "0818621338",
pages = "792--798",
booktitle = "Conference Proceedings - Annual Phoenix Conference",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Extension table evaluation of datalog programs with negation

AU - Shih, Chia Fang

AU - Dietrich, Suzanne

PY - 1991/3

Y1 - 1991/3

N2 - The authors describe the ET* NOT algorithm, which uses the ET* algorithm to evaluate the predicates in negative literals and uses the resulting extension tables to represent the positive facts. If the literal is in the extension table, the result of the negation is false; otherwise, it is true. Applying the ET* NOT algorithm to evaluate negation has two advantages. The first advantage is that the ET* NOT algorithm extends the implementation of the negation as failure rule to evaluate negation under the more powerful closed world assumption. The second advantage is that the ET* NOT algorithm uses the materialized views of the predicates in the extension table and may avoid expensive recomputation.

AB - The authors describe the ET* NOT algorithm, which uses the ET* algorithm to evaluate the predicates in negative literals and uses the resulting extension tables to represent the positive facts. If the literal is in the extension table, the result of the negation is false; otherwise, it is true. Applying the ET* NOT algorithm to evaluate negation has two advantages. The first advantage is that the ET* NOT algorithm extends the implementation of the negation as failure rule to evaluate negation under the more powerful closed world assumption. The second advantage is that the ET* NOT algorithm uses the materialized views of the predicates in the extension table and may avoid expensive recomputation.

UR - http://www.scopus.com/inward/record.url?scp=0026121430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026121430&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026121430

SN - 0818621338

SP - 792

EP - 798

BT - Conference Proceedings - Annual Phoenix Conference

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -