{"title":"一个genzen系统的描述逻辑","authors":"Yu Sun, Yuefei Sui","doi":"10.1109/ICCSE.2014.6926437","DOIUrl":null,"url":null,"abstract":"The Gentzen systems for a sequent Γ⇒Δ have been proposed in the propositional logic, the predicate calculus and other logics. In this paper, based on the Gentzen system for the predicate calculus, we propose the Gentzen system for a sequent Γ⇒Δ in the description logic, where Γ and Δ are two sets of assertions in ALC: Assertions with universal qualification and inclusion assertions are decomposed as those of universal quantification formulas in the Gentzen system for the predicate calculus. It is proved that the Gentzen system for description logic is sound and complete; but it is not decidable.","PeriodicalId":275003,"journal":{"name":"2014 9th International Conference on Computer Science & Education","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Gentzen system for the description logic\",\"authors\":\"Yu Sun, Yuefei Sui\",\"doi\":\"10.1109/ICCSE.2014.6926437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Gentzen systems for a sequent Γ⇒Δ have been proposed in the propositional logic, the predicate calculus and other logics. In this paper, based on the Gentzen system for the predicate calculus, we propose the Gentzen system for a sequent Γ⇒Δ in the description logic, where Γ and Δ are two sets of assertions in ALC: Assertions with universal qualification and inclusion assertions are decomposed as those of universal quantification formulas in the Gentzen system for the predicate calculus. It is proved that the Gentzen system for description logic is sound and complete; but it is not decidable.\",\"PeriodicalId\":275003,\"journal\":{\"name\":\"2014 9th International Conference on Computer Science & Education\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 9th International Conference on Computer Science & Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE.2014.6926437\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 9th International Conference on Computer Science & Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2014.6926437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Gentzen systems for a sequent Γ⇒Δ have been proposed in the propositional logic, the predicate calculus and other logics. In this paper, based on the Gentzen system for the predicate calculus, we propose the Gentzen system for a sequent Γ⇒Δ in the description logic, where Γ and Δ are two sets of assertions in ALC: Assertions with universal qualification and inclusion assertions are decomposed as those of universal quantification formulas in the Gentzen system for the predicate calculus. It is proved that the Gentzen system for description logic is sound and complete; but it is not decidable.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
