Raschid, L. and Lobo, J., Semantics for update rule programs and implementation in a relational database management system. To appear in the ACM Transactions on Database Systems. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Denotational Semantics for the Starburst Production Rule.. - Jennifer Widom (1992) (9 citations) (Correct)
....In all cases, the semantics are described informally or, at best, as an algorithm for rule execution. The lack of formal declarative semantics for database production rule languages has been discussed at some length, particularly in the context of understanding and reasoning about rule behavior [AWH92,DD91,KdMS92,RL91]. In response to this problem, some work has been done in extending deductive database rule languages, which have a clean declarative semantics [CGT90] to include production rule capabilities. In [RL91] a declarative semantics is given for such an extension, but the extension is not as powerful ....
....in the context of understanding and reasoning about rule behavior [AWH92,DD91,KdMS92,RL91] In response to this problem, some work has been done in extending deductive database rule languages, which have a clean declarative semantics [CGT90] to include production rule capabilities. In [RL91], a declarative semantics is given for such an extension, but the extension is not as powerful as most integrated database production rule languages. In [KdMS92] a more powerful extension is considered, but no declarative semantics is specified. In this short paper we give a denotational ....
L. Raschid and J. Lobo. Semantics for update rule programs and implementation in a relational database management system. Technical Report UMIACS-TR-91-140, Institute for Advanced Computer Studies, University of Maryland, 1991.
Bottom-Up Magic Evaluation Techniques for Stratified Production .. - Pingli Pang (1994) Self-citation (Raschid) (Correct)
....we will extend the use of CE to rule programs which are not initially stratified. These program capture causal and non deterministic behavior among the rules. The 15 corresponding logic programs do not have a single model but have a set of models described using the stable model semantics [RaLo ]. 16 7. ....
Raschid, L. and Lobo, J., Semantics for update rule programs and implementation in a relational database management system. To appear in the ACM Transactions on Database Systems.
A Semantics for a Class of Non-Deterministic and Causal.. - Louiqa Raschid (1992) (1 citation) Self-citation (Raschid Lobo) (Correct)
....Similarly, the consequent may include a sequence of actions or actions which correspond to some computable values. We have not considered the effect of such extensions in this paper. However, we have considered the problem of evaluable predicates in related research on update rules in databases [RaLo91]. Programs with multiple actions in the head of each rule can be accommodated by a straightforward rewriting of the program. A function free production system program PS consists of the following: i) A set of a productions, each of which has a single assert action in its consequent. ii) A set of ....
Raschid, L., Lobo, J., Semantics for update rule programs and implementation in a relational database management system. Submitted to the ACM Transactions on Database Systems, 1991.
Characterizing Production Systems using Logic Programming and.. - Chitta Baral Self-citation (Lobo) (Correct)
....fluent literal f iff Pi s P j= finally(f) 2 Proof (idea) The proof uses the splitting described in the proof of Proposition 3.1. 2 3. 1 Relation with earlier approaches Before we present the semantics for more complex systems we would like to say a few words about Raschid s production systems [5, 6, 7, 8]. To ensure termination, Raschid modifies the execution of the actions and the matching process in the operational semantics of rule systems. Deletions do not remove elements from the WM. Instead, a marker is added to the WM indicating that a remove operation has been applied to the element. The ....
....) last(S) holds(F; S) not holds(F 0 ; S) finally(F 0 ) last(S) holds(F 0 ; S) A nice property of our transformation is that the final WM is not directly modeled with a stable model of the program. Instead we use the hold predicate and the situation variable. In Raschid and Lobo [7, 8] the models of the program were used directly. Hence, a final state of the WM could not be a proper subset of another possible final state since it will violate the minimality property of the intended models of the logic program restricting the class of production rule programs that could be ....
L.Raschid and J. Lobo. Semantics for update rule programs and implementation in a relational database management system. ACM Transactions on Database Systems. To appear.
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