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

任意公理系统的依赖基

Dependency Basis of Arbitrary Axiomatic System
在线阅读 下载PDF
导出
摘要 形式化定义了值依赖的公理、公理系统及依赖基。严格证明了任何公理系统对任何背景都具有依赖基,给出了对任意一个公理系统求任意背景依赖基的方法,并证明了每个公理系统的依赖基不唯一。进而还提出了一种诱导背景,通过诱导背景可把这个证明过程及依赖基的计算过程形象地反映出来。 This paper defined axiomatic and axiomatic systems of value dependencies formally, and proved that each axi- omatic system has dependency basis for any context strictly. It gave a method of computing dependency basis of arbi trary axiomatic system for any context and proved that dependency basis of each axiomatic system is not only. And an inducement context was introduced to visually show the process of the prove and the compute dependency basis using the inducement context.
作者 马垣
机构地区 辽宁科技大学软件学院
出处 《计算机科学》 CSCD 北大核心 2013年第2期200-205,共6页 Computer Science
基金 国家自然科学基金(61074130)资助
关键词 值依赖 公理系统 依赖基 诱导背景 Value dependency,Axiomatic system,Dependency basis,Inducement context
分类号 TP18 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献9

  • 1Tsumoto S. Medical Reasoning and Rough Sets[A].Warsaw,Poland,2007.90-101.
  • 2王国胤.Rough集理论与知识发现[M]西安:西安交通大学出版社,200152-56.
  • 3Ganter B,Wille R. Formal Concept Analysis[M].Mathematical Foundations.Springer,1999.73-84.
  • 4马垣;张学东;迟呈英;王丽君.形式概念分析[M]北京:科学出版社,200762-76.
  • 5马垣.数据库理论.数据库技术新进展数据库技术新进展[M].北京:清华大学出版社,200722-44.
  • 6Mannila H,Raibba K J. On the Complexity of Inferring Functional Dependencies[J].Discrete Applied Mathematics,1992,(02):237-243.
  • 7Guigues J,Duquenne V. Familles Minirnales d' implications Informatives Resultants d'un Tableau de Donnees Binaires[A].1986.495-518.
  • 8马垣;曾子维;迟呈英.形式概念及其新进展[M]北京:科学出版社,2011111-114.
  • 9马垣,张学东,迟呈英.紧致依赖与内涵亏值[J].软件学报,2011,22(5):962-971. 被引量：13

二级参考文献18

  • 1Ma Y. Database Theory. In: New Advancement of Database Technology. 2nd ed., Beijing: Tsinghua University Press, 2007.24-44.
  • 2Tsumoto S. Medical reasoning and rough sets. In: Kryszkiewicz M, et al., eds. Proc. of the Int'l Conf. on Rough Sets and Intelligent Systems Paradigms. New York: Springer-Verlag, 2007.90-101. [doi: 10.1007/978-3-540-73451-2_11].
  • 3Ganter B, Wille R. Formal Concept Analysis Mathematical Foundations. Berlin: Springer-Verlag, 1999.62-75.
  • 4Marmila H, Raibba KJ. On the complexity of inferring functional dependencies. Discrete Applied Mathematics, 1992,40(2): 237-243. [doi: 10.1016/0166-218X(92)90031-5].
  • 5Guigues J, Duquenne V. Families Minimales d'implications Informatives Resultants d'un Tableau de Donnees Binaires. Mathematics and Social Sciences, 1986. 495-518.
  • 6Ullman JD. Principles of Database Systens. 2nd ed., New York: Computer Science Press, 1982.218-220.
  • 7Valtchev P, Missaoui R, Godin R. Formal concept analysis for knowledge discovery and data mining: The new challenges. In: Garbonell JG, Siekmann J, eds. Proc. of the Int'l Conf. on Concept Analysis (ICFCA 2004). New York: Springer-Verlag, 2004. 252-271. [doi: 10.1007/978-3-540-24651-0_30].
  • 8Eiter T, Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 1995, 24(6):1278-1340. [doi: 10.1137/S0097539793250299].
  • 9Ma Y, Gong X, Tang XM, Dong H. Discovering knowledge of increase or decrease and knowledge of circle in relational database. In: Chinese Association for Artificial Intelligence, ed. Proc. of the 2007 National Conf. on Artificial Intelligence (CAAI-12). Beijing: Beijing University of Posts and Telecommunications Publishing House, 2007. 283-289.
  • 10Alachaher LN, Guillaume S. Mining negative and positive influence rules using Kullback-Leibler divergence. In: Proc. of the ICCGI 25. 2007. http://www.lw20.com/201007279930812.html.

共引文献12

计算机科学
2013年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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