scientific article; zbMATH DE number 3586510
From MaRDI portal
Publication:4153620
zbMath0376.68057MaRDI QIDQ4153620
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Extension of Simson–Wallace Theorem on Skew Quadrilaterals and Further Properties, On the application of Buchberger's algorithm to automated geometry theorem proving, Using Gröbner bases to reason about geometry problems, Rewriting input expressions in complex algebraic geometry provers, Proof-checking Euclid, The LaSalle's invariant sets for a class of Lotka-Volterra prey-predator chain systems, Basic principles of mechanical theorem proving in elementary geometries, History and basic features of the critical-pair/completion procedure, Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems, Ordering in mechanical geometry theorem proving, A complete algorithm for automated discovering of a class of inequality-type theorems, Stability analysis for Lotka-Volterra systems based on an algorithm of real root isolation, Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle, Wu's characteristic set method for SystemVerilog assertions verification, On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving, Computer aided proof for the global stability of Lotka-Volterra systems, Elimination procedures for mechanical theorem proving in geometry, Automated production of traditional proofs for theorems in Euclidean geometry. I: The Hilbert intersection point theorems, A quantifier-elimination based heuristic for automatically generating inductive assertions for programs, The kernel method and systems of functional equations with several conditions, The center problem and time-reversibility with respect to a quadratic involution for a class of polynomial differential systems with order 2 or 3, Visually dynamic presentation of proofs in plane geometry. I: Basic features and the manual input method, Visually dynamic presentation of proofs in plane geometry. II: Automated generation of visually dynamic presentations with the full-angle method and the deductive database method, Automated triangle constructions in hyperbolic geometry, Automated reducible geometric theorem proving and discovery by Gröbner basis method, An application of Ritt-Wu's zero decomposition algorithm to the pseudo null Bertrand type curves in Minkowski 3-space, Unnamed Item, The monotonicity of ratios of some abelian integrals, Recent advances in automated theorem proving on inequalities, A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases, Elimination theory in differential and difference algebra, Solution to the generalized champagne problem on simultaneous stabilization of linear systems, A class of mechanically decidable problems beyond Tarski's model, On \(n\)-sectors of the angles of an arbitrary triangle, Kernel method and linear recurrence system, An alternative algorithm for computing the pseudo-remainder of multivariate polynomials, Parameter identification on abelian integrals to achieve Chebyshev property, Automated generation of readable proofs with geometric invariants. I: Multiple and shortest proof generation, A characteristic set method for ordinary difference polynomial systems, A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs, Computer assistance for ``discovering formulas in system engineering and operator theory, Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick, Geometric theorem proving by integrated logical and algebraic reasoning, Simultaneous solution of polynomial equations., Automated reasoning in differential geometry and mechanics using the characteristic set method. I: An improved version of Ritt-Wu's decomposition algorithm, Formal solutions of differential equations, Traveling wave solutions for nonlinear equations using symbolic computation
