@
alg-rr 29 abcd a
@
alg-rr C
Choose an algorithm for algebraic polynomial real root isolation.
C is one of the followings:
D -- Use Descartes rule of sign.
C -- Use Collins&Loos Algorithm.
@
approx-precision 46 abcd m
@
approx-precision N
Approximate algeraic numbers to N decimal places.
@
cell-choice-bound 8 abcd pc
@
cell-choice-bound CCC
Set the cell choice strategy to CCC (for the cells of level >= f).
CCC is a non-empty list of the followings:
TC -- Trivial Conversion First
NC -- Nontrivial Conversion First
LD -- Lesser presumed Degree of the primitive sample point first
GD -- Greater presumed Degree of the primitive sample point first
SR -- Sector first
SN -- Section first
HL -- Higher Level first
LL -- Lower Level first
GI -- Greater Index first
LI -- Lesser Index first
For example, "cell-choice-bound (SR,LD,HL)".
@
cell-choice-free 44 abcd pc
@
cell-choice-free CCC (Not supported for a while)
Set the cell choice strategy to CCC (for the cells of level < f).
CCC is a non-empty list of the followings:
TC -- Trivial Conversion First
NC -- Nontrivial Conversion First
LD -- Lesser presumed Degree of the primitive sample point first
GD -- Greater presumed Degree of the primitive sample point first
SR -- Sector first
SN -- Section first
HL -- Higher Level first
LL -- Lower Level first
GI -- Greater Index first
LI -- Lesser Index first
For example, "cell-choice-free (SR,LD,HL)".
@
ch-pivot 56 bc pc
@
ch-pivot i,j
Choose pivot. Selects the equational constraint E_i,j to be the
pivot constraint. To see the i-th level equational constraints,
issue the command "d-eqn-const i".
@
d-adj-info 50 cde d
@
d-adj-info
Displays adjacency information.
@
d-all-cells-in-subtree 48 de d
@
d-all-cells-in-subtree C
Displays the info about all the cells in the subtree
rooted at the cell with index C.
@
d-candidate-cells 17 d d
@
d-candidate-cells
Displays the list of the current candiate cells.
@
d-cell 19 de d
@
d-cell C
Displays the info about the cell with the index C.
@
d-dstat 38 abcde d
@
d-dstat
Displays the dissertation statisitcs.
@
d-eqn-const 55 bc d
@
d-eqn-const i
Displays all i-th level equational constraints.
@
d-formula 10 abcde d
@
d-formula
Displays the input formula.
@
d-fpc-stat 35 e d
@
d-fpc-stat
Displays the statistics on the final partial CAD.
@
d-input-polynomials 15 bcde d
@
d-input-polynomials
Displays the normalized input polynomials.
@
d-level 18 bc d
@
d-level
Displays the current level.
@
d-nqf-formula 14 bcde d
@
d-nqf-formula
Displays the normalized quantifier-free part of the input formula.
@
d-pcad 16 de d
@
d-pcad C
Display the partial CAD over the cell whose index is C.
@
d-proj-factors 22 bcde d
@
d-proj-factors
Displays the projection factors.
@
d-proj-polynomials 23 bcde d
@
d-proj-polynomials
Displays the projection polynomials.
@
d-pscad 49 de d
@
d-pscad C
Display the partial CAD with signatures over the cell whose index is C.
@
d-qf-formula 13 abcde d
@
d-qf-formula
Dislays the quantifier-free part of the input formula.
@
d-quantifier-list 12 abcde d
@
d-quantifier-list
Displays the quantifier list.
@
d-search-cells-cond 57 abcd d
@
d-search-cells-cond
Displays whether true/false cells are searched for.
@
d-selected-cells-cond 43 abcd d
@
d-selected-cells-cond
Displays the current condition of desired cells
and also indicates whether the condition is being used or not.
@
d-setting 20 abcde d
@
d-setting
Displays the current setting of the program control variables.
@
d-stat 28 abcde d
@
d-stat
Displays the statistics gathered so far.
@
d-trace-alg 25 abcde d
@
d-trace-alg
Displays the current setting of the algorithm traces options.
@
d-trace-data 34 abcde d
@
d-trace-data
Displays the current setting of the data traces options.
@
d-variable-list 11 abcde d
@
d-variable-list
Dispalys the variable list.
@
eqn-const 51 b pc
@
eqn-const i,j
Sets the projection factor (i,j) to be an equational constraint.
@
eqn-const-list 54 b pc
@
eqn-const-list C
Equational constraint list. C is a list of the labels of the
projection factors constituting one equational constraint. For
example, "eqn-const-list (A_3,2, A_3,3, A_3,7)" says that the
polynomial A3,2 * A3,3 * A3,7 should be treated as an equational
constraint. This command may be repeated for each equational
constraint but is available only if the command "prop-eqn-const" was
issued.
@
esp-full-wr 36 e d
@
esp-full-wr
Writes out the ESPRESSO-MV input for the full signature tables.
@
esp-prp-wr 37 e d
@
esp-prp-wr
Writes out the ESPRESSO-MV input for the propagation signature tables.
@
finish 21 abcde pc
@
finish
Finish up the remaining computation without interaction.
@
full-cad 39 abcd pc
@
full-cad
Build a full-cad by turnning off the trial evaluation
and propagation.
@
go 40 abcde pc
@
go
Go to the beginning of the next phase.
@
help 1 abcde m
@
help
Displays all the currently active and inactive commands
supported by QEPCAD.
@
implicant-generation 9 abcde pc
@
implicant-generation C
Set the implicant generation strategy to C.
C is one of the followings:
r -- Right to Left Order
l -- Left to Right Order
@
ipfzt 45 ab m
@
ipfzt C
Integral polynomial finite zero test.
If C is 'y', turn IPFZT on.
Otherise, turn it off.
@
limit-entry-db 6 abcde m
@
limit-entry-db NNN
Only when the actual computation took longer than NNN miliseconds,
its results are stored into a database.
@
manual-choose-cell 24 d pc
@
manual-choose-cell C
Manually chooses a cell whose index is C and go one step.
@
proj-operator 7 abc proj
@
proj-operator C
C is a list of projection operators:
c -- Collins' projection.
m -- McCallum's projection. Correct only for level <= 3.
h -- Hong's projection.
l -- Lazard's projection.
For example, (c,m,h,l) says that Lazard's projection
is used for projecting 5-variate polynomials,
Hong's projection for 4-variate polynomials,
McCallum's projection for 3-variate polynomials,
and Collins' projection for 2-variate polynomials.
@
prop-eqn-const 53 a pc
@
prop-eqn-const
Propagate equational constraints. This command can only be issued
prior to normalization.
@
quit 3 abcde pc
@
quit
Quit the QEPCAD system right here.
@
rational-sample 31 abcd pc
@
rational-sample C
Decide whether to speciially treat the stack construction
over a cell with rational sample point.
C is one of the of followings:
y -- Yes,
n -- No.
@
rem-pf 32 b proj
@
rem-pf i,j
Remove a projection factor.
The j-th i-level projection factor is removed.
@
rem-pj 33 c proj
@
rem-pj i,j
Remove a projection polynomial.
The j-th i-variate projection polynomial is removed.
@
res-alg 52 abc a
@
res-alg C
Specify the algorithm to use for computing resultants and discriminants.
C is one of the following:
M -- for the modular algorithm.
S -- for the subresultant prs algorithm.
@
search-cells-cond 58 abcd pc
@
search-cells-cond T F
Sets the search condition to T and F.
T and F are one of 'y' and 'n'.
If T = 'y' then the program stops as soon as a true cell has been found.
If F = 'y' then the program stops as soon as a false cell has been found.
@
selected-cells-cond 41 abcd pc
@
selected-cells-cond E
Sets the condition for desired cells to E
and activates the condition to be used.
E is a boolean expression of atomic conditions of the form:
obj rel_op obj
where obj is either a non-negative integer or an attribute name
and rel_op is a relational operator such as > < = >= <= /=.
Currently supported attributes are
degree : the presumed degree of the sample point
dimension : the dimension of the cell
level : the level of the cell
parity : 0 if the cell is a section, 1 if sector.
lcindex : the last component of the index of the cell.
index(i) : the i-th element of the index of the cell.
The following logical connectives are supported:
/\ \/ ~ ==> <== <==>
The grammar is exactly the same as that of quantifier free formula.
Example:
[ [ level <= 2 /\ degree = 1 ] ==> dimension = level ].
@
simplifier 47 abcd pc
@
simplifier C
Choose a simplifier C during solution
formula construction.
b : Bottom-up (using internal routine).
t : Top-down/Bottom-up mixed (using also external routine).
@
step 4 abcde pc
@
step NNN
Step NNN times within phases.
@
trace-alg 26 abcde d
@
trace-alg A; E; X.
A is a (possibly empty) sequence of algorithm names,
E is a (possibly empty) sequence of entry trace option characters
(one of 'n', 'i'),
X is a (possibly empty) sequence of exit trace option characters
(one of 'n', 'i', 'o', 't'),
where
'n' stands for "display name",
'i' stands for "display input",
'o' stands for "display output",
't' stands for "display time".
If A is empty, the specified trace option is applied
to all the tracable algorithms.
@
trace-data 27 abcde d
@
trace-data D; M
D is a (possibly empty) sequence of data names,
M is a trace option which is either 'y' or 'n'.
If D is empty, the specified trace option is applied to all the
tracable data.
@
triv-convert 30 abcd pc
@
triv-convert C
Decide whether to specially treat the trivial case of the conversion
of an extended ample point:
C is one of the of followings:
y -- Yes,
n -- No.
@
use-db 5 abcde m
@
use-db C
If C = y then, databases are used,
If C = n then, databases are NOT used.
@
use-selected-cells-cond 42 abcd m
@
use-selected-cells-cond C
If C = 'y' then use the condition for desired cells.
If C = 'n' then do not use the condition for desired cells.
@
whatis 2 abcde m
@
whatis CCCC
Display the detail description of the command CCCC.
@
@@@
pc @Program control:@
d @Displaying information:@
proj @Modifying the projection set:@
a @Selecting algorithms:@
m @Miscellaneous:@
@@@