An investigation into inference with restricted quantification and a taxonomic representation

ABSTRACT

The goal of this investigation is to design and analyze efficient inference methods that arise when a representation language is augmented with restricted quantification and a taxonomic representation. These inference methods will be demonstrated by integrating them into the design of a logic-programming system and a knowledge retriever.

REFERENCES

• 1: Allen, J. F., A. M. Frisch and D. J. Litman, "ARGOT: The Rochester dialogue system," in <u>Proceedings of the National Conference on Artificial Intelligence</u>, August, 1982.
• 2: Allen, J. F., M. E. Giuliano and A. M. Frisch, "The HORNE reasoning system," Technical Report 126, Computer Science Dept., U. Rochester, December 1983.
• 3: Brachman, R. J., "On the epistemological status of semantic networks," in N. V. Findler (Ed.), <u>Associative Networks: Representation and Use of Knowledge by Computers.</u> New York: Academic Press, 1979.
• 4: Brachman, R. J., R. E. Fikes and H. J. Levesque, "KRYPTON: A functional approach to knowledge representation," <u>Computer, 16</u>, 67--73, October, 1983.
• 5: Cohn, A. G., "A Note concerning the axiomisation of Schubert's steamroller in many-sorted logic," Alvey Workshop on Inference, Imperial College, Sept. 1984.
• 6: Cohn, A. G., "Mechanizing a particularly expressive many sorted logic," Ph.D. Thesis, Dept. of Computer Science, Univ. of Essex, 1983a.
• 7: Cohn, A. G., "Improving the expressiveness of many sorted logic," in <u>Proc. of the Third National Conf. on Artificial Intelligence</u>, August 1983b.
• 8: Frisch, A. M., "Using model theory to specify programs," in preparation.
• 9: Alan M. Frisch , James F. Allen , Mark Giuliano, An overview of the HORNE logic programming system, ACM SIGART Bulletin [doi>10.1145/1056623.1056624]
• 10: Israel, D. J., "On interpreting network formalisms," <u>International Journal of Computers and Mathematics, 9</u>, 1-13, 1983a. Also in N. Cercone (Ed.), <u>Computational Linguistics</u>, Oxford: Pergamon, 1983a.
• 11: Israel, D. J., "On the semantics of taxonomy-based semantic networks," 1983b.
• 12: McSkimin, J. R., and J. Minker, "A predicate calculus based semantic network for deductive searching," in N. V. Findler (Ed.), <u>Associative Networks: Representation and Use of Knowledge by Computers.</u> New York: Academic Press, 1979.
• 13: Reiter, R., "An approach to deductive question-answering," BBN Technical Report 3649, Bolt Beranek and Newman, Inc., Cambridge, MA., 1977.
• 14: Walther, C., "A mechanical solution of Schubert's steamroller by many-sorted resolution," <u>Proc. of the Fourth National Conference on Artificial Intelligence</u>, 1984a.
• 15: Walther, C., "Unification in many-sorted theories," <u>Proc. of the Sixth European Conference on Artificial Intelligence</u>, 1984b.
• 16: Walther, C., "A many-sorted calculus based on resolution and paramodulation," <u>Proc. of the Eight International Joint Conference on Artificial Intelligence</u>, 1984b.