Abstract
This paper introduce the class of possible models for a declarative semantics of deductive databases. The possible model semantics is an extension of the minimal model semantics of databases and provides both inclusive and exclusive interpretations for disjunctive deductive databases. We characterize it by giving a new fixpoint semantics of databases and then introduce a rule, called the GCW AP for inferring negation from a database. We also present the proof procedure, called SLDP-resolution and show its soundness and completeness with respect to possible model semantics.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call