期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于OBDD的描述逻辑εL循环术语集推理 被引量：1

OBDD-Based Reasoning for Terminological Cycles of the Description Logic εL
在线阅读 下载PDF
导出
摘要 循环术语集推理是描述逻辑研究中面临的难点问题,尚未得到很好的解决.有序二叉决策图(ordered binary decision diagram,简称OBDD)是一种对布尔函数进行紧凑表示和高效操作的数据结构,适用于表示和处理大规模问题.将OBDD应用于描述逻辑循环术语集的推理.首先,针对描述逻辑εL中的循环术语集,给出了描述图上关于最大模拟关系的重要性质,并借助集合表示和集合运算对该性质进行了表述和证明.在此基础上,应用布尔函数对描述图进行编码,给出了基于OBDD求解最大模拟关系的方法,进而给出了最大不动点语义下基于OBDD对概念包含关系进行判定的算法;接下来,基于OBDD给出了求解描述图中可以到达循环路径的所有结点的方法,进而给出了最小不动点语义下基于OBDD对概念包含关系进行判定的算法;最后,对算法的正确性、复杂度等进行了分析和证明,并对算法进行了编程实现,给出了关于计算性能的实验结果.该工作为循环术语集的推理提供了一条有效途径,也为OBDD在逻辑推理中的应用提供了新的案例. Reasoning about terminological cycles of description logics is a hard problem that needs to be solved. Ordered binary decision diagram （OBDD） is a data structure suitable for dealing with large-scale problems since through the diagram Boolean functions can be represented compactly and computed efficiently. In this paper, OBDD is adopted to reason about terminological cycles of description logics. First, for terminological cycles of the description logic sL, with the help of set representation and operation, a property about the greatest simulation relationship on description graphs of terminological cycles is specified and proved. Second, by encoding description graphs of terminological cycles as Boolean functions, an OBDD-based procedure for computing the greatest simulation relationship is proposed, and based on this procedure an algorithm is presented for deciding the subsumption relationship between concepts under the greatest fix-point semantics. Third, based on OBDD, a procedure for calculating all the nodes which can reach cycle paths in a description graph is proposed, and based on this procedure an algorithm for deciding the subsumption relationship under the least fix-point semantics is also presented. Finally, the correctness and time complexity of both algorithms are proved; the computing performance of both algorithms are also demonstrated by a set of experiments. This work provides an effective approach for reasoning about terminological cycles of description logics; it also provides a new case for applying OBDD in the fields of logical reasoning.
作者 古天龙 吕思菁 常亮 徐周波
机构地区 广西可信软件重点实验室(桂林电子科技大学)
出处 《软件学报》 EI CSCD 北大核心 2014年第1期64-77,共14页 Journal of Software
基金 国家自然科学基金(60963010 60903079 61100025 61262030 61363030) 广西自然科学基金(2012GXNSFBA 053169)
关键词 描述逻辑εL 循环术语集 有序二叉决策图 概念包含关系 不动点语义 description logic eL terminological cycles ordered binary decision diagram concept subsumption fix-point semantics
分类号 TP181 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献18

  • 1Yan H, Zhang W, Zhao HY, Mei H. BDD-Based approach to the verification of feature models. Ruan Jian Xue Bao/Journal of Software, 2010,21(1):84-97 (in Chinese with English abstract), http://www.jos.org.cn/1000-9825/3525.htm [doi: 10.3724/SP.J. 1001.2010.03525].
  • 2史忠植,董明楷,蒋运承,张海俊.语义Web的逻辑基础[J].中国科学（E辑）,2004,34(10):1123-1138. 被引量：71
  • 3Baader F. Using automata theory for characterizing the semantics of terminological cycles. Annals of Mathematics and Artificial Intelligence, 1996,18(2-4):175-219. Idol: 10,1007/BF02127747].
  • 4Rudolph S, Krtzsch M, Hitzler P. Type-Elimination-Based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalo. Logical Methods in Computer Science. 2012.8(1 ): 1-38.
  • 5Jiang YC, Wang J, Shi ZZ, Tang Y. Fixpoint semantics and reasoning terminological cycles in description logic e.LN. Ruan Jian Xue Bao/Journal of Software, 2009,20(3):477-490 (in Chinese with English abstract), http://www.jos.org.cn/1000-9825/3215.htm.
  • 6Nebel B. Terminological cycles: Semantics and computational properties. In: Sowa JF, ed. Proc. of the Principles of Semantic Networks. San Francisco: Morgan Kaufmann Publishers, 1991. 331-362.
  • 7Keller U. Towards novel techniques for reasoning in expressive description logics based on binary decision diagrams. In: Simperl EB, Diederich J, eds. Proc. of the 4th Annual European Semantic Web Conf. 2007. 435-450.
  • 8Gu TL, Xu ZB. Ordered Binary Decision Diagram and Its Applications. Beijing: Science Press, 2009 (in Chinese).
  • 9Kusters R. Characterizing the semantics of terminological cycles in ALN using finite automata. In: Cohn AG, Schubert L, Shapiro SC, eds. Proc. of the 6th lnt'l Conf. on Principles of Knowledge Representation and Researching. San Francisco: Morgan Kaufmann Publishers, 1998.499-511.
  • 10Baader F. Terminological cycles in a description logic with existential restrictions. In: Gottlob G, Walsh T, eds. Proc. of the 18th Iut'l Joint Conf. on Artificial Intelligence. San Francisco: Morgan Kaufmann Publishers, 2003. 325-330.

