{"title":"基于NBox的OWL2闭世界推理","authors":"Ren Yuan, Pan Jeff Z., Zhao Yuting","doi":"10.1016/S1007-0214(10)70117-6","DOIUrl":null,"url":null,"abstract":"<div><p>This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(10)70117-6","citationCount":"27","resultStr":"{\"title\":\"Closed World Reasoning for OWL2 with NBox\",\"authors\":\"Ren Yuan, Pan Jeff Z., Zhao Yuting\",\"doi\":\"10.1016/S1007-0214(10)70117-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.</p></div>\",\"PeriodicalId\":60306,\"journal\":{\"name\":\"Tsinghua Science and Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.2000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1007-0214(10)70117-6\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tsinghua Science and Technology\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1007021410701176\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1007021410701176","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
