Automating elementary number-theoretic proofs using Gröbner bases

Cached

Download Links

by John Harrison
Citations:4 - 0 self

Active Bibliography

2 Strict General Setting for Building Decision Procedures into Theorem Provers – Predrag Janicic, Alan Bundy - 2001
5 A framework for the flexible integration of a class of decision procedures into theorem provers – Predrag Janicic, Alan Bundy, Ian Green - 1999
5 On Flat Programs with Lists – Marius Bozga, et al.
2 A comparison of decision procedures – Predrag Janicic, Alan Bundy, Predrag Janicic, Alan Bundy - 1997
A general setting for . . . decision procedures – Predrag Janičić , Alan Bundy - 2002
2 A Survey of Arithmetical Definability – Alexis Bès - 2002
and geometry – Robert M. Solovay, R. D. Arthan, John Harrison - 904
2 A short survey of automated reasoning – John Harrison
43 The automation of proof by mathematical induction – Alan Bundy - 1997
10 On the Automata Size for Presburger Arithmetic – Felix Klaedtke - 2004
Analyzing the Behavior of Loop Nests in . . . – Erin Parker - 2004
Complexity of undecidable formulæ in the rationals and inertial Zsigmondy theorems for elliptic curves – Gunther Cornelissen, et al. - 2004
10 Elliptic divisibility sequences and undecidable problems about rational points – Gunther Cornelissen, Karim Zahidi - 2006
2 Effective Gröbner structures – Joachim Apel - 1997
1 Computational ideal theory in finitely generated extension rings – Joachim Apel - 1998
4 A Solution to Kronecker's Problem – Giovanni Gallo, Bhubaneswar Mishra, Key Words - 1994
24 A proof-producing decision procedure for real arithmetic – Sean Mclaughlin, John Harrison - 2005
2 Branching-Time Model Checking of Parametric One-Counter Automata – Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
4 A comparison of decision procedures in Presburger arithmetic – Predrag Janicic, Ian Green, Alan Bundy - 1997