Abstract
A brief account of the basic ideas and advantages of many-sorted first-order logic is given. Based on this survey, a many-sorted version of a resolution calculus is proposed. The advantages of such a calculus and the problems related to its definition are illustrated with several examples. We also discuss the problems, which arise when extending this calculus with equality reasoning and present a many-sorted version of the paramodulation rule. We show how the structure of a sort hierarchy influences the inferences of our many-sorted calculus and discuss the ways to state certain axioms of a theorem proving problem by an adequate definition of a sort hierarchy. We conclude with a brief survey on related work.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
AIT-KACKI, H. and NASR, R.LOGIN: A Logic Programming Language with Built-in Inheritance. J. Logic Programming, vol 3, no 3, 1986
CHAMPEAUX, D. DeA Theorem Prover Dating a Semantic Network. Proceedings of the AISB/GI Conference, Hamburg, 1978
CHANG, C.-L. and LEE, R. C.-T.Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973
COHN, A. G.A More Expressive Formulation of Many-Sorted Logic. J. Automated Reasoning, vol 3, no 2, 1987
CUNNINGHAM, R. J. and DICK, A. J. J.Rewrite systems on a lattice of types. Acta Informatica, vol 22, no 2, 1985
ENDERTON, H.A Mathematical Introduction to Logic. Academic Press, Orlando 1972
FAGES, F. and HUET, D.Complete Sets of Unifiers and Matchers in Equational Theories. Proceedings of the 8th CAAP, Lecture Notes in Computer Science 159, L'Aquila, 1983
FRISCH, A. M.An Investigation into Inference with Restricted Quantification and a Taxonomic Representation. SIGART Newsletter 91, 1985 (a)
FRISCH, A. M.Parsing with Restricted Quantification. Proc. of the AISB Conference, 1985 (b)
GOGUEN, J. A., JOUANNAUD, J.-P. and MESEGUER, J.Operational Semantics for Order-Sorted Algebra. Proceedings of the 12th ICALP, Lecture Notes in Computer Science 194, Springer-Verlag, 1985
HAYES, P.A Logic of Actions. Machine Intelligence 6, 1971
HENSCHEN, L. J.N-Sorted Logic for Automatic Theorem Proving in Higher Order Logic. Proceedings of the ACM Conference, Boston, 1972
HUBER, M. and VARSEK, I.Extended Prolog for Order-Sorted Resolution. Proceedings of the 1987 Symposium on Logic Programming, San Francisco, 1987
LOVELAND, D. W.Automated Theorem Proving: A Logical Basis. North-Holland Publishing Company, 1978
OBERSCHELP, AUntersuchungen zur mehrsortigen Quantorenlogik. Mathematische Annalen 145, 1962
PLOTKIN, G.Building-in Equational Theories. Machine Intelligence 7, 1972
ROBINSON, J. A.A Machine-Oriented Logic Based on the Resolution Principle. J. ACM, vol 12, no 1, 1965, also in: Automation of Reasoning — Classical Papers on Computational Logic, vol 1. J. Siekmann and G. Wrightson, Eds., Springer-Verlag, 1983
SCHMIDT-SCHAUSS, M.A Many-Sorted Calculus with Polymorphic Functions based on Resolution and Paramodulation. Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI.85), Los Angeles, 1985 (a)
SCHMIDT-SCHAUSS, M.Mechanical Generation of Sorts in Clause Sets. MEMO SEKI-85-VI-KL, Fachbereich Informatik, Universität Kaiserslautern, 1985 (b)
SCHMIDT-SCHAUSS, M.Unification in Many-Sorted Equational Theories. Proceedings of the 8th International Conference on Automated Deduction (CADE-86), Lecture Notes in Computer Science 230, Springer-Verlag, 1986
SIEKMANN, J.Universal Unification. Proceedings of the 7th International Conference on Automated Deduction (CADE-84), Lecture Notes in Computer Science 170, Springer-Verlag, 1984
WALTHER, C.The Markgraf Karl Refutation Procedure: PLL — A First-Order Language for an Automated Theorem Prover. Interner Bericht 35/82, Institut für Informatik I, Universität Karlsruhe, 1982
WALTHER, C.A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution. Proceedings of the 4th National Conference on Artificial Intelligence (AAAI-84), Austin, 1984, revised version in: Artificial Intelligence, vol 26, no2, 1985
WALTHER, C.A Classification of Many-Sorted Unification Problems. Proceedings of the 8th International Conference on Automated Deduction (CADE-86), Lecture Notes in Computer Science 230, Springer-Verlag, 1986, revised version appeared as: Many-Sorted Unification, J. ACM, vol 35, no 1, 1988
WALTHER, C.A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence, Pitman, London, and Morgan Kaufmann, Los Altos, 1987
WALTHER, C.Automatisches Beweisen. In: Künstliche Intelligenz — Theoretische Grundlagen und Anwendungsfelder, Th. Christaller, H.-W. Hein und M. M. Richter (Hrsg.), Frühjahrsschulen Dassel 1985 und 1986, Informatik Fachberichte 159, Springer-Verlag, 1987 (a)
WEYHRAUCH, R. W.FOL: A Proof Checker for First-Order-Logic. MEMO AIM-235.1, Stanford Artificial Intelligence Laboratory, Stanford University, 1977
WOS. L. and ROBINSON, G.Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving. In: Wordproblems. W: W. Boone, F. B. Cannonito and R. C. Lyndon, Eds., North-Holland, 1973, also in: Automation of Reasoning — Classical Papers on Computational Logic, vol 2. J. Siekmann and G. Wrightson, Eds., Springer-Verlag, 1983
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walther, C. (1990). Many-sorted inferences in automated theorem proving. In: Bläsius, K.H., Hedtstück, U., Rollinger, CR. (eds) Sorts and Types in Artificial Intelligence. Lecture Notes in Computer Science, vol 418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52337-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-52337-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52337-6
Online ISBN: 978-3-540-46965-0
eBook Packages: Springer Book Archive