Closures in Binary Partial Algebras

被引：0
|
作者：
Zhang, Guo-Qiang [1 ]
机构：
[1] Case Western Reserve Univ, Dept Elect Engn & Comp Sci, Cleveland, OH 44022 USA
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2009年 / 257卷
关键词：
Partial algebra; algorithm; closure; formal concept analysis; resolution principle;
D O I：
10.1016/j.entcs.2009.11.023
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Two procedures for computing closures in binary partial algebras (BPA) are introduced: a Fibonacci-style procedure for closures in associative BPAs, and a multistage procedure for closures in associative, commutative and idempotent BPAs. Ramifications in areas such as resolution theorem proving, graph-theoretic algorithms, formal languages and formal concept analysis are discussed. In particular, the multistage procedure, when applied to formal concept analysis, results in a new algorithm outperforming leading algorithms for computing concept sets.
引用
收藏
页码：3 / 18
页数：16
相关论文
共 50 条
12345