Symbolic It^ o calculus refers both to the implementation of It^ o calculus in a computer algebra package and to its application. This article 1 reports on progress in the implementation of It^ o calculus in the powerful and innovative computer algebra package AXIOM, in the context of a decade of previous implementations and applications. It is shown how the elegant algebraic structure underlyi...

Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix and postfix notation, is presented. The ...

Term matching has become one of the most important primitive operations for symbolic computation. This paper describes the extension of the object-oriented symbolic computation system AlgBench with pattern matching and uniication facilities. The various pattern objects are organized in subclasses of the class of the composite expressions. This leads to a clear design and to a distributed implem...

cognitive architectures (cas) are the core of artificial cognitive systems. a ca is supposed to specify the human brain at a level of abstraction suitable for explaining how it achieves the functions of the mind. over the years a number of distinct cas have been proposed by different authors and their limitations and potentials were investigated. these cas are usually classified as symbolic and...

The architectures under investigation offer a true integration of symbolic and neural network styles of reasoning in a unified framework. In AURA, the basic functional blocks are neural networks which can perform symbolic reasoning, as well as the pattern processing functions normally associated with neural networks. A further feature of the approach is that a powerful partial-match mechanism s...

Supporters of eliminative connectionism have argued for a pattern association-based explanation of language learning and language processing. They deny that explicit rules and symbolic representations play any role in language processing and cognition in general. Their argument is based to a large extent on two artificial neural network (ANN) models that are claimed to be able to learn the past...

abstract the subject matter of this paper is study of the simurgh pattern's reflection in islamic potteries and tiles of iran. author intends relying on some historic and literary principles as well as identification of drawing characteristics and symbolic concepts of simurgh, detect the cause of difference between islamic simurgh and sassanid simurgh. in addition, he aimed at tracing of p...

In this paper we outline a simple explanation of why, we think, the classical, or vector-space-based (including the artificial neural net) models for pattern recognition are fundamentally inadequate as such. The present simple explanation of this inadequacy is based on a radically new understanding of the nature of inductive learning processes. The latter became possible only after a careful an...