Mathematics by machine

DOI10.1145/2608628.2627488zbMath1325.68212OpenAlexW1988004808MaRDI QIDQ3452371

Hidenao Iwane, Hirokazu Anai, Noriko H. Arai, Takuya Matsuzaki

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2627488

zbMATH Keywords

quantifier eliminationnatural language processingmathematical logic

Mathematics Subject Classification ID

Related Items (5)

Discovering Geometric Theorems from Scanned and Photographed Images of Diagrams ⋮ Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings ⋮ Using machine learning to improve cylindrical algebraic decomposition ⋮ $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation ⋮ On multivariate Hermitian quadratic forms

Uses Software

• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematics by machine