Uncertainty propagation in heterogeneous algebras for approximate quantified constraint solving

Journal of Universal Computer Science

Volumn 6, Issue 9, 2000, Pages 861-880

  Ratschan, Stefan ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Computational logic; Constraints; Interval computation; Uncertainty

Indexed keywords

EID: 0003240019     PISSN: 0948695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (66)

1. [ACS94] M. V. A. Andrade, J. L. D. Comba, and J. Stolfi. Affine arithmetic. In Abstracts of the International Conf. on Interval and Computer-Algebraic Methods in Science and Engineering (INTERVAL/94), pages 36-40, 1994.
2. [AF90] Jean-Pierre Aubin and Helene Frankowska. Set-valued Analysis. Birkhäuser, Boston, 1990.
3. [AK80] N. Apostolatos and G. Karabatzos. Set functions and applications. In Karl L. E. Nickel, editor, Interval Mathematics, pages 1-24. Academic Press, 1980.
4. [Alb80] R. Albrecht. Roundings and approximations in ordered sets. In G. Alefeld and R.D. Grigorieff, editors, Fundamentals of Numberical Computation (Computer-Oriented Numerical Analysis), volume 2 of Computing Supple-mentum, pages 17-31. Springer, 1980.
5. [Bar] Roman Bartak. Guide to constraint programming, http://kti.ms.mff. cuni.cz/~bartak/constraints/index.html.
6. [BCK97] Maria Beltran, Gilbert Castillo, and Vladik Kreinovich. Algorithms that still produce a solution (maybe not optimal) even when interrupted: Shary's idea justified. Reliable Computing, 3(3):39-53, 1997.
7. [Bel77] N.B. Belnap, Jr. A useful four-valued logic. In J. Michael Dunn and G. Epstein, editors, Modern Uses of Multiple- Valued Logic, pages 8-37. Reidel, 1977.
8. [Ber96] D. Berleant. Automatically verified arithmetic on probability distributions and intervals. In R. Baker Kearfott and Vladik Kreinovich, editors, Applications of Interval Computations. Kluwer, 1996.
9. [BH98] Martin Berz and Georg Hoffstätter. Computation and application of taylor polynomials with interval remainder bounds. Reliable Computing, 4:83-97, 1998.
10. [Can70] Georg Cantor. Über einen die geometrischen Reihen betreffenden Lehrsatz. Grelles Journal f. Mathematik, 72:130-138, 1870.
11. [Cap79] G. Caplat. Symbolic preprocessing in interval function computing. In Symbolic and algebraic computation, EUROSAM '79, LNCS 72, pages 369-382, Marseille, 1979.
12. [CH91] George E. Collins and Hoon Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12:299-328, 1991. Also in [CJ98].
13. [CJ98] B. F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer, 1998.
14. [Col75] George E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Second GI Conf. Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 134-183. Springer- Verlag, Berlin, 1975. Also in [CJ98].
15. [CR91] George F. Corliss and Louis B. Rail. Computing the range of derivatives. In Edgar W. Kaucher, Svetoslav M. Markov, and Günter Mayer, editors, Computer Arithmetic, Scientific Computation, and Mathematical Modelling, volume 12 of IMACS Annals on Computing and Applied Mathematics, pages 195-212. J. C. Baltzer, Basel, 1991.
16. [DH88] J. H. Davenport and J. Heintz. Real quantifier elimination is doubly exponential. Journal of Symbolic Computation, 5:29-35, 1988.
17. [DS97] Andreas Dolzmann and Thomas Sturm. Simplification of quantifier-free formulae over ordered fields. Journal of Symbolic Computation, 24(2):209-231, 1997.
18. [dW93] Van der Waerden. Algebra I. Springer Verlag, 9th edition, 1993.
19. [EFT84] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer Verlag, 1984.
20. [EM85] Hartmut Ehrig and Bernd Mahr. Algebraic Specification. Springer Verlag, 1985.
21. [Han75] E. R. Hansen. A generalized interval arithmetic. In K. Nickel, editor, Interval Mathematics, volume 29 of Lecture Notes in Computer Science, pages 7-18, 1975.
22. [Hen71] Peter Henrici. Circular arithmetic and the determination of polynomial zeros. In Conf. Appl. numerical Analysis, volume 228 of Lecture Notes Math., pages 86-92. Springer, 1971.
23. [Hes88] Wim H. Hesselink. A mathematical approach to nondeterminism in data types. ACM Transactions on Programming Languages and Systems, 10(1):87-117, 1988.
24. [HJ98] C.A.R. Hoare and He Jifeng. Unifying Theories of Programming. Series in Computer Science. Prentice Hall, 1998.
25. [HN96] Hoon Hong and Andreas Neubacher. Approximate quantifier elimination. In Proceedings of IMACS-ACA'96, 1996.
26. [HNS94] Hoon Hong, Andreas Neubacher, and Volker Stahl. The STURM library manual - a C++ library for symbolic computation. Technical Report 94-30, RISC Linz, 1994.
27. [Hoa96] C.A.R. Hoare. Unifying theories: A personal statement. ACM Computing Surveys, 28A(4), December 1996.
28. [Hon92] H. Hong. Heuristic search strategies for cylindrical algebraic decomposition. In Jacques Calmet et al., editors, Proceedings of Artificial Intelligence and Symbolic Mathematical Computing, Springer Lecture Notes in Computer Science 737, pages 152-165, 1992.
29. [Hon95] Hoon Hong. Symbolic-numeric methods for quantified constraint solving. In International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics SCAN-95, 1995. Invited Talk.
30. [HS94] Hoon Hong and Volker Stahl. Safe starting regions by fixed points and tightening. Computing, 53:323-335, 1994.
31. [Hus93] H. Hussmann. Nondeterminism in Algebraic Specifications and Algebraic Programs. Birkhäuser, 1993.
32. [Jah80] Karl-Udo Jahn. The importance of 3-valued notions for interval mathematics. In Karl L. E. Nickel, editor, Interval Mathematics, pages 75-98. Academic Press, 1980.
33. [JL87] Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111-119. ACM, January 1987.
34. [Kea96] R. Baker Kearfott. Interval computations: Introduction, uses, and resources. Euromath Bulletin, 2(1):95-112, 1996.
35. [KFG+99] Vladik Kreinovich, Scott Ferson, Lev Ginzburg, Harry Schulte, Matthew R. Barry, and Hung T. Nguyen. From interval methods of representing uncertainty to a general description of uncertainty. In Proceeedings of the International Conference on Information Technology, Bhubaneshwar, India, 1999.
36. [Kla76] Dieter Klaua. Intervallstrukturen geordneter Körper. (German). Math. Nachr., 75:319-326, 1976.
37. [Klu81] U. Klug. Verallgemeinerte Intervallräume (German). Math. Nachr., 102:347-359, 1981.
38. [KM80] U. W. Kulisch and W.L. Miranker. Arithmetic operations in interval spaces. In G. Alefeld and R.D. Grigorieff, editors, Fundamentals of Numberical Computation (Computer-Oriented Numerical Analysis), volume 2 of Computing Supplementum, pages 51-67. Springer, 1980.
39. [KM81] Ulrich W. Kulisch and Willard L Miranker. Computer Arithmetic in Theory and Practice. Academic Press, 1981.
40. [KM84] Edgar W. Kaucher and Willard L. Miranker. Self-Validating Numerics for Function Space Problems. Academic Press, 1984.
41. [Kos98] Olga Kosheleva. When is the product of intervals also an interval. Reliable Computing, 4:179-190, 1998.
42. [KU80] R. Klatte and Ch. Ullrich. Complex sector arithmetic. Computing, 24:139-148, 1980.
43. [Mis93] B. Mishra. Algorithmic Algebra. Springer Verlag, 1993.
44. [Moo66] R. E. Moore. Interval Analysis. Prentice Hall, Englewood Cliffs, NJ, 1966.
45. [MS98] Kim Marriott and Peter J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.
46. [Neu90] Arnold Neumaier. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, 1990.
47. [Neu97] Andreas Neubacher. Parametric Robust Stability by Quantifier Elimination. PhD thesis, Research Institute for Symbolic Computation - Universität Linz, October 1997.
48. [Nic80] K. Nickel. Arithmetic of complex sets. Computing, 24:97-105, 1980.
49. [NN97] Monica Nogueira and Amarendra Nandigam. Why interval? Because if we allow other sets, tractable problems become intractable. Technical Report UTEP-CS-97-7, University of Texas at El Paso, El Paso, 1997.
50. [NRSS97] Alioune Ngom, Corina Reischer, Dan A. Simovici, and Ivan Stojmenović. Set-valued logic algebra: A carrier computing foundation. Multiple Valued Logic, 2(3): 183-216, 1997.
51. [Plo76] G. Plotkin. A power domain construction. SIAM Journal on Computing, 5(3):452-487, 1976.
52. [Rat98] Stefan Ratschan. Approximate Constraint Logic Programming. PhD thesis, RISC-Linz, 1998.
53. [Rat00a] Stefan Ratschan. Approximate quantified constraint solving (AQCS). http : //www. rise. uni-linz . ac . at/research/sof tware/AQCS, 2000. Software package.
54. [Rat00b] Stefan Ratschan. Approximate quantified constraint solving by cylindrical box decomposition. In 6th IMACS Conference on Applications of Computer Algebra: Interval and Computer-Algebraic Methods in Science and Engineering, St. Petersburg, 2000.
55. [Rat00c] Stefan Ratschan. Convergence of quantified constraint solving by approximate quantifiers. Technical Report 00-23, Research Institute for Symbolic Computation (RISC) - Linz, 2000. Submitted for Publication.
56. [Ren92] James Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13(3):255-352, March 1992. Part I-III.
57. [RL71] J. Rokne and P. Lancaster. Complex interval arithmetic. Comm. ACM, 14:111-112, 1971.
58. [SB81] H.P. Sankappanavar Stanley Burris. A course in universal algebra. Springer Verlag, 1981.
59. [Smy78] M. B. Smyth. Power domains. Journal of Computer and System Sciences, 16, 1978.
60. [Sta96] Volker Stahl. Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations. PhD thesis, Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria, 1996.
61. [Tar51] Alfred Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, 1951. Also in [CJ98].
62. [Urq86] Alasdair Urquhart. Many-valued logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, Vol. III: Alternatives in Classical Logic, chapter III.2, pages 71-116. D. Reidel Publishing Company, 1986.
63. [Wei88] Volker Weispfenning. The complexity of linear problems in fields. Journal of Symbolic Computation, 5(1-2):3-27, 1988.
64. [WM97] Michal Walicki and Sigurd Meldal. Algebraic approaches to nondeterminism: An overview. ACM Computing Surveys, 29(1), 1997.
65. [Zad65] Lotfi A. Zadeh. Fuzzy sets. Information and Control, 8:338-353, 1965.
66. [Zim91] H.-J. Zimmermann. Fuzzy Set Theory - and Its Applications. Kluwer, 1991.