%0 Journal Article
%T THE SUB-RESULTANT METHOD FOR AUTOMATED THEOREM PROVING<br>几何定理机器证明的结式矩阵法
%A ZHANG JING-ZHONG
%A YANG LU
%A HOU XIAO-RONG
%A <br>张景中
%J 系统科学与数学
%D 1995
%I 
%X In this paper, we present a method, with which ascending chains need not be factorized beforehand, to overcome the so-called "reducibility difficulty".Employing Wu's division and sub-resultant computations,we call it WR decomposition algorithm.
%K Ascending chain
%K Wu's division
%K sub-resultant<br>升列，吴除法，子结式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=3F4DE1B365903CDACAF581B49E814298&yid=BBCD5003575B2B5F&vid=23CCDDCD68FFCC2F&iid=CA4FD0336C81A37A&sid=EC481BF121090F0C&eid=59043DD818B195CA&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=9&reference_num=0