ON TAXONOMIC REASONING IN CONCEPTUAL DESIGN

被引:35
作者
BERGAMASCHI, S [1 ]
SARTORI, C [1 ]
机构
[1] UNIV BOLOGNA,I-40126 BOLOGNA,ITALY
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 1992年 / 17卷 / 03期
关键词
DESIGN; LANGUAGE; THEORY; VERIFICATION; SCHEMA CONSISTENCY; SCHEMA MINIMALITY; SEMANTIC MODELS; TAXONOMIC REASONING;
D O I
10.1145/132271.132272
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Taxonomic reasoning is a typical task performed by many AI knowledge representation systems. In this paper, the effectiveness of taxonomic reasoning techniques as an active support to knowledge acquisition and conceptual schema design is shown. The idea developed is that by extending conceptual models with defined concepts and giving them rigorous logic semantics, it is possible to infer isa relationships between concepts on the basis of their descriptions. From a theoretical point of view, this approach makes it possible to give a formal definition for consistency and minimality of a conceptual schema. From a pragmatic point of view it is possible to develop an active environment that allows automatic classification of a new concept in the right position of a given taxonomy, ensuring the consistency and minimality of a conceptual schema. A formalism that includes the data semantics of models giving prominence to type constructors (E/R, TAXIS, GALILEO) and algorithms for taxonomic inferences are presented: their soundness, completeness, and tractability properties are proved. Finally, an extended formalism and taxonomic inference algorithms for models giving prominence to attributes (FDM, IFO) are given.
引用
收藏
页码:385 / 422
页数:38
相关论文
共 54 条
  • [1] IFO - A FORMAL SEMANTIC DATABASE MODEL
    ABITEBOUL, S
    HULL, R
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 1987, 12 (04): : 525 - 565
  • [2] ABITEBOUL S, 1988, LECT NOTES COMPUT SC, V303, P271
  • [3] AITKACI H, 1986, 1ST P INT WORKSH EXP, P115
  • [4] GALILEO - A STRONGLY-TYPED, INTERACTIVE CONCEPTUAL LANGUAGE
    ALBANO, A
    CARDELLI, L
    ORSINI, R
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 1985, 10 (02): : 230 - 260
  • [5] Formal properties of net-based knowledge representation schemes
    Atzeni, P.
    Parker Jr., D.S.
    [J]. Data and Knowledge Engineering, 1988, 3 (03) : 137 - 147
  • [6] SET CONTAINMENT INFERENCE AND SYLLOGISMS
    ATZENI, P
    PARKER, DS
    [J]. THEORETICAL COMPUTER SCIENCE, 1988, 62 (1-2) : 39 - 65
  • [7] BATINI C, 1992, CONCEPTUAL LOGICAL D
  • [8] BECK HW, 1989, 5TH P INT C DAT ENG, P572
  • [9] RELATIONAL DATA-BASE DESIGN FOR THE INTENSIONAL ASPECTS OF A KNOWLEDGE BASE
    BERGAMASCHI, S
    BONFATTI, F
    CAVAZZA, L
    SARTORI, C
    TIBERIO, P
    [J]. INFORMATION SYSTEMS, 1988, 13 (03) : 245 - 256
  • [10] BERGMASCHI S, 1991, CIOC CNR78 TECH REP