转换到描述逻辑的自动定理证明

Negin Arhami, G. Sutcliffe
{"title":"转换到描述逻辑的自动定理证明","authors":"Negin Arhami, G. Sutcliffe","doi":"10.29007/xgq9","DOIUrl":null,"url":null,"abstract":"of a dissertation at the University of Miami. Thesis supervised by Professor Geoff Suttcliffe. No. of pages in text. (132) Many Automated Theorem Proving (ATP) systems for different logical forms, and translators for translating different logical forms from one to another, have been developed and are now available. Some logical forms are more expressive than others, and it is easier to express problems in those logical forms. On the other hand, the ATP systems for less expressive forms have benefited from more years of development and testing. There is a trade-off between the expressivity of a logical form, and the capabilities of the available ATP systems. Different ATP systems and translators can be combined to solve a problem expressed in a given logical form. In this research, an experiment has been designed and carried out to compare all different possible ways of trying to solve a problem, using the following logical forms in increasing order of expressivity: Propositional Logic, Description Logic, Effectively Propositional form, Conjunctive Normal Form, First Order Form, Typed First order form-monomorphic, Typed First order form-polymorphic, Typed Higher order form-monomorphic. In this dissertation, the properties, syntax, and semantics of each target logical form are briefly described. For each form, the most popular ATP systems and translators for translating to less expressive forms are introduced. Problems in logics more expressive than Conjunctive Normal Form can be translated directly to Conjunctive Normal Form, or indirectly by translation via intermediate logics. No translator was available to translate from Conjunctive Normal Form to Description Logic, which sits between Effectively Propositional form and Propositional Logic in terms of expressivity. Saffron a Conjunctive Normal Form to Description Logic translator, has been developed, which fills the gap between Conjunctive Normal Form and Description Logic. Moreover, Description Logic Form (DLF), a new syntax for Description Logic, has been designed. Automated theorem proving by translation to Description Logic is now an alternative way of solving problems expressed in logics more expressive than Description Logic, by combining necessary translators from those logics to Conjunctive Normal Form, Saffron, and a Description Logic ATP system. For My Family, My Strength, My Backbone, and My Role Models: Ahmad Arhami, Masomeh Parchamdar, Dr. Ashkon Arhami, Dr. Ehsan Arhami, and Moeindokht Arhami","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Automated Theorem Proving by Translation to Description Logic\",\"authors\":\"Negin Arhami, G. Sutcliffe\",\"doi\":\"10.29007/xgq9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"of a dissertation at the University of Miami. Thesis supervised by Professor Geoff Suttcliffe. No. of pages in text. (132) Many Automated Theorem Proving (ATP) systems for different logical forms, and translators for translating different logical forms from one to another, have been developed and are now available. Some logical forms are more expressive than others, and it is easier to express problems in those logical forms. On the other hand, the ATP systems for less expressive forms have benefited from more years of development and testing. There is a trade-off between the expressivity of a logical form, and the capabilities of the available ATP systems. Different ATP systems and translators can be combined to solve a problem expressed in a given logical form. In this research, an experiment has been designed and carried out to compare all different possible ways of trying to solve a problem, using the following logical forms in increasing order of expressivity: Propositional Logic, Description Logic, Effectively Propositional form, Conjunctive Normal Form, First Order Form, Typed First order form-monomorphic, Typed First order form-polymorphic, Typed Higher order form-monomorphic. In this dissertation, the properties, syntax, and semantics of each target logical form are briefly described. For each form, the most popular ATP systems and translators for translating to less expressive forms are introduced. Problems in logics more expressive than Conjunctive Normal Form can be translated directly to Conjunctive Normal Form, or indirectly by translation via intermediate logics. No translator was available to translate from Conjunctive Normal Form to Description Logic, which sits between Effectively Propositional form and Propositional Logic in terms of expressivity. Saffron a Conjunctive Normal Form to Description Logic translator, has been developed, which fills the gap between Conjunctive Normal Form and Description Logic. Moreover, Description Logic Form (DLF), a new syntax for Description Logic, has been designed. Automated theorem proving by translation to Description Logic is now an alternative way of solving problems expressed in logics more expressive than Description Logic, by combining necessary translators from those logics to Conjunctive Normal Form, Saffron, and a Description Logic ATP system. For My Family, My Strength, My Backbone, and My Role Models: Ahmad Arhami, Masomeh Parchamdar, Dr. Ashkon Arhami, Dr. Ehsan Arhami, and Moeindokht Arhami\",\"PeriodicalId\":207621,\"journal\":{\"name\":\"Logic Programming and Automated Reasoning\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic Programming and Automated Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29007/xgq9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic Programming and Automated Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/xgq9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在迈阿密大学的一篇论文中论文由Geoff Suttcliffe教授指导。不。文本中的页数。(132)许多用于不同逻辑形式的自动定理证明(ATP)系统,以及用于将不同逻辑形式从一种转换为另一种的翻译器,已经开发出来,现在已经可用。有些逻辑形式比其他形式更具表现力,用这些逻辑形式表达问题更容易。另一方面,用于表达能力较差的形式的ATP系统已经从多年的开发和测试中受益。在逻辑形式的表现力和可用的ATP系统的能力之间存在权衡。不同的ATP系统和翻译器可以结合起来解决以给定逻辑形式表达的问题。在本研究中,我们设计并实施了一个实验,以比较所有不同的解决问题的可能方法,使用以下逻辑形式,按照表达能力的递增顺序:命题逻辑、描述逻辑、有效命题形式、连接范式、一阶形式、类型化一阶形式-单态、类型化一阶形式-多态、类型化高阶形式-单态。本文对每个目标逻辑形式的属性、语法和语义进行了简要描述。对于每种形式,介绍了最流行的ATP系统和翻译较不具表现力的形式的翻译器。比合取范式更具表现力的逻辑问题可以直接转化为合取范式,也可以通过中间逻辑间接转化。没有译者可以将合取范式翻译成描述逻辑,描述逻辑在表达能力上介于有效命题形式和命题逻辑之间。Saffron是连接范式到描述逻辑的翻译器,它填补了连接范式和描述逻辑之间的空白。此外,还设计了一种新的描述逻辑语法——描述逻辑形式(DLF)。通过转换到描述逻辑的自动定理证明现在是解决比描述逻辑更有表现力的逻辑表达问题的另一种方法,通过将这些逻辑组合到合取范式,Saffron和描述逻辑ATP系统的必要转换。为了我的家庭,我的力量,我的脊梁和我的榜样:Ahmad Arhami, Masomeh Parchamdar, Ashkon Arhami医生,Ehsan Arhami医生和Moeindokht Arhami
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Automated Theorem Proving by Translation to Description Logic
of a dissertation at the University of Miami. Thesis supervised by Professor Geoff Suttcliffe. No. of pages in text. (132) Many Automated Theorem Proving (ATP) systems for different logical forms, and translators for translating different logical forms from one to another, have been developed and are now available. Some logical forms are more expressive than others, and it is easier to express problems in those logical forms. On the other hand, the ATP systems for less expressive forms have benefited from more years of development and testing. There is a trade-off between the expressivity of a logical form, and the capabilities of the available ATP systems. Different ATP systems and translators can be combined to solve a problem expressed in a given logical form. In this research, an experiment has been designed and carried out to compare all different possible ways of trying to solve a problem, using the following logical forms in increasing order of expressivity: Propositional Logic, Description Logic, Effectively Propositional form, Conjunctive Normal Form, First Order Form, Typed First order form-monomorphic, Typed First order form-polymorphic, Typed Higher order form-monomorphic. In this dissertation, the properties, syntax, and semantics of each target logical form are briefly described. For each form, the most popular ATP systems and translators for translating to less expressive forms are introduced. Problems in logics more expressive than Conjunctive Normal Form can be translated directly to Conjunctive Normal Form, or indirectly by translation via intermediate logics. No translator was available to translate from Conjunctive Normal Form to Description Logic, which sits between Effectively Propositional form and Propositional Logic in terms of expressivity. Saffron a Conjunctive Normal Form to Description Logic translator, has been developed, which fills the gap between Conjunctive Normal Form and Description Logic. Moreover, Description Logic Form (DLF), a new syntax for Description Logic, has been designed. Automated theorem proving by translation to Description Logic is now an alternative way of solving problems expressed in logics more expressive than Description Logic, by combining necessary translators from those logics to Conjunctive Normal Form, Saffron, and a Description Logic ATP system. For My Family, My Strength, My Backbone, and My Role Models: Ahmad Arhami, Masomeh Parchamdar, Dr. Ashkon Arhami, Dr. Ehsan Arhami, and Moeindokht Arhami
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信