计算机科学 ›› 2020, Vol. 47 ›› Issue (11A): 92-96.doi: 10.11896/jsjkx.200300188

• 人工智能 • 上一篇    下一篇

循环描述逻辑系统FL0最大不动点模型的有穷基

郑添健1, 侯金宏2, 张维3, 王驹4   

  1. 1 黔南民族师范学院计算机与信息学院 贵州 都匀 558000
    2 南宁上林县第一中学 南宁 530500
    3 黔南民族师范学院数学与统计学院 贵州 都匀 558000
    4 广西师范大学计算机科学与信息工程学院 广西 桂林 541004
  • 出版日期:2020-11-15 发布日期:2020-11-17
  • 通讯作者: 郑添健(ztjpsc@163.com)
  • 基金资助:
    贵州省教育厅自然科学基金项目(黔教科20090047);贵州省科学技术基金资助项目(黔科合J字[2012]2310);黔南民族师范学院一般项目(qnsy2018023)

Finite Basis of Implicational System Associated with Finite Models of Description Logic FL0 Under the Greatest Fixed Point Semantics

ZHENG Tian-jian1, HOU Jin-hong2, ZHANG Wei3, WANG Ju4   

  1. 1 School of Computer and Information,Qiannan Normal University for Nationalities,Duyun,Guizhou 558000,China
    2 The NO.1 High Middle School of Shanglin Coutry,Nanning 530500,China
    3 School of Mathematics and Statistics,Qiannan Normal University for Nationalities,Duyun,Guizhou 558000,China
    4 School of Computer Science and Information Engineering,Guangxi Normal University,Guilin,Guangxi 541004,China
  • Online:2020-11-15 Published:2020-11-17
  • About author:ZHENG Tian-jian,born in 1976,associate professor,is a member of China Computer Federation.His main research interests include computer network,database theory and mathematical logic.
  • Supported by:
    This work was supported by the Natural Science Foundation of Guizhou Education Department(20090047),Science and Technology Foundation of Guizhou Province([2012]2310) and Natural Science Foundation of Qiannan Normal University for Nationalities(qnsy2018023).

摘要: 描述逻辑和形式概念格都是以概念为基础的形式系统,它们都有各自的优缺点,近年来人们开始将两者结合起来,取长补短。文中将形式概念分析的方法引入描述逻辑,研究了循环描述逻辑系统FL0在最大不动点语义下有限模型的有穷基。在形式概念分析中,属性有限的形式背景都存在Duguenne-Guigues基,文章将循环FL0的最大不动点模型作为描述背景,将FL0概念作为属性,定义了描述背景下的属性蕴含,证明了循环描述逻辑系统FL0的最大不动点模型也存在有穷基底。

关键词: 描述逻辑, 形式概念分析, 有穷基, 属性探测

Abstract: Description logic and formal concept analysis are two different formalisms based on concept,each has its own advantages and disadvantages.Researchers begin to combine them together recently.In this paper,methods of formal concept analysis are introduced into research in description logic to analyze the finite basis of finite models of FL0 under greatest fixed point semantics.In formal concept analysis,there always exists the Duguenne-Guigues basis as long as the attribute set is finite.The finite model of cyclic FL0 terminology under greatest fixed point semantics is taken as description context,FL0 concept as attribute and implications are defined in this context.It is proved that there exists a finite basis of the finite model,which is also sound and completed.

Key words: Attribute exploration algorithm, Description logic, Finite basis, Formal concept analysis

中图分类号: 

  • TP181
