Taxonomic syntax for first order inference

A new polynomial time decidable fragment of first order logic is identified, and a general method for using polynomial time inference procedures in knowledge representation systems is presented. The results shown in this paper indicate that a nonstandard “taxonomic” syntax is essential in constructing natural and powerful polynomial time inference procedures. The central role of taxonomic syntax in the polynomial time inference procedures provides technical support for the often-expressed intuition that knowledge is better represented in terms of taxonomic relationships than classical first order formulas. To use the procedures in a knowledge representation system, a “Socratic proof system” is defined, which is complete for first order inference and which can be used as a semi-automated interface to a first order knowledge base.

[1]  Robert S. Boyer,et al.  Computer Proofs of Limit Theorems , 1971, International Joint Conference on Artificial Intelligence.

[2]  W. W. Bledsoe,et al.  Non-Resolution Theorem Proving , 1977, Artif. Intell..

[3]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

[4]  Vaughan R. Pratt,et al.  On specifying verifiers , 1980, POPL '80.

[5]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[6]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[7]  Martin D. Davis,et al.  Obvious Logical Inferences , 1981, IJCAI.

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

[9]  Ronald J. Brachman,et al.  What IS-A Is and Isn't: An Analysis of Taxonomic Links in Semantic Networks , 1983, Computer.

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

[11]  Jussi Ketonen EKL - A Mathematically Oriented Proof Checker , 1984, CADE.

[12]  Ronald J. Brachman,et al.  An Overview of the KL-ONE Knowledge Representation System , 1985, Cogn. Sci..

[13]  K. Konolige A deduction model of belief , 1986 .

[14]  Deepak Kapur,et al.  RRL: A Rewrite Rule Laboratory , 1986, CADE.

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

[16]  David A. McAllester Ontic: A Knowledge Representation System for Mathematics , 1989, CADE.

[17]  Christoph Walther,et al.  Many-sorted unification , 1988, JACM.

[18]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[19]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[20]  Benjamin Kuipers,et al.  Towards a Theory of Access-limited Logic for Knowledge Representation , 2005 .

[21]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[22]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[23]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

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