Please use this identifier to cite or link to this item:
|Title:||Representations for disjunctive deductive database [s]||Authors:||Yahya, Adnan
|Keywords:||Deductive databases;Logic programming||Issue Date:||1993||Abstract:||The 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 given||URI:||http://hdl.handle.net/20.500.11889/4370|
|Appears in Collections:||Fulltext Publications|
Show full item record
Files in This Item:
|5aef24bdf682881d69db397f96870b7ca850.pdf||310.43 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.