### 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 |

Publisher | Publ by IEEE |

Pages | 792-798 |

Number of pages | 7 |

ISBN (Print) | 0818621338 |

State | Published - Mar 1 1991 |

Event | Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA Duration: Mar 27 1991 → Mar 30 1991 |

### Publication series

Name | Conference Proceedings - Annual Phoenix Conference |
---|

### 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

*Conference Proceedings - Annual Phoenix Conference*(pp. 792-798). (Conference Proceedings - Annual Phoenix Conference). Publ by IEEE.