找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Intelligent Computer Mathematics; 9th International Co Michael Kohlhase,Moa Johansson,Frank Tompa Conference proceedings 2016 Springer Inte

[复制链接]
查看: 18053|回复: 52
发表于 2025-3-21 17:43:07 | 显示全部楼层 |阅读模式
书目名称Intelligent Computer Mathematics
副标题9th International Co
编辑Michael Kohlhase,Moa Johansson,Frank Tompa
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Intelligent Computer Mathematics; 9th International Co Michael Kohlhase,Moa Johansson,Frank Tompa Conference proceedings 2016 Springer Inte
描述This book constitutes the refereed proceedings of the 9th International Conference on Intelligent Computer Mathematics, CICM 2016, held in Bialystok, Poland, in July 2016..The 10 full papers and 2 short papers presented were carefully reviewed and selected.from a total of 41 submissions. The papers are organized in topical sections according to the five tracks of the conference: Calculemus; Digital Mathematics Libraries; Mathematical Knowledge Management; Surveys and Projects; and Systems and Data..
出版日期Conference proceedings 2016
关键词computational logic; computer algebra systems; higher-order logic; model checking; symbolic computation;
版次1
doihttps://doi.org/10.1007/978-3-319-42547-4
isbn_softcover978-3-319-42546-7
isbn_ebook978-3-319-42547-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing Switzerland 2016
The information of publication is updating

书目名称Intelligent Computer Mathematics影响因子(影响力)




书目名称Intelligent Computer Mathematics影响因子(影响力)学科排名




书目名称Intelligent Computer Mathematics网络公开度




书目名称Intelligent Computer Mathematics网络公开度学科排名




书目名称Intelligent Computer Mathematics被引频次




书目名称Intelligent Computer Mathematics被引频次学科排名




书目名称Intelligent Computer Mathematics年度引用




书目名称Intelligent Computer Mathematics年度引用学科排名




书目名称Intelligent Computer Mathematics读者反馈




书目名称Intelligent Computer Mathematics读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:27:41 | 显示全部楼层
Formalization of Bing’s Shrinking Method in Geometric Topologyethod include the generalized Schoenflies theorem, the double suspension theorem for homology spheres, and the 4-dimensional Poincaré conjecture. Homeomorphisms obtained in this method are sometimes counter-intuitive and may even be pathological. This makes Bing’s shrinking method a good target of f
发表于 2025-3-22 01:30:38 | 显示全部楼层
发表于 2025-3-22 06:15:29 | 显示全部楼层
Formalization of Normal Random Variables in HOLsystems within the trusted kernel of a higher-order-logic theorem prover, in this paper, we provide a higher-order-logic formalization of Lebesgue measure and Normal random variables along with the proof of their classical properties. To illustrate the usefulness of our formalization, we present a f
发表于 2025-3-22 10:20:11 | 显示全部楼层
Progress of Self-Archiving Within the DML Corpus, with a View Toward Community Dynamicsform. Important features like full-text formula search are facilitated by the openly available . sources. However, despite the obvious growth of the arXiv corpus, it is not clear what share of the published mathematical literature is already openly accessible in this way, and whether it might eventu
发表于 2025-3-22 14:57:17 | 显示全部楼层
发表于 2025-3-22 18:13:49 | 显示全部楼层
Incorporating Quotation and Evaluation into Church’s Type Theory: Syntax and Semanticsguage. With quotation and evaluation it is possible to reason in . about the interplay of the syntax and semantics of expressions and, as a result, to formalize syntax-based mathematical algorithms. We present the syntax and semantics of . and give several examples that illustrate the usefulness of
发表于 2025-3-22 23:15:33 | 显示全部楼层
Extracting Higher-Order Goals from the Mizar Mathematical Libraryy to obtain higher-order theorem proving problems from Mizar articles that make use of these constructs. In particular, higher-order logic is used to represent schemes, a global choice construct and set level binders. The higher-order automated theorem provers Satallax and LEO-II have been run on co
发表于 2025-3-23 02:52:06 | 显示全部楼层
发表于 2025-3-23 06:00:39 | 显示全部楼层
Formal Dependability Modeling and Analysis: A Surveyonfidentiality, and integrity. Various dependability modeling techniques have been developed to effectively capture the failure characteristics of systems over time. Traditionally, dependability models are analyzed using paper-and-pencil proof methods and computer based simulation tools but their re
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-17 17:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表