Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/4370
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYahya, Adnan-
dc.contributor.authorMinker, Jack-
dc.date.accessioned2017-03-04T07:38:50Z-
dc.date.available2017-03-04T07:38:50Z-
dc.date.issued1993-
dc.identifier.urihttp://hdl.handle.net/20.500.11889/4370-
dc.description.abstractThe concepts of the dual and complementary databases as alternative representations for a given disjunctive deductive database, DB, are introduced. The dual database results from interchanging the occurrences of OR and AND operators in the positive clause representation of DB. The complementary database is de ned to have as minimal models the complements of the minimal models of DB relative to the underlying Herbrand base, HBDB. The properties of these derivative databases are studied. In particular, we show that the minimal models of DB correspond to the minimally derivable clauses of the dual database and that the complementary database de nes the Extended Generalized Closed World Assumption (EGCW A) completion, and consequently the Generalized Closed World Assumption (GCW A) completion, of DB. A tree structure for minimally derivable clauses is de ned and algorithms for constructing and performing update and search operations on such trees are givenen_US
dc.language.isoen_USen_US
dc.subjectDeductive databasesen_US
dc.subjectLogic programmingen_US
dc.titleRepresentations for disjunctive deductive database [s]en_US
dc.typeArticleen_US
newfileds.departmentEngineering and TechnologyEngineering and Technologyen_US
newfileds.item-access-typeopen_accessen_US
newfileds.thesis-prognoneen_US
newfileds.general-subjectnoneen_US
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat 
5aef24bdf682881d69db397f96870b7ca850.pdf310.43 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.