Union Algorithm of Linguistic Truth-Valued Concept Lattice Based on Logical Conjunction

YANG Li; XU Yang

doi:10.3969/j.issn.0372-2112.2013.11.006

您当前的位置：

首页 >

文章列表页 >

Union Algorithm of Linguistic Truth-Valued Concept Lattice Based on Logical Conjunction

更新时间：2025-07-16

- Union Algorithm of Linguistic Truth-Valued Concept Lattice Based on Logical Conjunction
- Acta Electronica Sinica Vol. 41, Issue 11, Pages: 2149-2155(2013)
- 作者机构：
  
  1. 华北水利水电学院数学与信息科学学院,河南,郑州,450046
  2. 西南交通大学数学学院,四川,成都,610031
  3. 华北水利水电学院数学与信息科学学院,河南,郑州,450046
  4. 西南交通大学数学学院,四川,成都,610031
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.71101049, No.61175055);Sponsered by Applied Basic Research Program of Science and Technology Department of Sichuan Province (No.08JC0068);Science and Technology Support Program of Sichuan Province (No.2011FZ0051)
- DOI：10.3969/j.issn.0372-2112.2013.11.006
  CLC： TP18
- Published：2013
- 稿件说明：
移动端阅览
YANG Li, XU Yang. Union Algorithm of Linguistic Truth-Valued Concept Lattice Based on Logical Conjunction[J]. Acta Electronica Sinica, 2013, 41(11): 2149-2155.
DOI：

YANG Li, XU Yang. Union Algorithm of Linguistic Truth-Valued Concept Lattice Based on Logical Conjunction[J]. Acta Electronica Sinica, 2013, 41(11): 2149-2155. DOI： 10.3969/j.issn.0372-2112.2013.11.006.

摘要

针对人工智能领域中有关不确定性自然语言的研究，将格值逻辑引入概念格，提出了自然语言转换为语言真值的方法，并基于语言真值格蕴涵代数建立了语言真值概念格.通过对各语言真值形式背景及形式概念间关系的分析，演示了由多个语言真值概念格的合并而构造完整概念格的具体过程，进而给出了语言真值概念格基于逻辑合取的合并定理与算法.实验表明，与Bordat算法相比，当属性个数增多时，适当的合并算法能够使其时间复杂度呈指数型降低.

Abstract

For the uncertainty natural language processing research in the field of artificial intelligence

this paper

introducing the lattice-valued logic into the concept lattice

proposes the method of transforming the natural language into linguistic truth values and establishes the linguistic truth-valued concept lattice based on linguisitc truth-valued lattice implication algebra.In order to reduce the complexity of constructing the concept lattice

we demonstrate the specific process of constructing a complete linguistic truth-valued concept lattice through combining the multiple sub-concept lattices after analyzing the relationship among the linguistic truth-valued formal contexts and formal concepts

and then give the union theorem and algorithm based on logical conjunction.Experiments show that comparied with Bordat algorithm

the appropriate union algorithm can exponentially ruduce the time complexity when increasing the number of attributes.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Multi-Level Description of Granules From an Outsider’s Perspective

Horizontal Union Algorithm of Multiple Concept Lattices

Theory and Algorithm of Concept Lattice Union

The Application of Concept Lattice Theory in the Reduction of the Proposition Set in Two-Valued Propositional Logic

A New Visualizing Mining Method of Multi-Valued Attribute Association Rules for Ordinary Users

Related Author

ZHI Hui-lai

ZHANG Li

LI Jin-hai

CHENG Wei

XU Xiao-hua

CHEN Ling

LIU Zong-tian

LI Yun

Related Institution

School of Computer Science and Technology, Henan Polytechnic University

Data Science Research Center, Kunming University of Science and Technology

Institute of Information EngineeringYangzhou UniversityYangzhouJiangsu 225009China

School of Computer ScienceShanghai UniversityShanghai 200072China

Institute of Information Engineering,Yangzhou University

⁰