1532 search results - page 30 / 307 » The Symbol Grounding Problem |
220
Voted
NFM
2011
14 years 10 months ago
2011
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
134
click to vote
CAI
2006
Springer
15 years 3 months ago
2006
Springer
CBR systems solve problems by assessing their similarity with already solved problems (cases). Explanation of a CBR system prediction usually consists of showing the user the set o...
114
Voted
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
125
Voted
JSC
2006
15 years 3 months ago
2006
We describe a new software package, named SumCracker, for proving and finding identities involving symbolic sums and related objects. SumCracker is applicable to a wide range of e...
124
Voted
HYBRID
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic co...