Self-evident Automated Geometric Theorem Proving Based on Complex Number Identity

IF 0.9 3区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Journal of Automated Reasoning Pub Date : 2023-11-20 DOI:10.1007/s10817-023-09688-w
Xicheng Peng, Jingzhong Zhang, Mao Chen, Sannyuya Liu
{"title":"Self-evident Automated Geometric Theorem Proving Based on Complex Number Identity","authors":"Xicheng Peng, Jingzhong Zhang, Mao Chen, Sannyuya Liu","doi":"10.1007/s10817-023-09688-w","DOIUrl":null,"url":null,"abstract":"<p>How to automatically generate short and easy-to-understand proofs for geometric theorems has long been an issue of concern in mathematics education. A novel automated geometric theorem proving method based on complex number identities is proposed in this paper, which acts as a bridge between geometry and algebra. According to the proposed method, the geometric relations in the given proposition are first transformed into a complex number expression, then the complex number identity is generated by the elimination method; finally, the closure property under all four operations of real numbers is employed to prove the proposition. A test on more than 300 geometric problems shows that the proposed method is highly effective, and the corresponding proofs are short, with obvious geometric meaning.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"91 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Automated Reasoning","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10817-023-09688-w","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

How to automatically generate short and easy-to-understand proofs for geometric theorems has long been an issue of concern in mathematics education. A novel automated geometric theorem proving method based on complex number identities is proposed in this paper, which acts as a bridge between geometry and algebra. According to the proposed method, the geometric relations in the given proposition are first transformed into a complex number expression, then the complex number identity is generated by the elimination method; finally, the closure property under all four operations of real numbers is employed to prove the proposition. A test on more than 300 geometric problems shows that the proposed method is highly effective, and the corresponding proofs are short, with obvious geometric meaning.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于复数恒等式的自明自动几何定理证明
如何自动生成简短易懂的几何定理证明一直是数学教育中关注的问题。本文提出了一种基于复数恒等式的几何定理自动证明方法,它在几何和代数之间架起了一座桥梁。该方法首先将给定命题中的几何关系转化为复数表达式,然后用消元法生成复数恒等式;最后,利用实数四种运算下的闭包性质证明了该命题。对300多个几何问题的测试表明,该方法是高效的,且相应的证明简短,具有明显的几何意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Automated Reasoning
Journal of Automated Reasoning 工程技术-计算机:人工智能
CiteScore
3.60
自引率
9.10%
发文量
31
审稿时长
>12 weeks
期刊介绍: The Journal of Automated Reasoning is an interdisciplinary journal that maintains a balance between theory, implementation and application. The spectrum of material published ranges from the presentation of a new inference rule with proof of its logical properties to a detailed account of a computer program designed to solve various problems in industry. The main fields covered are automated theorem proving, logic programming, expert systems, program synthesis and validation, artificial intelligence, computational logic, robotics, and various industrial applications. The papers share the common feature of focusing on several aspects of automated reasoning, a field whose objective is the design and implementation of a computer program that serves as an assistant in solving problems and in answering questions that require reasoning. The Journal of Automated Reasoning provides a forum and a means for exchanging information for those interested purely in theory, those interested primarily in implementation, and those interested in specific research and industrial applications.
期刊最新文献
A Formalization of the CHSH Inequality and Tsirelson’s Upper-bound in Isabelle/HOL Formally-Verified Round-Off Error Analysis of Runge–Kutta Methods Formal Verification of Termination Criteria for First-Order Recursive Functions Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification Fragments Self-evident Automated Geometric Theorem Proving Based on Complex Number Identity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1