%0 Journal Article
%T New Decision Procedures and Polynomial Hierarchy for the Theory of Real Addition with Order<br>有序实数加法理论新的判定过程与多项式谱
%A XUE Rui
%A <br>薛锐
%J 软件学报
%D 2001
%I 
%X In this paper, a quantifier elimination method for positive real theory with order by Volker Weispfenning is extended to a decision procedure, from which a new and finer decision method for eleminentary theory of real addition with order is given. It is proved that its subclasses of fixed number of quantifiers is in correspondant polynomial hierarchy. The result of this paper is essentially an extension of the claim on positive real theory by N. Megiddo to the whole real theory, which is relatively simply enduced in this paper, and comparably better than the similar result by E.D. Sontag.
%K real addition
%K decision procedure
%K quantifier bounding
%K elimination of quantifier
%K computational complexity
%K polynomial hierarchy<br>实数加法
%K 判定过程
%K 量词的界
%K 量词消去
%K 计算复杂性
%K 多项式谱
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=93BB9644B454C3FD&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=DF92D298D3FF1E6E&sid=61EDB4BBA42E40FF&eid=8DEAC935CD342902&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=10