Mundane Reasoning by Parallel Constraint Satisfaction

This thesis describes a frame system similar to KL-ONE, called micro-KLONE, for representing and reasoning about knowledge which may be incomplete or inconsistent. An unusual semantics appropriate to familiar situations is proposed. It is based on probabilistic sampling to find a single plausible model of the domain in order to answer a query. Correct answering of queries is intractable, so the implementation make two approximations in order to run quickly: (1) The underlying connectionist architecture is only large enough to represent partial models of the domain, and (2) the system is only allowed to search for a limited time, so it may not even find the best partial intepretation. Lacking a provably correct implementation, the usefulness of the system becomes an empirical question. The "Ted Turner" problem is presented as an example in which the system draws an interesting common sense conclusion to a counterfactual query.

[1]  A. Macallum The University of Toronto , 1907, Nature.

[2]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[3]  R. Brown How shall a thing be called. , 1958, Psychological review.

[4]  I. G. BONNER CLAPPISON Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[5]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[6]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[9]  Scott E. Fahlman,et al.  NETL: A System for Representing and Using Real-World Knowledge , 1979, CL.

[10]  G. Miller,et al.  Cognitive science. , 1981, Science.

[11]  Roger C. Schank,et al.  Dynamic memory - a theory of reminding and learning in computers and people , 1983 .

[12]  Hector J. Levesque,et al.  Krypton: A Functional Approach to Knowledge Representation , 1983, Computer.

[13]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Michael R. Genesereth,et al.  The Use of Design Descriptions in Automated Diagnosis , 1984, Artif. Intell..

[15]  Geoffrey E. Hinton,et al.  Symbols Among the Neurons: Details of a Connectionist Inference Architecture , 1985, IJCAI.

[16]  Hector J. Levesque,et al.  An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of KRYPTON , 1985, IJCAI.

[17]  Editors , 1986, Brain Research Bulletin.

[18]  Geoffrey E. Hinton,et al.  Learning and relearning in Boltzmann machines , 1986 .

[19]  James L. McClelland,et al.  Mechanisms of Sentence Processing: Assigning Roles to Constituents of Sentences , 1986 .

[20]  J. Austin Associative memory , 1987 .

[21]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.

[22]  Ronald L. Rivest,et al.  Game Tree Searching by Min/Max Approximation , 1987, Artif. Intell..

[23]  R. Lathe Phd by thesis , 1988, Nature.

[24]  Stephen I. Gallant,et al.  Connectionist expert systems , 1988, CACM.

[25]  Peter F. Patel-Schneider,et al.  Undecidability of Subsumption in NIKL , 1989, Artif. Intell..

[26]  James L. McClelland,et al.  Learning and Applying Contextual Constraints in Sentence Comprehension , 1990, Artif. Intell..

[27]  David S. Touretzky,et al.  A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..

[28]  S. Mcconville Analogues , 2022, Irish Political Prisoners 1960–2000.