@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 = mar,

day = "1",

language = "English (US)",

isbn = "0818621338",

series = "Conference Proceedings - Annual Phoenix Conference",

publisher = "Publ by IEEE",

pages = "792--798",

booktitle = "Conference Proceedings - Annual Phoenix Conference",

note = "Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications ; Conference date: 27-03-1991 Through 30-03-1991",

}