×

zbMATH — the first resource for mathematics

Theorem proving with abstraction. (English) Zbl 0454.68113

MSC:
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bledsoe, W.W., Non-resolution theorem proving, Artificial intelligence, 9, 1, 1-35, (1977) · Zbl 0358.68131
[2] Boyer, R.S., Locking, a restriction of resolution, ()
[3] Chang, C.L.; Lee, R.C., ()
[4] Henschen, L.; Wos, L., Unit refutations and Horn sets, J. ACM, 21, 590-605, (1974) · Zbl 0296.68093
[5] Kling, R.E., A paradigm for reasoning by analogy, Artificial intelligence, 2, 147-178, (1971) · Zbl 0227.68041
[6] Kowalski, R., The case for using equality axioms in automatic demonstration, (), 112-127
[7] Luckham, D., Refinement theorems in resolution theory, (), 163-190 · Zbl 0216.24101
[8] Munyer, J.C., Towards the use of analogy in deductive tasks, (1979), University of California at Santa Cruz
[9] Plaisted, D.A., Abstraction mappings in mechanical theorem proving, (), 264-280 · Zbl 0442.68096
[10] Reboh, R.; Raphael, B.; Yates, R.A.; Kling, R.E.; Velarde, C., Study of automatic theorem proving programs, ()
[11] Robinson, J.A., Automatic deduction with hyper-resolution, Int. J. comput. math., 1, 227-234, (1965) · Zbl 0158.26003
[12] Robinson, J.A., A review of automatic theorem proving, (), 1-18 · Zbl 0174.29202
[13] Sacerdoti, E.D., Planning in a hierarchy of abstraction spaces, Artificial intelligence, 5, 115-135, (1974) · Zbl 0288.68052
[14] Slagle, J.R., Automatic theorem proving with renameable and semantic resolution, J. ACM, 14, 687-697, (1967) · Zbl 0157.02405
[15] Wos, L.; Robinson, G.A.; Carson, D.F., Efficiency and completeness of the set of support strategy in theorem proving, J. ACM, 12, 536-541, (1965) · Zbl 0135.18401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.