From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony
L Shastri, V Ajjanagadde - Behavioral and brain sciences, 1993 - cambridge.org
Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable
efficiency–as though these inferences were a reflexive response of their cognitive …
efficiency–as though these inferences were a reflexive response of their cognitive …
A VLSI architecture for object recognition using tree matching
K Sitaraman, N Ranganathan… - … on Application-Specific …, 2002 - ieeexplore.ieee.org
The problem of tree pattern matching for object recognition in images is computationally
intensive in nature. In two-dimensional images, the objects can be represented through …
intensive in nature. In two-dimensional images, the objects can be represented through …
Distributing structure over time
JE Hummel, KJ Holyoak - Behavioral and Brain Sciences, 1993 - cambridge.org
Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable
efficiency-as though these inferences were a reflexive response of their cognitive apparatus …
efficiency-as though these inferences were a reflexive response of their cognitive apparatus …
Efficient parallel term matching and anti-unification
AL Delcher, S Kasif - Journal of Automated Reasoning, 1992 - Springer
In this paper we present optimal processor x time parallel algorithms for term matching and
anti-unification of terms represented as trees. Term matching is the special case of …
anti-unification of terms represented as trees. Term matching is the special case of …
[PDF][PDF] On the adequateness of the connection method
A Beringer, S Hölldobler - AAAI, 1993 - cdn.aaai.org
Roughly speaking, adequatness is the property of a theorem proving method to solve
simpler problems faster than more difficult ones. Automated inferencing methods are often …
simpler problems faster than more difficult ones. Automated inferencing methods are often …
A step toward modeling reflexive reasoning
L Shastri, V Ajjanagadde - Behavioral and Brain Sciences, 1993 - cambridge.org
Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable
efficiency-as though these inferences were a reflexive response of their cognitive apparatus …
efficiency-as though these inferences were a reflexive response of their cognitive apparatus …
Tight complexity bounds for term matching problems
RM Verma, IV Ramakrishnan - Information and Computation, 1992 - Elsevier
In this paper we study the sequential and parallel complexity of various important term
matching problems. These problems occur frequently in applications such as term rewriting …
matching problems. These problems occur frequently in applications such as term rewriting …
ARWand for an augmuented world builder
ARWand is a smartphone-based 3D user interface for manipulating 3D virtual objects in a
wearable augmented reality (AR) environment without the use of a cumbersome external …
wearable augmented reality (AR) environment without the use of a cumbersome external …
A tree-partitioning technique with applications to expression evaluation and term matching
SR Kosaraju, AL Delcher - Proceedings [1990] 31st Annual …, 1990 - ieeexplore.ieee.org
A tree-partitioning technique is proposed and applied to expression evaluation and term
matching. It was shown recently that the problem of evaluating an arithmetic expression is in …
matching. It was shown recently that the problem of evaluating an arithmetic expression is in …
A note on the parallel complexity of anti-unification
A note on the parallel complexity of anti-unification Page 1 Journal of Automated Reasoning 9'
381-389, 1992. 381 ~J 1992 Kluwer Academic Publishers. Printed m the Netherlands. A Note …
381-389, 1992. 381 ~J 1992 Kluwer Academic Publishers. Printed m the Netherlands. A Note …