[1] BAADER F,NUTT W.Basic Description Logics[M]//The Description Logic Handbook:Theory,Implementation and Applications.Cambridge:Cambridge University Press,2003:47-100.
[2] SHI Z Z,DONG M K,JIANG Y C,et al.Logical basis of Semantic Web [J].Chinese Science Series E:Information Science,2004,34(10):1123-1138.
[3] JIANG Y C,TANG Y,WANG J,et al.Description logic for Semantic Web [J].Pattern recognition and artificial intelligence,2007,20(1):48-54.
[4] FBAADER,HORROCKS I,SATTLER U.Description Logics[M]//Handbook on Ontologies:International Handbooks on Information Systems.Springer,2004:3-28.
[5] ABORGIDA,LENZERINI M,RROSATI M.Description Logics for Data Bases[M]//The Description Logic Handbook:Theory,Implementation and Applications.Cambridge:Cambridge University Press,2003:472-494.
[6] JIANG Y C,TANG Y,WANG J,et al.ER model with attribute dependent timing based on description logic [J].Computer Research and Development,2007,44(10):1765-1773.
[7] DBERARDI,DCALVANESE,GIACOMO D.Reasoning onUML Class Diagrams[J].Artificial Intelligence,2005,168(1/2):70-118.
[8] PREDIGER S,STUMME G.Theory-driven logical scaling:Conceptual information systems meet description logics[C]//Proceeding of the 6th International Workshop on Knowledge Representationmeets Databases (KRDB'99).1999:14-21.
[9] ROUANE M H,HUCHARD,NAPOLI A,et al.A Proposal for Combining Formal Concept Analysis and DescriptionLogics for Mining Relational Data[C]//Proceedings of the 5th International Conference on Formal Concept Analysis(ICFCA 2007).Springer-Verlag,2007:14-22.
[10] BAADER F.Computing a Minimal Representation of the Subsumption Lattice of all Conjunctions of Concepts Defined in a Terminology[C]//Knowledge Retrieval,Use and Storage for Efficiency:Proceedings of the 1st International KRUSE Symposium,1955:168-178.
[11] STUMME G.The Concept Classification of a Terminology Extended by Conjunction and Disjunction[C]//Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence (PRICAI'96).Springer-Verlag,1996:121-131.
[12] BAADER F,MOLITOR R.Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis[C]//Proceedings of the 8th International Conference on Conceptual Structures (ICCS 2000).Springer-Verlag,2000:292-305.
[13] RUDOLPH S.Relational exploration:Combining DescriptionLogics and Formal Concept Analysis for knowledge specification[D].dissertation,Fakultät Mathematik und Naturwissenschaften,TU Dresden,Germany,2006.
[14] BAADER F.A finite basis for the set of EL-implications holding in a finite model[C]//Proceedings of the 6th International Conference on Formal Concept Analysis(ICFCA 2008).Berlin:Springer,2008:46-61.
[15] TANG S Q,CAI Z X,WANG J,et al.The finite basis of the description logic system FLε based on the maximum fixed point model [J].Computer Research and Development,2010(9):1514-1521.
[16] NEBEL B.Terminological cycles:Semantics and computational properties[M].SanFrancisco:Morgan Kaufmann Publishers,1991:331362.
[17] BAADER F.Using automata theory for characterizing the se-mantics of terminological cycles[C]//Annals of Mathematics and ArtificialIntelligence.1996:175-219.
[18] GANTER B,WILLE R,FRANZKE C.Formal concept analysis:mathematical foundations[M].Springer-Verlag New York,Inc.,1997.
[19] FELIX D.Model-based Most Specific Concepts in DescriptionLogics with Value Restrictions[R].Institute for Theoretical Computer Science,Dresden,Germany,2008.
[20] KÜSTERS R.Characterizing the semantics of terminological cycles in ALN using finite automata[C]//Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning(KR'98).1998.
[1] 刘忠慧, 赵琦, 邹璐, 闵帆.
三元概念的启发式构建及其在社会化推荐中的应用
Heuristic Construction of Triadic Concept and Its Application in Social Recommendation
计算机科学, 2021, 48(6): 234-240. https://doi.org/10.11896/jsjkx.200500136
[2] 沈夏炯, 杨继勇, 张磊.
基于不相关属性集合的属性探索算法
Attribute Exploration Algorithm Based on Unrelated Attribute Set
计算机科学, 2021, 48(4): 54-62. https://doi.org/10.11896/jsjkx.200800082
[3] 张力生, 张悦, 雷大江.
基于语义的特征模型重构方法
Feature Model Refactoring Method Based on Semantics
计算机科学, 2019, 46(5): 135-142. https://doi.org/10.11896/j.issn.1002-137X.2019.05.021
[4] 周超, 任志宇, 毋文超.
基于形式概念分析的语义角色挖掘算法
Semantic Roles Mining Algorithms Based on Formal Concept Analysis
计算机科学, 2018, 45(12): 117-122. https://doi.org/10.11896/j.issn.1002-137X.2018.12.018
[5] 姜玉婷, 秦克云.
决策形式背景面向属性与面向对象的决策规则
Property-oriented and Object-oriented Decision Rules in Decision Formal Contexts
计算机科学, 2018, 45(10): 33-36. https://doi.org/10.11896/j.issn.1002-137X.2018.10.006
[6] 王勇红,申宇铭,聂登国,王驹.
描述逻辑εL循环术语集的保守扩充
Conservative Extension in Description Logic εL with Cyclic Terminologies
计算机科学, 2017, 44(Z11): 136-140. https://doi.org/10.11896/j.issn.1002-137X.2017.11A.028
[7] 尚颖,程克,李征.
基于形式概念分析的依赖簇检测方法研究
Research on FCA Based Dependence Cluster Detection
计算机科学, 2017, 44(4): 144-147. https://doi.org/10.11896/j.issn.1002-137X.2017.04.031
[8] 聂登国,余泉,张维,申宇铭.
描述逻辑εVL的保守扩充
Conservative Extensions in Description Logic εVL
计算机科学, 2016, 43(Z6): 83-86. https://doi.org/10.11896/j.issn.1002-137X.2016.6A.019
[9] 陈晖,马亚平.
面向不确定性知识表示的描述逻辑SROIQ(D)不确定性扩展
Uncertain Extension of Description Logic SROIQ(D) for Uncertain Knowledge Representation
计算机科学, 2016, 43(Z11): 88-92. https://doi.org/10.11896/j.issn.1002-137X.2016.11A.019
[10] 王春月,王黎明,张卓.
基于二元关系消减的概念格维护算法
Algorithm of Maintaining Concept Lattice Based on Binary Relation Decrement
计算机科学, 2016, 43(Z11): 35-41. https://doi.org/10.11896/j.issn.1002-137X.2016.11A.008
[11] 闫之焕,雷银彬.
改进的粗糙描述逻辑框架
Extended Rough Description Logic
计算机科学, 2016, 43(5): 214-218. https://doi.org/10.11896/j.issn.1002-137X.2016.05.039
[12] 张玉利,常亮,孟瑜,古天龙.
基于描述逻辑的传感器网络事件检测
Event Detection in Sensor Network Based on Description Logic
计算机科学, 2016, 43(12): 269-272. https://doi.org/10.11896/j.issn.1002-137X.2016.12.049
[13] 张慧雯,刘文奇,李金海.
不完备形式背景下近似概念格的公理化方法
Axiomatic Characterizations of Approximate Concept Lattices in Incomplete Contexts
计算机科学, 2015, 42(6): 67-70. https://doi.org/10.11896/j.issn.1002-137X.2015.06.015
[14] 徐德智,廖晖寰,徐连君.
面向模块重用的描述逻辑SHJF本地性规则研究
Research on Locality Rules of Description Logic SHJF for Module Reusing
计算机科学, 2015, 42(1): 249-252. https://doi.org/10.11896/j.issn.1002-137X.2015.01.055
[15] 蒋菲,古天龙,徐周波,常亮.
基于CBR和描述逻辑的网络安全应急响应
Network Security Emergency Response Based on CBR and Description Logic
计算机科学, 2015, 42(1): 129-136. https://doi.org/10.11896/j.issn.1002-137X.2015.01.031
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!