Computer Science

Computer Science ›› 2020, Vol. 47 ›› Issue (11A): 92-96.doi: 10.11896/jsjkx.200300188

• Artificial Intelligence • Previous Articles     Next Articles

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).

PDF (PC)

572

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

CLC Number: 

  • 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] LIU Zhong-hui, ZHAO Qi, ZOU Lu, MIN Fan. Heuristic Construction of Triadic Concept and Its Application in Social Recommendation [J]. Computer Science, 2021, 48(6): 234-240.
[2] SHEN Xia-jiong, YANG Ji-yong, ZHANG Lei. Attribute Exploration Algorithm Based on Unrelated Attribute Set [J]. Computer Science, 2021, 48(4): 54-62.
[3] ZHANG Li-sheng, ZHANG Yue, LEI Da-jiang,. Feature Model Refactoring Method Based on Semantics [J]. Computer Science, 2019, 46(5): 135-142.
[4] ZHOU Chao, REN Zhi-yu, WU Wen-chao. Semantic Roles Mining Algorithms Based on Formal Concept Analysis [J]. Computer Science, 2018, 45(12): 117-122.
[5] JIANG Yu-ting, QIN Ke-yun. Property-oriented and Object-oriented Decision Rules in Decision Formal Contexts [J]. Computer Science, 2018, 45(10): 33-36.
[6] WANG Yong-hong, SHEN Yu-ming, NIE Deng-guo and WANG Ju. Conservative Extension in Description Logic εL with Cyclic Terminologies [J]. Computer Science, 2017, 44(Z11): 136-140.
[7] SHANG Ying, CHENG Ke and LI Zheng. Research on FCA Based Dependence Cluster Detection [J]. Computer Science, 2017, 44(4): 144-147.
[8] NIE Deng-guo, YU Quan, ZHANG Wei and SHEN Yu-ming. Conservative Extensions in Description Logic εVL [J]. Computer Science, 2016, 43(Z6): 83-86.
[9] CHEN Hui and MA Ya-ping. Uncertain Extension of Description Logic SROIQ(D) for Uncertain Knowledge Representation [J]. Computer Science, 2016, 43(Z11): 88-92.
[10] WANG Chun-yue, WANG Li-ming and ZHANG Zhuo. Algorithm of Maintaining Concept Lattice Based on Binary Relation Decrement [J]. Computer Science, 2016, 43(Z11): 35-41.
[11] YAN Zhi-huan and LEI Yin-bin. Extended Rough Description Logic [J]. Computer Science, 2016, 43(5): 214-218.
[12] ZHANG Yu-li, CHANG Liang, MENG Yu and GU Tian-long. Event Detection in Sensor Network Based on Description Logic [J]. Computer Science, 2016, 43(12): 269-272.
[13] ZHANG Hui-wen, LIU Wen-qi and LI Jin-hai. Axiomatic Characterizations of Approximate Concept Lattices in Incomplete Contexts [J]. Computer Science, 2015, 42(6): 67-70.
[14] XU De-zhi, LIAO Hui-huan and XU Lian-jun. Research on Locality Rules of Description Logic SHJF for Module Reusing [J]. Computer Science, 2015, 42(1): 249-252.
[15] JIANG Fei, GU Tian-long, XU Zhou-bo and CHANG Liang. Network Security Emergency Response Based on CBR and Description Logic [J]. Computer Science, 2015, 42(1): 129-136.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.