Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/2097
DC FieldValueLanguage
dc.contributor.authorYahya, Adnan-
dc.date.accessioned2016-10-08T06:45:13Z-
dc.date.available2016-10-08T06:45:13Z-
dc.date.issued1996-7-
dc.identifier.urihttp://hdl.handle.net/20.500.11889/2097-
dc.description.abstractAlgorithms 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-
dc.language.isoenen_US
dc.publisherResearchGateen_US
dc.subject.lcshDatabases-
dc.subject.lcshDatabase management-
dc.subject.lcshDeductive databases-
dc.subject.lcshLogic programming-
dc.titleModel generation in disjunctive normal databasesen_US
dc.typeArticleen_US
newfileds.departmentEngineering and Technologyen_US
newfileds.item-access-typeopen_accessen_US
item.grantfulltextopen-
item.languageiso639-1other-
item.fulltextWith Fulltext-
Appears in Collections:Fulltext Publications
Files in This Item:
File Description SizeFormat
Model Generation in Disjunctive Normal Databases.pdf380.79 kBAdobe PDFView/Open
Show simple item record

Page view(s)

2
Last Week
0
Last month
2
checked on Dec 10, 2019

Google ScholarTM

Check


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