{"title":"将foll理论转化为sroiq - tbox","authors":"Fatima Danash, D. Ziébelin","doi":"10.1145/3555776.3577870","DOIUrl":null,"url":null,"abstract":"Logical languages provide rigid formalisms for theories with varying expressive and scalable powers. In ontology engineering, it is popular to to provide a two-folded formalization of a theory; an expressive FOL formalization, and a decidable SROIQ fragment. Such a task requires a systematic and principled translation of the set of FOL formulas to achieve a maximally expressive decidable fragment. While no principled work exists for providing guidelines for the translation of FOL theories into SROIQ knowledge bases, this paper contributes with such a translation procedure.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Translating FOL-theories into SROIQ-Tboxes\",\"authors\":\"Fatima Danash, D. Ziébelin\",\"doi\":\"10.1145/3555776.3577870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Logical languages provide rigid formalisms for theories with varying expressive and scalable powers. In ontology engineering, it is popular to to provide a two-folded formalization of a theory; an expressive FOL formalization, and a decidable SROIQ fragment. Such a task requires a systematic and principled translation of the set of FOL formulas to achieve a maximally expressive decidable fragment. While no principled work exists for providing guidelines for the translation of FOL theories into SROIQ knowledge bases, this paper contributes with such a translation procedure.\",\"PeriodicalId\":42971,\"journal\":{\"name\":\"Applied Computing Review\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Computing Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3555776.3577870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Computing Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3555776.3577870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Logical languages provide rigid formalisms for theories with varying expressive and scalable powers. In ontology engineering, it is popular to to provide a two-folded formalization of a theory; an expressive FOL formalization, and a decidable SROIQ fragment. Such a task requires a systematic and principled translation of the set of FOL formulas to achieve a maximally expressive decidable fragment. While no principled work exists for providing guidelines for the translation of FOL theories into SROIQ knowledge bases, this paper contributes with such a translation procedure.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
