Extension table evaluation of datalog programs with negation

Chia Fang Shih, Suzanne Dietrich

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

1 Scopus citations

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
PublisherPubl by IEEE
Pages792-798
Number of pages7
ISBN (Print)0818621338
StatePublished - Mar 1 1991
EventProceedings of the 10th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA
Duration: Mar 27 1991Mar 30 1991

Publication series

NameConference Proceedings - Annual Phoenix Conference

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). (Conference Proceedings - Annual Phoenix Conference). Publ by IEEE.