This paper deals with the problem of variable binding in connectionist networks. Speci cally, a more thorough solution to the variable binding problem based on the Discrete Neuron formalism is proposed and a number of issues arising in the solution are examined in relation to logic: consistency checking, binding generation, uni cation, and functions. We analyze what is needed in order to resolv...

The abstract variable binding calculus (VB-calculus) introduced in [2] (see also [4]) provides a formal framework encompassing such diverse variable-binding phenomena as lambda abstraction, Riemann integration, existential and universal quantification (in both classical and nonclassical logic), and various notions of generalized quantification that have been studied in abstract model theory. Al...

Q1 Please confirm affiliation details. Q2 Please provide publisher location for the following references: Abeles (1991), Amit (1989), Anderson and Lebiere (1998), Churchland and Sejnowski (1992), Dayan and Abbott (2005), Filmore (1968), Hebb (1949), Hofstadter (1979), Hopcroft and Ullman (1979), Jackendoff (2002), Klatzky (1980), Maass and Bishop (2001), Malsburg (1986), Newell (1990), Rumelhar...

One of the problems with many partial-order planners is their eager commitment to variable bindings. This is contrary to their control decision in delayedcommitment of operator orderings. In this paper we present an extension to the classical partial-order planners by associating every variable with a finite domain of values. The extended planner applies constraint satisfaction routines to chec...

Recent developments in connectionist architectures for symbolic computation have made it possible to investigate parsing in a connectionist network while still taking advantage of the large body of work on parsing in symbolic frameworks. The work discussed here investigates syntactic parsing in the temporal synchrony variable binding model of symbolic computation in a connectionist network. Thi...

In this paper the approach to structural operational semantics (SOS) using transition system specifications (TSSs) is extended to deal with variable binding operators and many-sortedness. Bisimulation and Verhoef’s transition rule format, known as the panth format, generalize naturally to the new TSSs. It is shown that in this setting bisimulation is still a congruence for meaningful TSSs in pa...