On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Compiling the GCWA in indefinite deductive databases
Foundations of deductive databases and logic programming
Weak generalized closed world assumption
Journal of Automated Reasoning
On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
Weakly stratified logic programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
The indefinite closed world assumption
Data & Knowledge Engineering
Top-down query processing in indefinite stratified databases
Data & Knowledge Engineering
On cyclic covers and perfect models
Data & Knowledge Engineering
Processing deductive databases under the disjunctive stable model semantics
Fundamenta Informaticae
Deduction Trees and the View Update Problem in Indefinite Deductive Databases
Journal of Automated Reasoning
A Possible World Semantics for Disjunctive Databases
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
The relationship between possible and supported models of unstratified indefinite deductive databases is studied, when disjunction is interpreted inclusively. Possible and supported models are shown to coincide under a suitable definition of supportedness, and the concept of a supported cover is introduced and shown to characterise possible models and facilitate top-down query processing and compilation under the possible model semantics. The properties and query processing of deductive databases under the possible model semantics is compared and contrasted with the perfect model semantics.