论文信息 - P-adic constraint solving

P-adic constraint solving

We automatically cheek for t.lie feasibility of arbitrary hoolcan cou~hinatious of IiIICilr parametric p-adic coustraints using a quant.ifier elimination nwthotl. This call bc do11e uniforrrily for all 13. wi: focus on the necessary sinlplification methods. Our method is inlplenwnted within the conlputer algchra syst,ent Hll)lrCE. We illustrate the applical)ilit\: of this irripletricnt,a.tion to uon-t,rivial problems iucludiug the solution of systenis of linear congruences over the integers.

Thomas Sturm | Andreas Dolzmann | Andreas Dolzmann | T. Sturm

[1] J. Ferrante,et al. The computational complexity of logical theories , 1979 .

[2] Thomas Sturm,et al. Linear Problems in Valued Fields , 2000, J. Symb. Comput..

[3] Thomas Sturm,et al. Guarded expressions in practice , 1997, ISSAC.

[4] Paul J. Cohen,et al. Decision procedures for real and p‐adic fields , 1969 .

[5] Thomas Sturm,et al. REDLOG: computer algebra meets computer logic , 1997, SIGS.

[6] Volker Weispfenning,et al. Quantifier elimination and decision procedures for valued fields , 1984 .

[7] Thomas Sturm,et al. Approaches to parallel quantifier elimination , 1998, ISSAC '98.

[8] Alexander Ostrowski. Über einige Lösungen der Funktionalgleichung ψ(x)·ψ(x)=ψ(xy) , 1916 .

[9] Devdatt Padmakar Dubhashi. Algorithmic Investigations in P-Adic Fields , 1992 .

[10] Thomas Sturm,et al. Real Quantifier Elimination in Practice , 1997, Algorithmic Algebra and Number Theory.

[11] Angus Macintyre,et al. On definable subsets of p-adic fields , 1976, Journal of Symbolic Logic.

[12] Thomas Sturm,et al. Simplification of Quantifier-Free Formulae over Ordered Fields , 1997, J. Symb. Comput..

[13] S. Kochen,et al. Diophantine Problems Over Local Fields: III. Decidable Fields , 1966 .

[14] Volker Weispfenning,et al. The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.