首页 > 流水帐 > 笔记:描述逻辑的云计算(2)主要参考文献

笔记:描述逻辑的云计算(2)主要参考文献

对DL TBox分布式推理的几篇主要文章,按时间为序。其他有很多关于语义网的并行计算的文章(参Peiqiang Li 2009),无庸罗列。

再次注意,凡是基于rule的推理和分布式triple store,比如RDFS, OWL-Horst, OWL-RL,不是本系列关注的对象。

另参考综述PPT:

1995

Frank W. Bergmann, Joachim Quantz. Parallelizing Description Logics. Proceeding. In KI ’95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence. [bibtex]【基于结构比较算法。核心是 parallelizing propagation:propagation是指从一个fact推理得另一个fact,例P(a,b)->P(b,a)。没有具体的算法,参考意义不大。对树图算法的参考意义在label propagation。】

2007

Thorsten Liebig, Felix Müller: Parallelizing Tableaux-Based Description Logic Reasoning. OTM Workshops (2) 2007: 1135-1144 [bibtex]

2008

Mina Aslani, Volker Haarslev: Towards Parallel Classifcation of TBoxes. Description Logics 2008 [bibtex]

Jürgen Bock: Parallel Computation Techniques for Ontology Reasoning. International Semantic Web Conference 2008: 901-906 [bibtex]【这是个PhD proposal。不过现在好像没有下文,暂时可不看】

Anne Schlicht, Heiner Stuckenschmidt: Distributed Resolution for ALC. Description Logics 2008 [bibtex][ppt]

2009

Anne Schlicht, Heiner Stuckenschmidt: Distributed Resolution for Expressive Ontology Networks. RR 2009: 87-101 [bibtex]【扩展2008文到ALCHIQ】

Adam Meissner: A Simple Parallel Reasoning System for the ALC\mathcal{ALC} Description Logic. ICCCI 2009: 413-424 [bibtex]

2010

Mina Aslani, Volker Haarslev: TBox Classification in Parallel: Design and First Evaluation.Description Logics 2010 [bibtex] 【续Aslani2008】

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

Thorsten Liebig, Andreas Steigmiller and Olaf Noppens. Scalability via Parallelization of OWL Reasoning In Workshop on NeFoRS: New Forms of Reasoning for the Semantic Web: Scalable & Dynamic 【续Liebig2007,一个只有5页的简短报告】

Raghava Mutharaju, Frederick Maier, Pascal Hitzler: A MapReduce Algorithm for EL+.Description Logics 2010 [bibtex]【EL+不用Tableau算法,而是CEL算法。CEL算法本身并不构造model(tableau),而是构造分类树。用了一组 completion rules,从形式上看,倒类似于Tableau算法。因为树的表现可以用映射mapping,就可以用MR在做分布式的表示。假设TBox分布在不同的节点上,所以是distributed data,但又是reasoner level分布。关键是选择什么是key,参其Fig 4。这个文章以前看过,这里不详细笔记。】

Frederick Maier, Raghava Mutharaju, Pascal Hitzler. Distributed Reasoning with EL++ Using MapReduce. Technical Report, Kno.e.sis Center, Wright State University, Dayton, Ohio, 2010. 【上文的扩展,TR,略】

Anne Schlicht, Heiner Stuckenschmidt: Peer-to-Peer Reasoning for Interlinked Ontologies. Int. J. Semantic Computing 4(1): 27-58 (2010) [bibtex]

2011

Adam Meissner: Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic. Applied Mathematics and Computer Science 21(1): 83-95 (2011) [bibtex]

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 博主赞过: