A. Borgida, "Language Features for Flexible Handling of Exceptions in Information Systems", ACM Transactions on Database Systems, Vol 10, No.4, December 1985, 565-603.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....these logics and tailoring them for individual applications. We conclude in Section 5 with a brief summary. Note that in this chapter we do not review the literature on handling inconsistent information in relational databases. For this, see Chapters 3 and 4 in this book. Other references include [3, 4, 9, 17]. 2 HANDLING INCONSISTENT There are many situations in which information and its contrary both appear in an information system. In some situations such inconsistencies could be useful, such as in a collection database, where they could initiate profitable enquiries. In other situations they are ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10(4): 565--603, December 1985.

....and re execution technique is an integrated technique that considers the interaction between forward execution and rollbacks in workflows. Handling logical failures is analogous to exception handling. There has been a great deal of work on exception handling in the area of programming languages [88, 26] and software fault tolerance [49] In programming languages, depending on the type of exception, control is transferred to an appropriate statement or routine. In fault tolerant systems, as soon as faults are detected, control is transferred to exception handling algorithms which correct the ....

Alexander Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10(4), December 1985.

....object is created when, for example, a transaction tries to access a missing attribute or one of the constraints is violated. When exceptional facts are tried to be accommodated, some of the transactions will be semantically incorrect or incorrectly typed. An essentially demand driven technique [Bor85b] for dealing with exceptional values is to allow transactions which signal or propagate exceptions either to be backtracked , so that all side effects are undone, or to be resumed . The resume possibility means that the exceptional value is replaced by another value for the particular case. For ....

A. Borgida. Language features for flexible handling of exceptions in Information Systems. In ACM Trans. on Database Systems, December 1985.

....N # M(P ) Winslett. In [Win90] Winslett defines the models of the updated knowledge base as M(T # W P ) N # M(P ) #M # M(T ) M#N # (M, P ) In other words, for each model of T it chooses the closest (w.r.t. set containment) model of P . 4 Borgida. Borgida s operator #B [Bor85] coincides with Winslett s one, except in the case when P is consistent with T , in which case Borgida s revised theory is simply T # P . Forbus. This approach [For89] takes into account cardinality: Let kM,P be the minimum cardinality of sets in (M, P ) The models of Forbus updated theory ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10:563--603, 1985.

.... and the world itself changes as well. The knowledge compilation proposal contains no provisions for incorporating such belief revisions or updates. There are, of course, in the literature many formalisms for updating and revising knowledge bases and databases with incomplete information [3, 21, 1, 23, 11, 10, 24, 8]; see [25] and [6] for two systematic surveys. As was established in [6] all these systems are plagued with tremendous complexity obstacles even making the next inference, which is known as the counterfactual problem, is complete at some high level of the polynomial hierarchy for all of them. ....

....differ in their notions of a projection and closeness. In Satoh s [21] and Dalal s [3] models, the projection is the subset of (OE) that achieves minimal distance from any model in ( Gamma) in Dalal s it is minimum Hamming distance, in Satoh s minimal set theoretic difference) In Borgida s [1] and Forbus s [8] models, the projection is the subset of (OE) that achieves minimal distance from some model in ( Gamma) in Forbus it is minimum Hamming distance, in Borgida s minimal set theoretic difference) Finally, Winslett s [24] approach is a variant of Borgida s, in which the ....

A. Borgida "Language Features for Flexible Handling of Exceptions in Information Systems,"ACM Transactions on Database Systems, 10, pp. 563--603, 1985.

....has considered one such distance: the distance between two propositional worlds is the number of atomic propositions on which they differ, i.e. the Hamming distance between worlds considered as binary kdimensional vectors, where k is the number of atomic propositional variables. A. Borgida [Bor85] considered a similar but different distance, based on set inclusion. His distances are not totally ordered and therefore the framework presented here does not fit his work. Another example of such a distance is the trivial distance: d(m; n) is 0 if m = n and 1 otherwise. Both those distances ....

A. Borgida, "Language features for flexible handling of exceptions in information systems", ACM Transactions on Database Systems, Vol. 10, pp. 563-603, 1985.

....closely related to the early work on database update and belief revision. There is a huge literature in these two areas. Pioneering work includes Fagin et al. s theory of updating logical databases [FUV83, FKUV86] Gardenfors s theory of revision [G 88] Borgida s mechanism of exception handling [Bor85] Abiteboul and Grahne s update semantics [AG85] etc. There is also a great deal of work on multidatabases and 15 schema integration. Bright et al. BAP92] and Batini and Lenzerini [BL86] put forward a survey on the issues in multidatabase systems and schema integration respectively. Baral et ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Trans. on Database Systems, 10:563--603, 1985.

