A New Partial Semantics for Disjunctive Deductive Databases.
Saved in:
| Title: | A New Partial Semantics for Disjunctive Deductive Databases. |
|---|---|
| Authors: | Gire, Françoise1 gire@univ-paris1.fr, Plourde, Corinne2 plourde@paragraph.fr |
| Source: | Fundamenta Informaticae. 2005, Vol. 67 Issue 4, p323-342. 20p. |
| Subjects: | Deductive databases, Databases, Computer files, Electronic information resources, Programming language semantics |
| Abstract: | We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative definition as well as a computational procedure for this new semantics. We prove that, in the case of disjunctive positive databases, i.e. disjunctive databases without negation, the disjunctive well-founded semantics coincides with the intersection of the minimal models. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
