D. Beneventano and S. Bergamaschi. Subsumption for complex object data models. In Proceedings of the 4th International Conference on Database Theory, Lecture Notes in Computer Science 646, pages 357--375. Springer-Verlag, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and established, the definitional approach is still the subject of an interesting debate, regarding both its nature and its semantic foundation. In particular, it is well known that there are various possibilities of assigning a meaning to a class definition when it contains some sort of recursion [2, 3, 84, 8, 5]. In this chapter, we are concerned with the semantical problems related to the definitional approach, arguing that, instead of choosing a single style of semantics for the knowledge representation formalism, we achieve better results by adopting a more general formalism that allows for different ....

D. Beneventano and S. Bergamaschi. Subsumption for complex object data models. In Proceedings of the 4th International Conference on Database Theory, Lecture Notes in Computer Science 646, pages 357--375. Springer-Verlag, 1992.

....de#nitional approach is still the subject of an interesting debate, regarding both its nature and its semantic foundation. In particular, it is well known that there are various ways to assign a meaning to a class de#nition when it contains some sort of recursion #Baader, 1990, 1991; Nebel, 1991; Beneventano Bergamaschi, 1992; Beeri, 1990#. In this paper, we are concerned with the semantic problems related to the de#nitional approach, arguing that, instead of choosing a single style of semantics for the knowledge representation formalism, weachieve better results by allowing di#erent semantics to coexist. We discuss ....

Beneventano, D., & Bergamaschi, S. #1992#. Subsumption for complex object data models. In Proc. of the 4th Int. Conf. on Database Theory #ICDT-92#, No. 646 in Lecture Notes in Computer Science, pp. 357#375. Springer-Verlag.

.... In fact, the characteristics of the constructors we use to form entity expressions resemble those of the so called terminological or frame based languages introduced in Artificial Intelligence (see for example [8, 13, 21] whose connections with databases have been investigated in several ways [4, 6, 5, 7]. From a syntactic point of view, an entity expression over the alphabet B of the schema S is formed by means of the following rules (which implicitly define domain expressions too) C, F # E C # F C # F C (#R[U ] T 1 : C 1 , T n : C n ) #R[U ] T 1 : C 1 , ....

D. Beneventano, S. Bergamaschi. "Subsumption for complex object data models." Proceedings of the 4the International Conference on Database Theory, 1992.

....definitional approach is still the subject of an interesting debate, regarding both its nature and its semantic foundation. In particular, it is well known that there are various possibilities of assigning a meaning to a definition of a class, in particular when it contains some sort of recursion ([1, 10, 3, 2]) In this paper, we are concerned with the semantical problems related to the definitional approach, arguing that, instead of choosing a 1 Dipartimento di Informatica e Sistemistica, Univ. di Roma La Sapienza , Via Salaria 113, 00198 Roma, Italia. degiacom assi.dis.uniroma1.it 2 Dipartimento ....

D. Beneventano and S. Bergamaschi, `Subsumption for complex object data models', in Proc. of the 4th Int. Conf. on Database Theory, LNCS 646, pp. 357--375. Springer-Verlag, (1992).

....approach is still the subject of an interesting debate, regarding both its nature and its semantic foundation. In particular, it is well known that there are various possibilities for assigning a meaning to a definition of a class, especially if such a definition contains some sort of recursion ([Baa90, Neb91, BB92, Bee90]) In this paper, we are concerned with the semantical problems related to the definitional approach, arguing that, instead of choosing a single style of semantics for the knowledge representation formalism, we achieve a better result by adopting a powerful formalism allowing different semantics ....

D. Beneventano and S. Bergamaschi. Subsumption for complex object data models. In Proc. of the 4th Int. Conf. on Database Theory, LNCS 646, pages 357--375. SpringerVerlag, 1992.

....approach is still the subject of an interesting debate, regarding both its nature and its semantic foundation. In particular, it is well known that there are various ways to assign a meaning to a class definition when it contains some sort of recursion (Baader, 1990, 1991; Nebel, 1991; Beneventano Bergamaschi, 1992; Beeri, 1990) In this paper, we are concerned with the semantic problems related to the definitional approach, arguing that, instead of choosing a single style of semantics for the knowledge representation formalism, we achieve better results by allowing different semantics to coexist. We ....

Beneventano, D., & Bergamaschi, S. (1992). Subsumption for complex object data models.

.... The complexity of these inferences was assessed for a variety of acyclic DLs (see e.g. 28] Recently, description logic based formalisms for databases, which extend in different directions the above cited DLs and exploit taxonomic reasoning in a database environment, have been proposed [10, 12, 16, 17, 22, 23]. The extensions proposed in [16] were necessary to represent the richer expressiveness of CODMs with respect to previously proposed DLs. In fact, CODMs are, in some aspects, more expressive. First of all, CODMs introduce a distinction between values and objects with identity and, thus, between ....

....particular, the equal sign holds for bosses, which are managers of themselves. The inclusion of virtual cyclic type names in a schema gives rise to the new problem of choosing one of the possible semantics to interpret cyclic definitions: least fixpoint, greatest fixpoint or descriptive semantics [10, 43]. As a consequence, the interpretation of a virtual cyclic type name is not uniquely determined by the interpretations of primitive type names. For example, the class of employees who earn less than 10,000 and are managed by employees with the same limitation, is described by the following cyclic ....

D. Beneventano and S. Bergamaschi. Subsumption for complex object data models. In J. Biskup and R. Hull, editors, 4th Int. Conf. on Database Theory, pages 357--375, Heidelberg, Germany, October 1992. Springer-Verlag.

....In other words, it is not necessary to resolve inheritance conflicts on attributes that inherit different value ranges from multiple classes as in O 2 [21] but the value range of an attribute is simply the intersection over the value ranges of this attribute in all parent classes. 4 See [6, 25, 9] for a more detailed description of the various semantics. 2.5 Inheritance, Subsumption, and Coherence Based on the definitions above, we now give formal definitions for the notions of subsumption and incoherence. Given a schema oe, there is the question for the semantic relationship between ....

D. Beneventano and S. Bergamaschi. Subsumption for complex object data models. In Proceedings of the International Conference on Database Theory, Berlin, Germany, 1992. Springer-Verlag.

No context found.

D. Beneventano and S. Bergamaschi. Subsumption for complex object data models. In J. Biskup and R. Hull, editors, 4th Int. Conf. on Database Theory - Berlin, pages 357--375, Heidelberg, Germany, October 1992. Springer-Verlag.

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