Frank Piessens and Eric Steegmans. Canonical forms for dataspecifications. In Proceedings of Computer Science Logic 94, number 933 in Lecture Notes in Computer Science, pages 397--411. Springer-Verlag, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The graph-based logic of ER-diagrams and taming heterogeneity of.. - Diskin (1997) (Correct)
.... E i to the corresponding entity sets E i ; i = 1; n; in addition, the family (f i ; i = 1; n) must satisfy a certain property to guarantee that elements of R can be indeed identified with tuples of references (in the context of semantic modeling the construction was described in [7, 26, 12] and probably in other works, see also section 2.1 below) The figure just described is an arrow diagram, 3 it is a branch of modern algebra where graph based algebra and logic are studied; a standard reference suitable for computer science is [4] the property we have mentioned is a diagram ....
F. Piessens and E. Steegmans. Canonical forms for data specifications. In Computer Science Logic'94 8th Int.Workshop, CSL'94, Springer LNCS'933, pages 397--411, 1994.
Generalised Sketches as an algebraic graph-based framework for.. - Diskin (1997) (Correct)
....keyed sketches: the key subgraph of a sketch must satisfy certain conditions to guarantee a finitary identification of objects by values. In particular, the terminality condition mentioned above is terminality of the set of domains in the key subgraph. A slightly different treatment was used in [33] where value domains do not at all appear in carrying graphs of sketches. This is however inconvenient when one needs to compose a reference between classes with an attribute of the target class. 4.2 The fundamental role of ObjectClass vs ValueDomain dichotomy in applications of model theory to ....
F. Piessens and E. Steegmans. Canonical forms for data specifications. In Computer Science Logic'94 8th Int.Workshop, CSL'94, Springer LNCS'933, pages 397--411, 1994.
Algebraic Graph-Oriented = Category Theory Based. Manifesto of.. - Diskin (1994) (4 citations) (Correct)
.... exists and, moreover, is well elaborated: this is the framework offered by categorial logic and categorial model theory as they were developed in the mathematical category theory (see [Wel] for references) Indeed, it was discovered in [DDJ93, JD93, CD93] and developed in [CD95, DC95] see also [PS94] for an independent work in the same direction) that various semantic schemas like eg, ER diagrams which are widely used by practitioners and theorists can be naturally considered a special kind of structures being studied in categorial logic since the late sixties, and called there sketches (a ....
F. Piessens and E. Steegmans. Canonical forms for data specifications. In Computer Science Logic'94 8th Int.Workshop, CSL'94, Springer LNCS'933, pages 397--411, 1994.
A Decision Procedure for Semantical Equivalence of Thin FM.. - Piessens, Steegmans (1999) Self-citation (Piessens Steegmans) (Correct)
No context found.
Frank Piessens and Eric Steegmans. Canonical forms for dataspecifications. In Proceedings of Computer Science Logic 94, number 933 in Lecture Notes in Computer Science, pages 397--411. Springer-Verlag, 1994.
Categorical Data-Specifications - Piessens, Steegmans (1995) Self-citation (Piessens Steegmans) (Correct)
....diagrams ( 10] on the other hand, have been used for many years in the early stages of database design. However, most specification systems used in practice are of an informal nature, and have little or no mathematical foundation. This makes it impossible to prove interesting results about them. [13] formalized these specification systems using categorical language, and proved The first author is a Research Assistant of the Belgian Fund for Scientific Research Received by the editors 19 June 1995. Published on 2 November 1995 1991 Mathematics Subject Classification : 18A25, 18C99, 68P15. Key ....
....sketch is called an MD sketch. The main result about MD sketches is that equivalence of the model categories of two MD sketches is decidable. In section 3 we define data specifications, and their model categories. Our definition is equivalent to the definition of specification with attributes in [13]. If the modelcategories of two different data specifications are equivalent, this means that they are different formalizations of the same real world situation. Recognizing that two different data specifications are equivalent is very important when one tries to integrate a number of ....
[Article contains additional citation context not shown here]
F. Piessens, E. Steegmans. "Canonical forms for data-specifications", Proceedings of Computer Science Logic 94, Springer Verlag LNCS 933, pp. 397--411.
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