When is a concept algebra Boolean?

被引:0
|
作者
Kwuida, L [1 ]
机构
[1] TU Dresden, Inst Algebra, D-01062 Dresden, Germany
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Concept algebras are concept lattices. enriched by a weak negation and a weak opposition. The introduction of these two operations was motivated by the search of a negation on formal concepts. These weak operations form a weak dicomplementation. A weakly dicomplemented lattice is a bounded lattice equipped with a weak dicomplementation. (Weakly) dicomplemented lattices abstract (at least for finite distributive lattices) concept algebras. Distributive double p-algebras and Boolean algebras are some special subclasses of the class of weakly dicomplemented lattices. We investigate in the present work the connection between weak dicomplementations and complementation notions like semicomplementation, pseudocomplementation, complementation or orthocomplementation.
引用
收藏
页码:142 / 155
页数:14
相关论文
共 50 条