Please use this identifier to cite or link to this item:
|Title:||Model generation in disjunctive normal databases||Authors:||Yahya, Adnan||Issue Date:||Jul-1996||Publisher:||ResearchGate||Abstract:||Algorithms for computing several classes of models for disjunctive normal databases are presented. We show how to e ciently compute minimal, restricted minimal, perfect, and stable models. The common feature of the advanced algorithms is that they are based on augmenting a model generating procedure with a set of hypotheses to guide its search for acceptable models and/or to interpret negation in clause bodies. The approach is shown to be useful for di erent database applications including query answering under di erent semantics and integrity constraint enforcement. The developed algorithms are easy to implement and compare favorably with others advanced in the literature for the same purpose||URI:||http://hdl.handle.net/20.500.11889/2097|
|Appears in Collections:||Fulltext Publications|
Show full item record
Files in This Item:
|Model Generation in Disjunctive Normal Databases.pdf||380.79 kB||Adobe PDF||View/Open|
checked on Dec 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.