Winslett, M., Updating Logical Databases, Cambridge Tracks in Theoretical Computer Science 9, Cambridge University Press, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Maintenance of Implication Integrity Constraints under.. - Ishakbeyoglu, Ozsoyoglu (1993) (3 citations) (Correct)
....results after updates has been a subject of study in the fields of database, artificial intelligence, and philosophy as belief revision, truth maintenance or theory update problems. Different approaches or semantics have been proposed to this problem in the literature (Gardenfors 1992, Winslett 1990, Fagin et al. 1983, Rossi and Naqvi 1989) One common theme in these semantics is to try to construct a single resulting in our context constraint base from the alternative constraint bases, e.g. S 0 and S 00 in Example 15. However, during the process of constructing a single set of ....
....constraint bases, e.g. S 0 and S 00 in Example 15. However, during the process of constructing a single set of constraints, completely new constraints may be generated and added to the constraint set. Also the size of the resulting constraint set may increase exponentially after the update (Winslett 1990). Surveys on different semantics for maintaining integrity constraints can be found elsewhere (Gardenfors 1992, Winslett 1990) 8 Conclusion In this paper we discuss the problem of maintaining a consistent and non redundant set of constraints. In particular, we consider how to check whether a ....
[Article contains additional citation context not shown here]
Winslett, M., Updating Logical Databases, Cambridge Tracks in Theoretical Computer Science 9, Cambridge University Press, 1990.
The PMA and Relativizing Change for Action Update - Doherty, Lukaszewicz.. (1998) (6 citations) (Correct)
....an additional syntactic characterization of the MPMA in terms of a Dijkstra semantics based approach together with a corresponding decision procedure, and additional comparisons with related work. 2 The Classical PMA We present the classical PMA semantics, originally developed by Winslett [25, 26, 27]. 2.1 The Language Lpma We start with a language Lpma of classical propositional logic based on a finite fixed set ATM = fp; q; r; g of atoms. Formulas are built in the usual way using the connectives ; truth) and (falsity) If ff and fi are formulas and p is an atom, then ....
M. Winslett. Updating Logical Databases. Cambridge Tracks in Theoretical Computer Science. Cambridge University Press, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC