Intelligent Computer Mathematics : 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-11, 2025, Proceedings (Lecture Notes in Artificial Intelligence)

個数：

予約

Intelligent Computer Mathematics : 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-11, 2025, Proceedings (Lecture Notes in Artificial Intelligence)

de Paiva, Valeria (EDT)/ Koepke, Peter (EDT)

ウェブストア価格 ¥29,367（本体¥26,698）
Springer Nature Switzerland AG（2025/11発売）
外貨定価 US$ 139.99
ポイント 266pt

現在予約受付中です。出版後の入荷・発送となります。
（重要：表示されている発売日は予定となり、発売が延期、中止、生産限定品で商品確保ができないなどの理由により、ご注文をお取消しさせていただく場合がございます。予めご了承ください。）

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 413 p.
言語 ENG
商品コード 9783032070203

Full Description

This book constitutes the refereed proceedings of the 18th International Conference on Intelligent Computer Mathematics, CICM 2025, held in Brasilia, Brazil, during October 6-11, 2025.

The 24 full papers were presented in this volume were carefully reviewed and selected from 34 submissions. They were organized in the following topical sections as follows : Automated Reasoning; Formal Libraries; Logical and Linguistic Foundations; Mathematical Knowledge Management; Neural Language Models; and Proof Assistants and Formalizations.

.- Automated Reasoning.

.- Hammering Higher Order Set Theory.

.- Synthesis Benchmarks for Automated Reasoning.

.- Automated Symmetric Constructions in Discrete Geometry.

.- Formal Libraries.

.- Growing Mathlib: Maintenance of a Large Scale Mathematical Library.

.- Exploring Formal Math on the Blockchain: An Explorer for Proofgold.

.- Supporting Maintenance of Formal Mathematics with Similarity Search.

.- Logical and Linguistic Foundations.

.- Graded Quantitative Narrowing.

.- Equational Generalization Problems with Atom-Variables.

.- Extending Flexible Boolean Semantics for the Language of Mathematics.

.- A Formal Definition of an Algorithm Suitable for Parsing the Language of Mathematics.

.- Mathematical Knowledge Management.

.- Reaping the Benefits of Modularization in Flexiformal Mathematics by GFbased AST Transformations.

.- Semantic Authoring in a Flexiformal Context — Bulk Annotation of Rigorous Documents.

.- Michael Kohlhase and Jan Frederik Schaefer Lightweight Realms.

.- Indexing and Retrieval in a Heterogeneous Formal Library.

.- Neural Language Models.

.- Exploring Proof Autoformalization with Mistral on Herald.

.- Boosting Math Problem Solving in Small LLMs via Ensembles.

.- Proof Assistants and Formalizations.

.- Formalizing a Classification Theorem for Low-Dimensional Solvable Lie Algebras in Lean.

.- Certified Algorithms for Numerical Semigroups in Rocq.

.- Formalizing the Solow Model in Naproche.

.- Formalizing MLTL Formula Progression in Isabelle/HOL.

.- Formalising Fairness in the Assignment Problem with Ordinal Preferences in Isabelle/HOL.

.- A PVS Library on the Infinitude of Primes.

.- Vector Graphics through Category Theory.

.- A Lean-Based Language for Teaching Proof in High School.