CADE 1988: 9th International Conference on Automated Deduction pp 658-674 | Cite as
An implementation of a dissolution-based system employing theory links
Conference paper
First Online:
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.
Keywords
Theorem Prover Conjunctive Normal Form Conjunctive Normal Form Formula Theory Link Semantic Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Andrews, P.B. Theorem proving via general matings. J.ACM 28,2 (April 1981), 193–214.CrossRefGoogle Scholar
- 2.Bibel, W. Tautology testing with a generalized matrix reduction method. Theoretical Computer Science 8 (1979) 31–44.CrossRefGoogle Scholar
- 3.de Champeaux, D. Sub-problem finder and instance checker, two cooperating modules for theorem provers. J.ACM 33,4 (1986), 633–657.CrossRefGoogle Scholar
- 4.Haken, A. The intractability of resolution. Theoretical Computer Science, 39 (1985), 297–308.CrossRefGoogle Scholar
- 5.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.Google Scholar
- 6.Murray, N.V., and Rosenthal, E. Inference with Path Resolution and Semantic Graphs. J.ACM 34,2 (April 1987), 225–254.CrossRefGoogle Scholar
- 7.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.Google Scholar
- 8.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.Google Scholar
- 9.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.Google Scholar
- 10.Pelletier, F.J. Seventy-Five Problems for Testing Automatic Theorem-Provers. Journal of Automated Reasoning 2 (1986) 191–216.Google Scholar
- 11.Robinson, J.A. Automatic deduction with hyper-resolution. International Journal of Computer Mathematics, 1 (1965), 227–234.Google Scholar
- 12.Stickel, M.E. Automated deduction by theory resolution. J. Automated Reasoning, 1,4 (1985), 333–355.CrossRefGoogle Scholar
- 13.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.Google Scholar
- 14.Stickel, M.E. Personal Communication. November 1987.Google Scholar
- 15.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.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1988