Automated reducible geometric theorem proving and discovery by Gröbner basis method
From MaRDI portal
Publication:1701040
DOI10.1007/s10817-016-9395-zzbMath1425.68383OpenAlexW2551115919MaRDI QIDQ1701040
Yao Sun, Jie Zhou, Ding-Kang Wang
Publication date: 22 February 2018
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-016-9395-z
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Detecting truth, just on parts ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick
Uses Software
Cites Work
- Gröbner bases for polynomial systems with parameters
- On protocols for the automated discovery of theorems in elementary geometry
- Minimal canonical comprehensive Gröbner systems
- On the application of Buchberger's algorithm to automated geometry theorem proving
- Proving geometry theorems with rewrite rules
- Basic principles of mechanical theorem proving in elementary geometries
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Automatic discovery of theorems in elementary geometry
- An alternative approach to comprehensive Gröbner bases
- Canonical comprehensive Gröbner bases
- A new decision method for elementary algebra
- A new algorithm for computing comprehensive Gröbner systems
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Automated Deduction in Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automated reducible geometric theorem proving and discovery by Gröbner basis method