Abstract
An extension to the system of semantic tableaux to deal with first-order logic with equality is introduced and proved sound and complete. This involves the use of partial unification, an operation which is based on unification without the presence of variables. We show, further, that semantic tableaux with partial unification provide a sound and complete proof method without needing the functionally reflexive axioms. We also give an example of an ordering rule which allows us to provide less complex proofs in the ground case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, R., ‘Completeness for E-resolution’, Proc. AFIPS 1970 Spring Joint Computer Conference, Vol. 36, pp. 653–656 (1970).
Boolos, G. S. and Jeffrey, R. C., Computability and Logic, Cambridge U. P. (1974).
Digricoli, V. J. and Harrison, M. C., ‘Equality-based binary resolution’, J.A.C.M., April 1986.
Digricoli, V. J., ‘The efficacy of RUE resolution: experimental results and heuristic theory’, Proc. IJCAI-81, Vancouver, August 1981.
Hintikka, J., ‘Form and content in quantification theory’, Acta Philosophica Fennica, 8 (1955).
Jeffrey, R. C., Formal Logic: Its Scope and Limits, McGraw-Hill (1967).
Popplestone, R., ‘Beth tree methods in automatic theorem proving’, Machine Intelligence 1, Oliver and Boyd, pp. 31–46 (1967).
Reeves, S. V., ‘An introduction to semantic tableaux’, CSM-55, Department of Computer Science, University of Essex (1983).
Reeves, S. V., ‘A note on functional reflexivity in semantic tableaux with partial unification’, Department of Computer Science and Statistics, Queen Mary College, University of London, June 1985.
Shostak, R. E., ‘An algorithm for reasoning about equality’, C.A.C.M. 21, 583–585 (1978).
Smulyan, R. M., First-order Logic, Ergebnisse der Mathematik, Vol. 43, Springer-Verlag (1968).
Wallen, L., ‘Generating connection calculi from tableaux and sequent based proof systems’, Proc. A.I.S.B. pp. 66–77 (1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reeves, S.V. Adding equality to semantic tableaux. J Autom Reasoning 3, 225–246 (1987). https://doi.org/10.1007/BF00243790
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00243790