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 language | English (US) |
|---|---|
| Title of host publication | Conference Proceedings - Annual Phoenix Conference |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | Publ by IEEE |
| Pages | 792-798 |
| Number of pages | 7 |
| ISBN (Print) | 0818621338 |
| State | Published - Mar 1991 |
| Event | Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA Duration: Mar 27 1991 → Mar 30 1991 |
Other
| Other | Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications |
|---|---|
| City | Scottsdale, AZ, USA |
| Period | 3/27/91 → 3/30/91 |
ASJC Scopus subject areas
- Engineering(all)
Cite this
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 proceeding › Conference contribution
}
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 -