The Logical Operations on Relations, Scales and Concept Lattices

被引:1
|
作者
Lei, Yuxia [1 ]
Sui, Yuefei [1 ]
Cao, Cungen [1 ]
机构
[1] Chinese Acad Sci, Key Lab Intelligent Informat Proc, Inst Comp Technol, Beijing 100190, Peoples R China
关键词
relational databases; concept lattices; logical operations; negation; disjunction; conjunction; DISCOVERY;
D O I
10.1109/SKG.2009.37
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Object-attribute-value-relationships, which are a frequently used data structure to code real-world problems, are formalized via many-valued contexts in Formal Concept Analysis (FCA). The aim of FCA is to explore (formal) concepts from empirical data contexts. A concept of a context consists of two parts: the extent (objects the concept covers) and the intent (attributes describing the concept). From the logical point of view, the intent of each concept is a conjunction of some attributes. Similar to conjunction, negation and disjunction are also important logical operations of attributes or attribute-value pairs, which are common in human language. However, the classical FCA as a mathematical theory of concepts lacks a theory of negation and disjunction. In this paper, we take negation and disjunction into consideration in the process of constructing concepts, and hence obtain the following extended concepts: negative concepts of a context (i.e., a binary relation), negative concepts of a relation with some scales, V-concepts of a relation, V-concepts of a relation with some scales, logical concepts of a relation, and logical concepts of a relation with some scales. Compared with concepts in the classical FCA, the extended concepts mentioned above are more pertinent and more meaningful.
引用
收藏
页码:160 / 167
页数:8
相关论文
共 50 条
  • [41] A note on similarity relations between fuzzy attribute-oriented concept lattices
    Ciobanu, Gabriel
    Vaideanu, Cristian
    INFORMATION SCIENCES, 2018, 460 : 254 - 263
  • [42] PRAGMATIC SCALES AND LOGICAL STRUCTURE
    FAUCONNIER, G
    LINGUISTIC INQUIRY, 1975, 6 (03) : 353 - 375
  • [43] Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges
    Antoni, Lubomir
    Krajci, Stanislav
    Kridlo, Ondrej
    FUZZY SETS AND SYSTEMS, 2016, 303 : 21 - 37
  • [44] LOGICAL STEP-INDEXED LOGICAL RELATIONS
    Dreyer, Derek
    Ahmed, Amal
    Birkedal, Lars
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (02)
  • [45] NECESSARY AND SUFFICIENT CONDITIONS FOR G-STRUCTURES WITH LOGICAL RELATIONS TO FORM BOUNDED LATTICES IN RECONSTRUCTABILITY ANALYSIS
    SHU Guangfu Institute of Systems Scientce
    Systems Science and Mathematical Sciences, 1993, (03) : 252 - 258
  • [46] Lattices of Logical Fragments over Words
    Kufleitner, Manfred
    Lauser, Alexander
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II, 2012, 7392 : 275 - 286
  • [47] The concept of logical fiberings and fibered logical controllers
    Pfalzgraf, J
    COMPUTING ANTICIPATORY SYSTEMS, 2001, 573 : 683 - 693
  • [48] Concept-base refining with thesaurus and logical relations for a word association-system
    Kojima, K
    Watabe, H
    Kawaoka, T
    KNOWLEDGE-BASED INTELLIGENT INFORMATION ENGINEERING SYSTEMS & ALLIED TECHNOLOGIES, PTS 1 AND 2, 2001, 69 : 1590 - 1594
  • [49] Cryptographic logical relations
    Zhang, Yu
    THEORETICAL COMPUTER SCIENCE, 2008, 394 (1-2) : 39 - 63
  • [50] Lax logical relations
    Plotkin, G
    Power, J
    Sannella, D
    Tennent, R
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 85 - 102