首页 > 笔记, 逻辑 > 笔记:描述逻辑的云计算(4)Aslani方法

笔记:描述逻辑的云计算(4)Aslani方法

Mina Aslani, Volker Haarslev: Towards Parallel Classifcation of TBoxes. Description Logics 2008 [bibtex] 【sound but not complete略过】

Mina Aslani, Volker Haarslev: TBox Classification in Parallel: Design and First Evaluation. Description Logics 2010 [bibtex] 【ECAI文章的workshop版,也可略过】

Mina Aslani, Volker Haarslev: Parallel TBox Classification in Description Logics – First Experimental Results.  ECAI 2010: 485-490 [bibtex]

这篇文章是reasoner level并行,而不是proof level并行。在对一个TBox做分类(classification)时,如果有n个概念,就有n(n+1)/2个子类关系测试。本文分析如何将这些测试分给多个独立的线程(thread)。在内存使用上,基于global tree(全局树)。

本文提到所谓的ParTree (parallel tree)方法,就是每个线程构造一个本地树,最后将这些本地树组合成一个全局树。P-DL推理算法,就是一种proof-level, ParTree的方法。

由于本文不涉及树图算法本身的并行化,参考意义不大。

Advertisements
分类:笔记, 逻辑
  1. 还没有评论。
  1. 2012/04/16 @ 01:33

发表评论

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / 更改 )

Twitter picture

You are commenting using your Twitter account. Log Out / 更改 )

Facebook photo

You are commenting using your Facebook account. Log Out / 更改 )

Google+ photo

You are commenting using your Google+ account. Log Out / 更改 )

Connecting to %s

%d 博主赞过: