Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?
From MaRDI portal
Publication:6157640
DOI10.1007/s11786-022-00532-9MaRDI QIDQ6157640
Zoltán Kovács, Tomás Recio, Robert Vajda, Christopher W. Brown, M. Pilar Vélez
Publication date: 22 June 2023
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Tarskicomputer algebraautomated theorem provingGeoGebraautomated discoveryreal quantifier eliminationQEPCAD B
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick
- Real quantifier elimination is doubly exponential
- Partial cylindrical algebraic decomposition for quantifier elimination
- A new approach for automatic theorem proving in real geometry
- Polynomial constraints and unsat cores in \textsc{Tarski}
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Automatic discovery of theorems in elementary geometry
- Detecting truth, just on parts
- SyNRAC: A Toolbox for Solving Real Algebraic Constraints
- Computational Science and Its Applications – ICCSA 2004
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
This page was built for publication: Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?
