Please use this identifier to cite or link to this item:
|Title:||Minimal Model Generation for Refined Answering of Generalized Queries in Disjunctive Deductive Databases.||Authors:||Yahya, Adnan||Keywords:||Deductive databases;Minimal model generation;Query answering;Integrity constraints;Nonmonotonic reasoning||Issue Date:||2000||Publisher:||Elsevier||Source:||Adnan H. Yahya. 2000. Minimal model generation for refined answering of generalized queries in disjunctive deductive databases. Data Knowl. Eng. 34, 3 (September 2000), 219-49. DOI=http://dx.doi.org/10.1016/S0169-023X(00)00016-1||Abstract:||Generalized queries are defined as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of disjunctive deductive databases (DDDBs). The advanced approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those that are true in some minimal models of the theory. We address the issue of answering positive queries through the construction of the minimal model state of the DDDB, using a minimal model generating procedure. The refinements allowed by the procedure include isolating a minimal component of a disjunctive answer, the specification of possible updates to the theory to enable the derivability of certain queries and deciding the monotonicity properties of answers to different classes of queries.||URI:||http://hdl.handle.net/20.500.11889/4455||ISSN:||ISSN: 0169-023X|
|Appears in Collections:||Fulltext Publications|
Show full item record
Files in This Item:
|AbstractMinModGenRefine.pdf||96.83 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.