二级参考文献46

  • 1SHIZhongzhi DONGMingkai JIANGYuncheng ZHANGHaijun.A logical foundation for the semantic Web[J].Science in China(Series F),2005,48(2):161-178. 被引量：27
  • 2蒋运承,汤庸,王驹.基于描述逻辑的模糊ER模型[J].软件学报,2006,17(1):20-30. 被引量：30
  • 3蒋运承,史忠植,汤庸,王驹.面向语义Web语义表示的模糊描述逻辑[J].软件学报,2007,18(6):1257-1269. 被引量：36
  • 4Kang KC, Cohen SG, Hess JA, Novak WE, Peterson AS. Feature-Oriented domain analysis feasibility study. Technical Reports, CMU/SEI-90-TR-21, ESD-90-TR-222, Software Engineering Institute, Carnegie Mellon University, 1990.
  • 5Kang KC, Kim S, Lee J, Kim K, Shin E, Huh M. FORM: A feature-oriented reuse method with domain-specific reference architectures. Annals of Software Engineering, 2004,5(1): 143-168.
  • 6Griss ML, Favaro J, d'Alessandro M. Integrating feature modeling with the RSEB. In: Proc. of the 5th Int'l Conf. on Software Reuse. IEEE Computer Society, 1998.76-85.
  • 7Czarnecki K, Eisenecker U. Generative Programming: Methods, Tools, and Applications. Boston: Addison-Wesley, 2000.
  • 8Batory D. Feature models, grammars, and propositional formulas. In: Proc. of the Software Product Line Conf. LNCS 3714, Berlin, Heidelberg: Springer-Verlag, 2005.7-20.
  • 9Mannion M. Using first-order logic for product line model validation. In: Proc. of the 2nd Software Product Line Conf. LNCS 2379, Berlin, Heidelberg: Springer-Verlag, 2002. 176-187.
  • 10Zhang W, Zhao H, Mei H. A propositional logic-based method for verification of feature models. In: Proc. of the 6th Int'l Conf. on Formal Engineering Methods (ICFEM 2004). LNCS 3308, Berlin, Heidelberg: Springer-Verlag, 2004. 115-130.

共引文献88

同被引文献12

  • 1古天龙,杨志飞.基于有序二叉决策图的装配序列符号表示方法[J].计算机辅助设计与图形学学报,2007,19(10):1315-1320. 被引量：4
  • 2Akers S B.Binary decision diagrams[J].IEEE Transactions on Computer,1978,27(6):509-516.
  • 3Bryant R E.Graph based algorithms for Boolean function manipulation[J].IEEE Transactions on Computer,1986,35(8):677-691.
  • 4Wei Qianjin,Gu Tianlong.Symbolic representation for rough set attribute reduction using ordered binary decision diagrams[J].Journal of Software,2011,6(6):977-984.
  • 5Yang Liu,Manadhata P K,Horne W G,et al.Fast submatch extraction using OBDDs[R].[S.l.]:HP Laboratories,2012.
  • 6Wang Chong,Vittal V,Sun K.OBDD-based sectionalizing strategies for parallel power system restoration[J].IEEE Transactions on Power Systems,2011,26(3):1426-1433.
  • 7Somenzi F.CUDD:CU decision diagram package release2.4.1[EB/OL].[2013-09-11].http://vlsi.Colorado.edu/fabio/CUDD/cuddIntro.html.
  • 8Jackson P.BDD operations[EB/OL].[2013-12-21].www.inf.ed.ac.uk/teaching/courses/ar/slides/bdd-ops.pdf.
  • 9徐周波,古天龙.装配序列规划问题的CSP模型及其符号OBDD求解技术[J].计算机辅助设计与图形学学报,2010,22(5):803-810. 被引量：8
  • 10徐周波,古天龙,常亮,李凤英.约束满足问题求解的符号OBDD桶消元算法[J].计算机科学,2011,38(7):200-202. 被引量：4

引证文献1

软件学报
2014年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部