Abstract
We have been developing an automated deduction system based on path dissolution, an operation that was first introduced in [7]. Preliminary experimental results are promising. The next major phase in the development of that system will be the inclusion of a “theory-link processor.” In this paper, we describe those experimental results and some of the meta theory required for that next phase.
This research was supported in part under grant CCR-8600848 awarded by the National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andrews, P.B. Theorem proving via general matings. J.ACM 28,2 (April 1981), 193–214.
Bibel, W. Tautology testing with a generalized matrix reduction method. Theoretical Computer Science 8 (1979) 31–44.
de Champeaux, D. Sub-problem finder and instance checker, two cooperating modules for theorem provers. J.ACM 33,4 (1986), 633–657.
Haken, A. The intractability of resolution. Theoretical Computer Science, 39 (1985), 297–308.
Lusk, E., and Overbeek, R. A portable environment for research in automated reasoning. Proceedings of CADE-7, Napa, CA, May 14–16, 1984. In Lecture Notes in Computer Science, Springer-Verlag, Vol. 170, 43–52.
Murray, N.V., and Rosenthal, E. Inference with Path Resolution and Semantic Graphs. J.ACM 34,2 (April 1987), 225–254.
Murray, N.V., and Rosenthal, E. Path dissolution: A strongly complete rule of inference. Proceedings of the 6 th National Conference on Artificial Intelligence, Seattle, WA, July 12–17, 1987, 161–166.
Murray, N.V., and Rosenthal, E. Inferencing on an arbitrary set of links. Proceedings of the 2 nd International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, October 1987. In Methodologies for Intelligent Systems, (Ras, Z. and Zemankova, M., eds.) North-Holland, 1987, 416–423.
Murray, N.V., Rosenthal, E. Theory links in semantic graphs. Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 1986. In Lecture Notes in Computer Science, Springer-Verlag, Vol. 230, 353–364.
Pelletier, F.J. Seventy-Five Problems for Testing Automatic Theorem-Provers. Journal of Automated Reasoning 2 (1986) 191–216.
Robinson, J.A. Automatic deduction with hyper-resolution. International Journal of Computer Mathematics, 1 (1965), 227–234.
Stickel, M.E. Automated deduction by theory resolution. J. Automated Reasoning, 1,4 (1985), 333–355.
Stickel, M.E. A Prolog technology theorem prover: implementation by an extended Prolog compiler. Proceedings of the 8 th International Conference on Automated Deduction, Oxford, England, July 1986. In Lecture Notes in Computer Science, Springer-Verlag, Vol. 230, 573–587.
Stickel, M.E. Personal Communication. November 1987.
Tseitin, G. S. On the complexity of derivations in propositional calculus. Structures in Constructive Mathematics and Mathematical Logic, Part II, A. O. Sliosenko, ed. (1968), 115–125.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murray, N.V., Rosenthal, E. (1988). An implementation of a dissolution-based system employing theory links. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012864
Download citation
DOI: https://doi.org/10.1007/BFb0012864
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive