Abstract
Many sorted logics can increase deductive efficiency by eliminating useless branches of the search space, but usually this results in reduced expressiveness. The many sorted logic described here has several unusual features which not only increase expressiveness but also can reduce the search space even more than a conventional many sorted logic. The quantifiers are unsorted: the restriction on the range of a variable derives from the argument positions of the nonlogical symbols that it occupies. Polymorphic sort specifications are allowed; thus statements usually requiring several assertions may be compactly expressed by a single assertion. The sort structure may be an arbitrary lattice and the sort of a term can be more general than the sort of the argument position it occupies. It is also shown how it is sometimes possible to use sort information to determine the truth value of a formula without resort normal inference. Inference rules for a resolution based system are discussed; these can be proved to be sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Becker, J. D. (1975) ‘The phrasal lexicon’, in Proc. TINLAP 1.
Bundy, A., Byrd, L., Luger, G., Mellish, C., and Palmer, M. (1979) ‘Solving mechanics problems using metalevel inference’, in D. Michie (ed.) Expert Systems in the Micro-Electronic Age, Edinburgh University Press, pp. 50–64.
de Champeaux, D. (1978) ‘A theorem prover dating a semantic network’, Proc AISB/GI Conf. on AI, Hamburg, pp. 82–92.
Chang, C. and Lee, R. C. (1973) Symbolic Logic and Mechnical Theorem Proving, Academic Press.
Clark, K. and McCabe, F. (1979) ‘The control facilities of IC-PROLOG’, in Expert Systems in the Micro-Electronic Age, D. Michie (ed.), Edinburgh University Press.
Clocksin, W. and Mellish, C. (1981) Programming in Prolog, Springer-Verlag.
Cohen, D. (1980) ‘Knowledge based theorem proving and learning’, PhD Thesis, Carnegie Mellon University.
Cohn, A. G. (1983a) ‘Mechanising a particularly expressive many sorted logic’, Ph.D. Thesis, University of Essex.
Cohn, A. G. (1983b) ‘Improving the expressiveness of many sorted logic,’ in Proc. AAAI, Washington DC, pp. 84–87.
Cohn, A. g. (1986) ‘Many sorted logic = unsorted logic + control?’ in M. Bramer (ed.) Expert Systems 86, Cambridge University Press, pp. 184–194.
Davis, R. (1980) ‘Meta-rules: reasoning about control,’ Artificial Intelligence 15, 179–222.
Dick, A. J. J., and Cunningham, R. J. (1983) ‘Rewrite systems on a lattice of types,’ Research Report DOC 83/7, Imperial College, Department of Computing.
Enderton, H. B. (1972) A Mathematical Introduction to Logic, Academic Press.
Fahlman, S.E. (1982) ‘A planning system for robot construction tasks,’ Artificial Intelligence 5, 1–49.
Feferman, S. (1974) ‘Applications of many sorted interpolation theorems’ in Proc. Symp. Pure Mathematics, American Math. Soc., pp. 102–148.
Frisch, A., Allen, J. F., and Giuliano, M. (1982) ‘An Overview of the HORNE Logic Programming System,’ University of Rochester.
Frisch, A. (1984) ‘An investigation into inference with restricted quantification and a taxonomic representation.’ SIGART Newsletter 91, 28–31.
Frisch, A. M. (1986) ‘Parsing with restricted quantification: an initial demonstration,’ in A. G. Cohn and J. R. Thomas (eds.) Artificial Intelligence and its Applications, Wiley.
Gelernter, H. (1963) ‘Realization of a geometry theorem-proving machine,’ in E. Feigenbaum and J. Feldman (eds.) Computers and Thought, McGraw-Hill, pp. 134–152.
Gelerntner, H., Hansen, J. R., and Loveland, D. W. (1963) ‘Empirical explorations of the geometry theorem-proving machine,’ in E. Feigenbaum and J. Feldman (eds.) Computers and Thought, McGraw-Hill, pp. 153–163.
Genesereth, M. R. and Smith, D. E. (1983) ‘An overview of meta level architecture,’ in Proc. AAAI, Morgan Kaufmann, pp. 119–124.
Gilmore, P. C. (1958) ‘An Addition to the Logic of Many Sorted Theories,’ Compositio Math. 13 277–281.
Goguen, J. A. and Meseguer, J. (1984) ‘Equality, types, modules, and (why not?) generics for logic programming,’ J. Logic Programming 1, 179–210.
Gordon, M., Milner, R., Morris, L., Newey, M., and Wadsworth, C. (1978) ‘A metalanguage for interactive proof in LCF,’ in Proc. Fifth ACM SIGACT-SIGPLAN Conf on Principles of Programming Languages, Tucson, Arizona.
Hailperin, T. (1957) ‘A theory of restricted quantification,’ J. Symbolic Logic 22, 19–35.
Hayes, P. J. (1971) ‘A logic of actions’, in Machine Intelligence 6, Edinburgh University Press, pp. 495–520.
Hayes, P. J. (1973) ‘Computation and deduction,’ in Proc 2nd MFCS Symp., Czechoslovak Academy of Sciences, pp. 105–116.
Hayes, P. J. (1975) ‘Three valued logic and computer science’, Computer Science Memo-6, University of Essex.
Hayes, P. J. (1977) ‘In defence of logic,’ in Proc. IJCAI 5, Morgan Kaufmann, pp. 559–565.
Hayes, P. J. (1985) ‘Ontology of liquids,’ in J. Hobbs and R. Moore, (eds.) Formal Theories of the Commonsense World, Ablex., pp. 71–107.
Herbrand, J. (1971) Logical Writings, Havard University Press.
Hoare, C. A. R. (1981) ‘The emperor's old clothes.’ CACM 24, 75–83.
Kowalski, R. and Hayes, P. J. (1971) ‘Lecture notes on automatic theorem proving,’ DCL Memo 40, University of Edinburgh.
Kowalski, R. (1979) ‘Algorithm = logic + control,’ CACM 22 424–436.
McDermott, D. (1978) ‘Tarskian semantics, or no notation without denotation,’ Cognitive Science 2, 277–282.
McDermott, D. (1982), ‘A temporal logic for reasoning about processes and plans,’ Cognitive Science 6, 101–155.
McSkimin, J. R. and Minker, J. (1977) ‘The use of a semantic network in a deductive question answering system,’ in Proc IJCAI 5, Cambridge, pp. 50–58.
Murray, N. V. (1982) ‘Completely non-clausal theorem proving,’ Artificial Intelligence 18, 67–85.
Mycroft, A. and O'Keefe, R. A. (1984) ‘A polymorphic type system for Prolog,’ Artificial Intelligence 23, 295–307.
Nevins, A. J. (1974) ‘A human oriented logic for automatic theorem proving,’ JACM 21, 606–621.
O'Keefe, R. A. (1984) ‘A new data structure for type trees,’ in Proc. ECAI, pp. 295–304.
Oberschelp, A. (1962) ‘Untersuchungen zur Mehrsortigen Quantorenlogik,’ Math. Annalen 145, 297–333.
Paterson, M. S. and Wegman, M. N. (1978) ‘Linear Unification,’ J. Computer and System Sciences, 158–167.
Reiter, R. (1981) ‘On the integrity of typed first order data bases,’ in H. Gallaire, J. Minker, J. M. Nicolas (eds.) Advances in Data Base Theory, Volume 1, Plenum Press., pp. 137–157.
Robinson, J. A. and Wos, L. T. (1969) ‘Paramodulation and theorem proving in first order theories with equality,’ in Machine Intelligence 4, Edinburgh University Press., pp. 135–150.
Robinson, J. A. (1979) Logic: Form and Function, Edinburgh University Press.
Schmidt, A. (1938) ‘Über deduktive Theorien mit mehreren Sorten von Grunddingen,’ Math. Annalen 115 485–506.
Schmidt, A. (1951) ‘Die Zuelassigkeit der Behandlung Mehrsortiger Theorien Mittels der Ublichen Einsortigen Pradikatenlogik,’ Math. Annalen 123 187–200.
Schmidt-Schauss, M. (1985) ‘A many sorted calculus with polymorphic functions based on resolution and paramodulation,’ Proc IJCAI, Morgan Kaufmann, pp. 1162–1168.
Shamir, A. and Wadge, W. W. (1977) ‘Data types as objects,’ Theory of Computation Report No 20, University of Warwick.
Stickel, M. E. (1984) ‘Automated deduction by theory resolution,’ Draft Report, SRI International.
Stickel, M. E. (1985) Schubert's Steamroller Problem: Formulations and Solutions, SRI International.
Strachey, C. (1967) ‘Fundamental concepts in programming languages,’. Unpublished notes for a NATO Summer School.
Ullman, S. (1975) ‘A model driven geometry theorem prover,’ A.I. Memo 321, MIT.
Walther, C. (1982) ‘A many sorted calculus based on resolution and paramodulation,’ Interner Bericht 34/82, Universität Karlsruhe.
Walther, C. (1983) ‘A many sorted calculus based on resolution and paramodulation,’ in IJCAI 8, Karlsruhe, Morgan Kaufmann, pp. 882–899.
Walther, C. (1984) ‘Unification in many sorted theories,’ Proc. ECAI, North-Holland, pp. 593–602.
Walther, C. (1985a) ‘A mechanical solution of Schubert's steamroller by many-sorted resolution,’ Artificial Intelligence 26, 217–224.
Walther, C. (1985b) ‘A classification of unification problems in many sorted theories,’ Interner Bericht 10/85, Universität Karlsruhe.
Wang, H. (1952) ‘Logic of many sorted theories, J. Symbolic Logic 17, 2, 105–116.
Weyhrauch, R. (1978) Lecture Notes for a Summer-School, Istitutio di Elaborazione dell'Informazione, Pisa.
Wilkins, D. (1973) ‘Quest: a non-clausal theorem proving system,’ Computer Science Memo-2, University of Essex.
Winograd, T. (1972) Understanding Natural Language, Academic Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cohn, A.G. A more expressive formulation of many sorted logic. J Autom Reasoning 3, 113–200 (1987). https://doi.org/10.1007/BF00243207
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00243207