Maintenance of stratified databases viewed as a belief revision system

Authors:
K. Apt;J. M. Pugin
Affiliations:
Laboratorie d'Informatique, Ecole Normale Supéneure, 45 rue d'Ulm, 75230 Paris and LITP, Université Pans 7, 2 Place Jussieu, 75251 Paris and CWI Kruislaan 413, 1098 SJ, Amsterdam The Net ...;Bull Research Center, PC 58 A 14 - A I Division, 68 route de Versailles, 78430 Louveciennes
Venue:
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1987

Citing 7
Cited 6

Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption

Journal of Logic Programming
Negation as failure. II

Journal of Logic Programming
An assumption-based TMS

Artificial Intelligence
Magic sets and other strange ways to implement logic programs (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
On domain independent databases

Foundations of deductive databases and logic programming
Logic and Databases: A Deductive Approach

ACM Computing Surveys (CSUR)

Incremental evaluation of rules and its relationship to parallelism

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Space-bounded FOIES (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A data structure for arc insertion and regular path finding

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Deterministic FOIES are strictly weaker

Annals of Mathematics and Artificial Intelligence
Symbolic support graph: a space efficient data structure for incremental tabled evaluation

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Incrementally maintaining materializations of ontologies stored in logic databases

Journal on Data Semantics II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study here declarative and dynamic aspects of non-monotonic reasoning in the context of deductive databases. More precisely, we consider here maintenance of a special class of indefinite deductive databases, called stratified databases, introduced in Apt, Blair and Walker [ABW] and Van Gelder [VG] in which recursion “through” negation is disallowed.A stratified database has a natural model associated with it which is selected as its intended meaning. The maintenance problem for these databases is complicated because insertions can lead to deletions and vice versa.To solve this problem we make use of the ideas present in the works of Doyle [D] and de Kleer [dK] on belief revision systems. We offer here a number of solutions which differ in the amount of static and dynamic information used and the form of support introduced. We also discuss the implementation issues and the trade-offs involved.