Please use this identifier to cite or link to this item:
Title: Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects
Authors: Yahya, Adnan 
Keywords: Generalized Query;Database management;Database design;Deductive databases;Disjunctive databases;Commonsense reasoning - Automation;Artificial intelligence - Mathematics Logic, Symbolic and mathematical - Data processing
Issue Date: 1997
Abstract: Generalized queries are de ned 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). Our 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 al l and those that are true in some minimal models of the theory and investigate the monotonicity properties of the different classes of queries and answers.
Appears in Collections:Fulltext Publications

Show full item record

Page view(s)

checked on Jun 18, 2024


checked on Jun 18, 2024

Google ScholarTM


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