On the Adequateness of the Connection Method

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 not adequate as they require thousands of steps to solve problems which humans solve effortlessly, spontaneously, and with remarkable efficiency. L. Shastri and V. Ajjanagadde -- who call this gap the artificial intelligence paradox -- suggest that their connectionist inference system is a first step toward bridging this gap. In this paper we show that their inference method is equivalent to reasoning by reductions in the well-known connection method. In particular, we extend a reduction technique called evaluation of isolated connections such that this technique -- together with other reduction techniques -- solves all problems which can be solved by Shastri and Ajjanagadde's system under the same parallel time and space requirements. Consequently, we obtain a semantics for Shastri and Ajjanagadde's logic. But, most importantly, if Shastri and Ajjanagadde's logic really captures the kind of reasoning which humans can perform efficiently, then this paper shows that a massively parallel implementation of the connection method is adequate.

[1]  Franz J. Kurfess,et al.  CHCL - A Connectionist Infernce System , 1990, Dagstuhl Seminar on Parallelization in Inference Systems.

[2]  Lokendra Shastri,et al.  An Optimally Efficient Limited Inference System , 1990, AAAI.

[3]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[4]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[5]  Michael G. Dyer,et al.  High-level Inferencing in a Connectionist Network , 1989 .

[6]  Steffen Hölldobler On High-Level Inferencing and the Variable Binding Problem in Connectionist Networks , 1990, ÖGAI.

[7]  L. Shastri,et al.  From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony , 1993, Behavioral and Brain Sciences.

[8]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[9]  Giorgio Levi,et al.  Declarative Modeling of the Operational Behavior of Logic Languages , 1989, Theor. Comput. Sci..

[10]  I. V. Ramakrishnan,et al.  Term Matching on Parallel Computers , 1989, J. Log. Program..

[11]  H. Levesque Logic and the complexity of reasoning , 1988 .

[12]  Steffen Hölldobler A Structured Connectionist Unification Algorithm , 1990, AAAI.

[13]  Wolfgang Bibel Perspectives on Automated Deduction , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.

[14]  Wolfgang Bibel Advanced Topics in Automated Deduction , 1987, Advanced Topics in Artificial Intelligence.

[15]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

[16]  LOKENDRA SHASTRI,et al.  CONNECTIONISM AND THE COMPUTATIONAL EFFECTIVENESS OF REASONING , 1990 .

[17]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[18]  Steffen Hölldobler On the artificial intelligence paradox , 1993, Behavioral and Brain Sciences.