....on Principles of Database Systems, San Diego, CA, June 2 4, 1992. y Mailing address: Paniglgasse 16, A 1040 Wien, Austria. Internet e mail: feiter,gottlobg vexpert.dbai.tuwien.ac. at 1 the WIDTIO approach [19, 21, 58] Dalal s revision [7] the approach by Forbus [14] Borgida s method [3], Winslett s Possible Models Approach [57] Satoh s method [53] and Weber s approach [56] Each of these methods is suited for particular application domains; most researchers agree that none of them can be considered as a general purpose means of changing knowledge bases. Moreover, it is now ....

....3.4 Let T = fa; bg and p = a c) a :b :c) Note that T p is unsatisfiable. It is easily checked that 4 min (T; p) ffagg and that fb; cg is the only model of p selected by ffi S . Therefore, T ffi S p j :a b c. Borgida s Approach: The revision operator ffi B proposed by Borgida [3] uses like ffi S set inclusion instead of cardinality to interpret minimality of change. Let for a model M and a formula p be 4 min M (p) min (fM4M 0 : M 0 2 Mod(p)g) that is, 4 min m (p) is the family of minimal difference sets between any model of p and M . Borgida s operator ....

A. Borgida. Language Features for Flexible Handling of Exceptions in Information Systems. ACM Trans. on Database Syst., 10:563--603, 1985.

....and Vardi [15, 14] and further studied by Nebel [41, 42] the This paper is an overview of [11] which contains detailed proofs of all complexity results. Cross Product approach [15] the WIDTIO approach [21, 47, 52] Dalal s revision [7, 8] the approach by Forbus [16] Borgida s method [4], Winslett s Possible Models approach [51] Satoh s method [49] and Weber s approach [50] All these methods adhere to the principle of Minimality of Change, which states that the knowledge base should change as small as possible if new information is incorporated, and each of them is suited ....

....heavily on the notion of model di erence de ned by 3 operator M(T p) if T p is inconsistent M(T p) if T p is consistent Dalal [7, 8] D fM 2 M(p) 9M 0 2 M(T ) s.t. jM4M 0 j = j4j min (T; p)g T p Forbus [16] F S M2M(T ) fM 0 2 M(p) jM 0 4M j = j4j min M (p)g Borgida [4] B S M2M(T ) fM 0 2 M(p) M4M 0 2 4 min M (p)g T p Winslett [51] Win S M2M(T ) fM 0 2 M(p) M4M 0 2 4 min M (p)g Satoh [49] S fM 2 M(p) 9M 0 2 M(T ) s.t. M4M 0 2 4 min (p; T )g T p Weber [50] Web fM 2 M(p) 9M 0 2 M(T ) s.t. M T;p = M 0 T;p g T p Table ....

A. Borgida. Language Features for Flexible Handling of Exceptions in Information Systems. ACM Trans. on Database Syst., 10:563-603, 1985.

....compute an object of one type version to another, rules for keeping the type graph consistent and for converting existing objects to correspond to the new graph, or a set of operations to be applied to objects and types whenever structure differences exist. The versioning approach is used in 5 [Bor85, SZ87] Methods associate a set of error handlers with the different versions of a type, either focusing on instance level variations or on type level changes. 3.3 Structured documents The methods for document transformations are usually suitable for a specific definition of a document ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions of Data Base Systems, 10(4):565--603, 1985.

....to ours in the context of relational databases. Whereas LOGIN uses hierarchy to create more efficient logic programs, we are using it here to develop a restricted but expressive logic that can be implemented efficiently on a relational database. Inheritance with exceptions has been studied in [5, 6, 8]. These papers have focussed on modeling the class hierarchies, and on language issues, whereas we are studying not just the representation, but also the logic and the implementation, and specifically so in a relational context. An argument has been made for intensional answers to queries (in ....

A. Borgida, "Language Features for Flexible Handling of Exceptions in Information Systems," ACM Transactions on Database Systems, 10(4), Dec. 1985, pp. 565-603.

.... are usually introduced at later stages of the software lifecycle, such as architectural design or programming, where the boundary between the software and its environment has been decided and cannot be reconsidered, and where the requirements specifications are postulated correct and complete [And81, Bor85, Per89, Cri91, Ros92, Jal94, Cri95, Aro98, Gar99]. In contrast, we perform systematic obstacle analysis at the much earlier stage of requirements engineering, from goal formulations, so that more freedom is left on adequate ways of handling obstacles to goals like, e.g. considering alternative requirements or alternative agent assignments ....

....manner. Various forms of fault tolerance are discussed in [Gar99] they are based on whether a program still satisfies its safety properties, liveness properties, or both. Detection and correction are also discussed there as the two main phases in achieving fault tolerance. In the database area, [Bor85] describes language mechanisms for handling violations of assumptions in a database. Using such mechanisms, programs can be designed to detect and handle exeptional facts, or the database can adjust its constraints to tolerate the violation. All the work reviewed above addresses the later phases ....

A. Borgida, "Language Features for Flexible Handling of Exceptions in Information Systems", ACM Transactions on Database Systems Vol. 10 No. 4, Dec. 1985, 565-603.

....a model of prioritized circumscription satisfies stronger formulas as much as possible. We apply this idea to formalizing prioritized minimal revision. We illustrate our idea by the following example of logical representation of a database and constraints is inspired by the database example in [Borgida85, p590]. Example 1 Integrity Constraint meaning that if F is a father of E then the age of E must be under the age of F : 8E; F=person) 8A1;A2=age) father(F; E) age(F; A1) age(E;A2) oe (A2 A1) A rule of calculating the age: 8E=person) 8Y;Z=year) 8A=age) birth year(E;Y ) current year(Z)A = ....

