Sciweavers

1532 search results - page 78 / 307
» The Symbol Grounding Problem
Sort
View
JSYML
2002
81views more  JSYML 2002»
15 years 3 months ago
Modulated Fibring and The Collapsing Problem
Fibring is recognized as one of the main mechanisms in combining logics, with great significance in the theory and applications of mathematical logic. However, an open challenge t...
Cristina Sernadas, João Rasga, Walter Alexa...
PROCEDIA
2011
14 years 6 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 10 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
TAP
2008
Springer
93views Hardware» more  TAP 2008»
15 years 4 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
EELC
2006
128views Languages» more  EELC 2006»
15 years 7 months ago
Evolving Distributed Representations for Language with Self-Organizing Maps
We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and p...
Simon D. Levy, Simon Kirby