Inconsistency and Incompleteness in Relational Databases and Logic Programs
The aim of this thesis is to study the role played by negation in databases and to develop data models that can handle inconsistent and incomplete information. We develop models that also allow incompleteness through disjunctive information under both the CWA and the OWA in relational databases. In...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Archive @ GSU
2009
|
| Subjects: | |
| Online Access: | http://digitalarchive.gsu.edu/cs_diss/38 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1037&context=cs_diss |
| Summary: | The aim of this thesis is to study the role played by negation in databases and to develop data models that can handle inconsistent and incomplete information. We develop models that also allow incompleteness through disjunctive information under both the CWA and the OWA in relational databases. In the area of logic programming, extended logic programs allow explicit representation of negative information. As a result, a number of extended logic programs have an inconsistent semantics. We present a translation of extended logic programs to normal logic programs that is more tolerant to inconsistencies. Extended logic programs have also been used widely in order to compute the repairs of an inconsistent database. We present some preliminary ideas on how source information can be incorporated into the repair program in order to produce a subset of the set of all repairs based on a preference for certain sources over others. |
|---|