Borgida, A., Language Features for Flexible Handling of Exceptions in Information Systems, ACM Transactions on Database Systems, 10, pp. 565 -- 603 (1985).

....and slows down the system. This mode is preferable in a critical development phase (e.g. shortly before an important project review) and when developing critical components (e.g. the control system of an atomic power plant) The eager detection mode is traditionally applied in database area, e.g. [8, 31], and some of the logic based approaches, e.g. 20] In [4] the eager mode is also used for software engineering. All the above given definitions are based on an eager detection in the sense that they all were formulated w.r.t. a current transaction. In the on demand mode the user controls the ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Trans. on Database Systems, 10(4):565--603 (1985).

....is closely related to the early work on database update and belief revision. There is a huge literature in these two areas. Pioneer work includes Fagin et al. s theory of updating logical databases [FUV83, FKUV86] Gardenfors s theory of revision [G 88] Borgida s mechanism of exception handling [Bor85] Abiteboul and Grahne s update semantics [AG85] etc. There is also a great deal of work on multidatabases and schema integration. Bright et al. BAP92] and Batini and Lenzerini [BL86] put forward a survey on the issues in multidatabase systems and schema integration respectively. Baral et al. ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Trans. on Database Systems, 10:563--603, 1985.

....variables with different truth values instead of cardinality to determine distance. This means ffi(ff; fi) is the set of propositional atoms p i such that ff(p i ) 6= fi(p i ) and Delta(A; contains the set inclusion minimal sets ffi(ff; fi) where ff ranges over M(A) and fi over M( Borgida s [ 1985 ] scheme also uses set inclusion for measuring distance, but collects for each model of A the closest models of provided is not consistent with A. Otherwise, it simply uses the intersection over the models, i.e. it expands the base by the revision formula. Finally, Weber s [ 1986 ] ....

Alexander Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10(4):565--603, December 1985.

....and the flexibility of procedural programming. The way we do this is by incorporating an explicit exception handling mechanism inside a grammar parser. Exception handling has been extensively studied in the context of programming languages and data types [27, 47, 25] and also in databases [41, 20, 21]. In this work, we introduce an exception handling mechanism inside grammars. The way we do this is by annotate grammar productions with an EXCEPTION clause, containing a procedural piece of code. During the parsing, if one of the productions fails, an exception is raised, and the corresponding ....

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10(4):565--603 (1985).

No context found.

A. Borgida, "Language Features for Flexible Handling of Exceptions in Information Systems", ACM Transactions on Database Systems, Vol 10, No.4, December 1985, 565-603.

.... by (a) reifying actions, workcases and states as instances of classes with attributes; b) associating all exceptions with violations of constraints; c) extending the discipline of exception handling learned from programming languages, and applying it to persistent exceptional data and deviations [7]; d) viewing membership in the extents of systems classes as a temporal database. The paper first introduces the data and process model to be used, and then describes procedural exception handling mechanisms. This is adapted to accommodate persistent exceptional data in Section 4, while in ....

....language exception mechanisms offer a controlled, structured way in which processes influenced by an exceptional event can participate in its resolution and either terminate or resume after appropriate repairs have been made. 4 OBJECTS AND EXCEPTIONS A fundamental principle of our approach [7] is that an exception occurs when some constraint is violated. In our case, every constraint is associated with a class through an attribute, and so the constraint can be identified by the class name, attribute name pair. This means that there is no need to declare a specific exception object to ....

[Article contains additional citation context not shown here]

A. Borgida. "Language Features for Flexible Handling of Exceptions in Information Systems", ACM Trans. on Database Systems, 10(4), Dec. 1985, 565603.

No context found.

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10(4):565--603, 1985.

No context found.

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10, 1985.

No context found.

A. Borgida. Language features for flexible handling of exceptions in information systems. ACM Transactions on Database Systems, 10, 1985. 40

No context found.

A. Borgida, "Language features for flexible handling of exceptions in information systems", ACM Trans. on Database Systems, 10(4):565-603, 1985.

No context found.

A. Borgida, "Language Features for Flexible handling of Exceptions in Information Systems", ACM Trans. on Database Systems, vol. 10, pp. 565-603, 1985.

No context found.

A. Borgida. Language Features For Flexible Handling Of Exceptions In Information Systems. ACM Transactions on Database Systems, 10(4):565--603, 1985.

First 50 documents  Next 50

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