A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition

Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in the context of knowledge representation and reasoning. It is argued that doing so may be inappropriate in the context of common sense reasoning underlying language understanding. A more stringent criteria of tractability is proposed. A result about reasoning that is tractable in this stronger sense is outlined. Some unusual properties of tractable reasoning emerge when the formal specification is grounded in a neurally plausible architecture.

[1]  Paul F. Dietz,et al.  A Lower Bound Result for the Common Element Problem and Its Implication for Reflex ive Reasoning , 1993 .

[2]  David A. McAllester.  Automatic recognition of tractability in inference relations , 1993, JACM.

[3]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Ramanathan V. Guha,et al.  o CYC : A MID-TERM , 2007 .

[5]  Lokendra Shastri,et al.  Semantic Networks: An Evidential Formalization and Its Connectionist Realization , 1988 .

[6]  D. R. Mani,et al.  Combining a Connectionist Type Hierarchy With a Connectionist Rule-Based Reasoner , 1991 .

[7]  D. R. Mani Lokendra Shastri.  A Connectionist Solution to the Multiple Instantiation Problem using Temporal Synchrony , 1992 .

[8]  James F. Allen,et al.  Knowledge Retrieval as Limited Inference , 1982, CADE.

[9]  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.

[10]  James Henderson,et al.  A Connectionist Parser for Structure Unification Grammar , 1992, ACL.

[11]  G. A. Miller.  THE PSYCHOLOGICAL REVIEW THE MAGICAL NUMBER SEVEN, PLUS OR MINUS TWO: SOME LIMITS ON OUR CAPACITY FOR PROCESSING INFORMATION 1 , 1956 .

[12]  Lokendra Shastri,et al.  Rules and Variables in Neural Nets , 1991, Neural Computation.

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

[14]  Hector J. Levesque,et al.  Hard problems for simple default logics , 1992 .

[15]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[16]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[17]  Dean Allemang,et al.  The Computational Complexity of Abduction , 1991, Artif. Intell..

[18]  Hector J. Levesque,et al.  The Tractability of Path-Based Inheritance , 1989, IJCAI.