......................................................................................5 Introduction..................................................................................7 1 The Symbol Grounding Problem......................................................10 The Chinese Room Argument.....................................................10 The Symbolic Merry-go-round.....................

We present the first symbolic execution and automatic test generation tool for C++ programs. First we describe our effort in extending an existing symbolic execution tool for C programs to handle C++ programs. We then show how we made this tool generic, efficient and usable to handle real-life industrial applications. Novel features include extended symbolic virtual machine, library optimizatio...

In this paper, we consider the problem of generating optimized, executable control code from high-level, symbolic specifications. In particular, we construct symbolic control programs using strings from a motion description language with a nominal set of motion parameters, such as temporal duration and energy, embedded within each mode. These parameters are then optimized over, using tools from...

Concolic execution, a combination of concrete and symbolic execution, has become increasingly popular in recent approaches to model checking and test case generation. In general, an interpreter of the language is augmented in order to also deal with symbolic values. In this paper, in contrast, we present a lightweight approach that is based on a program instrumentation. Basically, the execution...

43 cases of sound-symbolic palatalization were collected in a typological survey of babytalk registers, diminutive constructions, and other sound symbolic systems. Analysis of the typological trends and language particular examples reveals important differences between soundsymbolic expressive palatalization and phonologically motivated palatalization. We propose that the facts of sound-symboli...

A symbolic dynamic programming approach for solving first-order Markov decision processes within the situation calculus is presented. As an alternative specification language for dynamic worlds the fluent calculus is chosen and the fluent calculus formalization of the symbolic dynamic programming approach is provided. The major constructs of Markov decision processes such as the optimal value f...

programming 8-bit pic microcontrollers in c with interactive hardware simulation PDF pro scalable net 20 application designs PDF pro scalable net 20 application designs experts voice in net PDF scalable voip mobility integration and deployment PDF vblock solution for a virtualized scalable 50000 user PDF simulation of industrial systems discrete event simulation using excelvba resource manageme...

A b s t r a c t . We present SAM, a symbolic model checker for ACTL, the action-based version of CTL. SAM relies on implicit representations of Labeled Transition Systems (LTSs), the semantic domain for ACTL formulae, and uses symbolic manipulation cilgorithms. SAM has been realized by translating (networks of) LTSs and, possibly recursive, ACTL formulae into BSP (Boolean Symbolic Programming),...

The paper presents a network modeling tool called Net-Clause Language (NCL), integrating some connectionist-like and some symbolic processing features in a uniied computational environment. Unlike the other connectionist symbol processing approaches, NCL represents and processes symbols not by implementing them as patterns of activity in a traditional neural network, rather it uses some connect...

Some of the more heated debates in the cognitive sciences revolve around the nature of human language. Is there innate linguistic knowledge? Does language require the ability to learn and use symbolic rules, or can it be explained solely through associative capacities? And how autonomous is language — is the ability to learn to speak the result of more general social, cognitive and perceptual a...