文件名称:PhDPropsversion4
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:614.99kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
PhD Proposals Automated theorem proving (ATP) in geometry has two major lines of research:
axiomatic proof style and algebraic proof style (see [6], for instance, for a survey).
Algebraic proof style methods are based on reducing geometry properties to algebraic
properties expressed in terms of Cartesian coordinates. These methods are usually very
efficient, but the proofs they produce do not reflect the geometry nature of the problem
and they give only a yes/no conclusion. Axiomatic methods attempt to automate
traditional geometry proof methods that produce human-readable proofs. Building on
top of the existing ATPs (namely GCLCprover [5, 4, 8, 9, 10] to the area method [1, 2, 3,
7, 8, 11] or ATPs dealing with construction [6] the goal is to built an ATP capable of
producing human-readable proofs, with a clean connection between the geometric
conjectures and theirs proofs.
axiomatic proof style and algebraic proof style (see [6], for instance, for a survey).
Algebraic proof style methods are based on reducing geometry properties to algebraic
properties expressed in terms of Cartesian coordinates. These methods are usually very
efficient, but the proofs they produce do not reflect the geometry nature of the problem
and they give only a yes/no conclusion. Axiomatic methods attempt to automate
traditional geometry proof methods that produce human-readable proofs. Building on
top of the existing ATPs (namely GCLCprover [5, 4, 8, 9, 10] to the area method [1, 2, 3,
7, 8, 11] or ATPs dealing with construction [6] the goal is to built an ATP capable of
producing human-readable proofs, with a clean connection between the geometric
conjectures and theirs proofs.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
PhDPropsversion4.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
