Basic principles of mechanical theorem proving in elementary geometries

From MaRDI portal
Revision as of 02:37, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1101257

DOI10.1007/BF02328447zbMath0642.68163MaRDI QIDQ1101257

Wen-tsün Wu

Publication date: 1986

Published in: Journal of Automated Reasoning (Search for Journal in Brave)




Related Items

Higher-order logic formalization of conformal geometric algebra and its application in verifying a robotic manipulation algorithmChordality Preserving Incremental Triangular Decomposition and Its ImplementationAn algorithm for solving singular perturbation problems with mechanizationThe computer searches for Pascal conicsSymmetry reductions, exact solutions, and conservation laws of the generalized Zakharov equationsCan one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometriesThe LaSalle's invariant sets for a class of Lotka-Volterra prey-predator chain systemsA New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key RecoveryComputing final polynomials and final syzygies using Buchberger's Gröbner bases methodDeriving some new conditions on the existence of eight limit cycles for a cubic systemA bibliography of quantifier elimination for real closed fieldsGeneralizing Morley's and other theorems with automated realizationOrdering in mechanical geometry theorem proving\textit{Theorema}: Towards computer-aided mathematical theory explorationPolynomials root-finding using a SLEFE-based clipping methodWu's method and its application to perspective viewingWu's characteristic set method for SystemVerilog assertions verificationAn efficient algorithm for factoring polynomials over algebraic extension fieldComputer aided proof for the global stability of Lotka-Volterra systemsA refutational approach to geometry theorem provingA recursive algorithm for constructing complicated Dixon matricesThe dimension method in elementary and differential geometryA category of geometric spaces: Some computational aspectsA quantifier-elimination based heuristic for automatically generating inductive assertions for programsAutomatic deduction in (dynamic) geometry: Loci computationA strategy for speeding-up the computation of characteristic setsA Direttissimo Algorithm for Equidimensional DecompositionAnalyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zerosBifurcation analysis and complex dynamics of a Kopel triopoly modelA signature-based algorithm for computing the nondegenerate locus of a polynomial systemCharacteristic set algorithms for equation solving in finite fieldsDecomposing polynomial sets into simple sets over finite fields: the zero-dimensional caseAutomated discovery of angle theoremsA program to create new geometry proof problemsMorley's theorem revisited: origami construction and automated proofAutomated reducible geometric theorem proving and discovery by Gröbner basis methodA survey of some methods for real quantifier elimination, decision, and satisfiability and their applicationsParametric equation solving and quantifier elimination in finite fields with the characteristic set methodOn the efficiency of solving Boolean polynomial systems with the characteristic set methodLimits of theory sequences over algebraically closed fields and applications.Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classificationSolving SAT by algorithm transform of Wu's methodA criterion for testing whether a difference ideal is primeRitt-Wu characteristic set method for Laurent partial differential polynomial systemsA survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner basesComputing strong regular characteristic pairs with Gröbner basesMechanical manipulation for a class of differential systemsComputational Origami Construction as Constraint Solving and RewritingAttacking Bivium and Trivium with the Characteristic Set MethodGEOTHER: A geometry theorem proverIrreducible decomposition of algebraic varieties via characteristic sets and Gröbner basesUsing geometric rewrite rules for solving geometric problems symbolicallyOn \(n\)-sectors of the angles of an arbitrary triangleComputer algebra methods in the study of nonlinear differential systemsElimination Techniques for Program AnalysisA systematic framework for solving geometric constraints analyticallyA new algorithm for symbolic integration with applicationComputing Switching Surfaces in Optimal Control Based on Triangular DecompositionA mechanical algorithm for solving the Volterra integral equationMechanical algorithm for solving the second kind of Volterra integral equationComputing the radical of an ideal in positive characteristicA new algorithm for integral of trigonometric functions with mechanizationThe Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial RingsMechanically proving geometry theorems using a combination of Wu's method and Collins' methodTheorem proving by chain resolutionOn the complexity of counting components of algebraic varietiesProof Documents for Automated Origami Theorem ProvingEnvelopes and offsets of two algebraic plane curves: exploration of their similarities and differencesAn algorithm for solving DAEs with mechanizationOn a Hybrid Symbolic-Connectionist Approach for Modeling the Kinematic Robot Map - and Benchmarks for Computer AlgebraMultiplicity-preserving triangular set decomposition of two polynomialsNew exact solutions for three nonlinear evolution equationsAnalyses and implementations of chordality-preserving top-down algorithms for triangular decomposition



Cites Work