| J. Ferrante and J.R. Geiser. An E#cient Decision Procedure for the Theory of Rational Order. Theoretical Computer Science, 4, pp. 227--233, 1977. |
....a new inequality for each possible combination (e.g. t j t i ) Cooper s algorithm [18] eliminates quanti ers from Presburger formulae, and Ferrante and Racko [27] give an elimination procedure for the theory of reals with addition and order based on elimination sets. Ferrante and Geiser [26] study quanti er elimination in the theory of rationals with addition and order. And Collins [16] pioneered the development of cylindrical algebraic decomposition (cad) techniques for quanti er elimination in the theory of reals with addition and multiplication. In [40] Loos and Weispfenning ....
J. Ferrante and J. R. Geiser. An ecient decision procedure for the theory of rational order. Theoretical Computer Science, 4(2):227233, 1977.
....i and t j x) and then adding a new inequality for each possible combination (e.g. t j t i ) Cooper s algorithm [20] eliminates quanti ers from Presburger formulae, and Ferrante and Racko [25] give an elimination procedure for the theory of reals with addition and order. Ferrante and Geiser [24] study quanti er elimination in the theory of rationals with addition and order. Collins [18] pioneered the development of cylindrical algebraic decomposition (cad) techniques for quanti er elimination in the theory of reals with addition and multiplication. Koubarakis [34] was the rst researcher ....
J. Ferrante and J.R. Geiser. An ecient decision procedure for the theory of rational order. Theoretical Computer Science, 4(2):227233, 1977.
No context found.
J. Ferrante and J.R. Geiser. An E#cient Decision Procedure for the Theory of Rational Order. Theoretical Computer Science, 4, pp. 227--233, 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC