Updating Disjunctive Datbases via Model Trees
| dc.contributor.author | Grant, John | en_US |
| dc.contributor.author | Gryz, J. | en_US |
| dc.contributor.author | Minker, Jack | en_US |
| dc.date.accessioned | 2004-05-31T22:29:57Z | |
| dc.date.available | 2004-05-31T22:29:57Z | |
| dc.date.created | 1995-02 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | In this paper we study the problem of updating disjunctive databases, which contain indefinite data given as positive injunctive closes. We give correct algorithms for the insertion of a clause into and the deletion of a clause from such databases. Although the algorithms presented here are oriented towards model trees, they apply to any representation of minimal models. (Also cross-referenced as UMIACS-TR-95-11) | en_US |
| dc.format.extent | 228655 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/692 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3407 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-95-11 | en_US |
| dc.title | Updating Disjunctive Datbases via Model Trees | en_US |
| dc.type | Technical Report | en_US |