295 search results - page 13 / 59 » Simultaneous Quantifier Elimination |
DATE
2005
IEEE
14 years 2 months ago
2005
IEEE
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
EUROGP
2003
Springer
14 years 1 months ago
2003
Springer
This paper discusses the underlying pressures responsible for code growth in genetic programming, and shows how an understanding of these pressures can be used to use to eliminate...
VMCAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
ISORC
2003
IEEE
14 years 1 months ago
2003
IEEE
Quality and risk concerns currently limit the application of commercial off-the-shelf (COTS) software components to non-critical applications. Software metrics can quantify factor...