Improved projection for cylindrical algebraic decomposition

被引:80
作者
Brown, CW [1 ]
机构
[1] USN Acad, Dept Comp Sci, Annapolis, MD 21402 USA
关键词
D O I
10.1006/jsco.2001.0463
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
McCallum's projection operator for cylindrical algebraic decomposition (CAD) represented a huge step forward for the practical utility of the CAD algorithm. This paper presents a simple theorem showing that the mathematics in McCallum's paper actually point to a better projection operator than he proposes-a reduced McCallum projection. The reduced projection has the potential to not simply speed up CAD computation for problems that are currently solvable in practice, but actually increase the scope of problems that can realistically be attacked via CADs. Additionally, the same methods are used to show that McCallum's projection can be reduced still further when CAD is applied to certain types of commonly occurring quantifier elimination problems. (C) 2001 Academic Press.
引用
收藏
页码:447 / 465
页数:19
相关论文
共 20 条
[1]   CYLINDRICAL ALGEBRAIC DECOMPOSITION .1. THE BASIC ALGORITHM [J].
ARNON, DS ;
COLLINS, GE ;
MCCALLUM, S .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :865-877
[2]  
AUBRY P, 2000, RR3992 INRIA
[3]  
BROWN CW, 1998, P 1998 INT S SYMB AL, P295
[4]  
Caviness B. F., 1998, Texts and Monographs in Symbolic Computation
[5]  
Collins G. E., 1998, QUANTIFIER ELIMINATI
[6]   PARTIAL CYLINDRICAL ALGEBRAIC DECOMPOSITION FOR QUANTIFIER ELIMINATION [J].
COLLINS, GE ;
HONG, H .
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 12 (03) :299-328
[7]  
Gelfand I. M., 1994, Mathematics Theory & Applications, DOI DOI 10.1007/978-0-8176-4771-1
[8]  
GeorgeE Collins, 1975, AUTOMATA THEORY FORM, P134, DOI [DOI 10.1007/3-540-07407-4_17, DOI 10.1007/3]
[9]   COMPLEXITY OF DECIDING TARSKI ALGEBRA [J].
GRIGOREV, DY .
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 5 (1-2) :65-108
[10]   Testing stability by quantifier elimination [J].
Hong, H ;
Liska, R ;
Steinberg, S .
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (02) :161-187