Juan Pablo Munoz Toriz, I. M. Ruiz, José Ramón Enrique Arrazola-Ramírez
{"title":"用ML自动证明定理","authors":"Juan Pablo Munoz Toriz, I. M. Ruiz, José Ramón Enrique Arrazola-Ramírez","doi":"10.1109/MICAI.2014.42","DOIUrl":null,"url":null,"abstract":"In this paper, we describe the development of a series of automatic theorem provers for a variety of logics. Provers are developed from a functional approach. The first prover is for Classical Propositional Calculus (CPC), which is based on a constructive proof of Kalmar's Theorem. We also provide the implementation of a cut and contraction free sequent calculus for Intuitionistic Propositional Logic (IPC). Next, it is introduced a prover for ALCS4, which is the description logic ALC with transitive and reflexive roles only. This prover is also based on a cut and contraction free sequent calculus. We also provide a complexity analysis for each prover.","PeriodicalId":189896,"journal":{"name":"2014 13th Mexican International Conference on Artificial Intelligence","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On Automatic Theorem Proving with ML\",\"authors\":\"Juan Pablo Munoz Toriz, I. M. Ruiz, José Ramón Enrique Arrazola-Ramírez\",\"doi\":\"10.1109/MICAI.2014.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we describe the development of a series of automatic theorem provers for a variety of logics. Provers are developed from a functional approach. The first prover is for Classical Propositional Calculus (CPC), which is based on a constructive proof of Kalmar's Theorem. We also provide the implementation of a cut and contraction free sequent calculus for Intuitionistic Propositional Logic (IPC). Next, it is introduced a prover for ALCS4, which is the description logic ALC with transitive and reflexive roles only. This prover is also based on a cut and contraction free sequent calculus. We also provide a complexity analysis for each prover.\",\"PeriodicalId\":189896,\"journal\":{\"name\":\"2014 13th Mexican International Conference on Artificial Intelligence\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 13th Mexican International Conference on Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MICAI.2014.42\",\"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 13th Mexican International Conference on Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MICAI.2014.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we describe the development of a series of automatic theorem provers for a variety of logics. Provers are developed from a functional approach. The first prover is for Classical Propositional Calculus (CPC), which is based on a constructive proof of Kalmar's Theorem. We also provide the implementation of a cut and contraction free sequent calculus for Intuitionistic Propositional Logic (IPC). Next, it is introduced a prover for ALCS4, which is the description logic ALC with transitive and reflexive roles only. This prover is also based on a cut and contraction free sequent calculus. We also provide a complexity analysis for each prover.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
