The case for using equality axioms in automatic demonstration-Reference-Cited by-同舟云学术

The case for using equality axioms in automatic demonstration

Published:1970 Issue: Volume: Page:112-127
ISSN:0075-8434
Container-title:Symposium on Automatic Demonstration
language:
Short-container-title:

Author:

Kowalski Robert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0060628

Reference21 articles.

1. Andrews, P.B.,, "Resolution with Merging", Journal of the Association for Computing Machinery, 15, 367–381, July 1968.

2. Brown, T.C. Jr., "Resolution with Covering strategies and Equality Theory", internal memorandum, California Institute of Technology, 1968.

3. Chang, C.L., "Renamable Paramodulation for Automatic Theorem-Proving with Equality", internal memorandum, National Institutes of Health, Bethesda, Maryland, 1969.

4. Darlington, J.L., "Automatic Theorem-Proving with Equality Substitutions and Mathematical Induction", Machine Intelligence 3, edited D. Michie, Edinburgh University Press, 113–127, 1968.

5. Hayes, P.J., and Kowalski, R., "Semantic Trees in Automatic Theorem-Proving", Machine Intelligence 4, edited B. Meltzer and D. Michie, Edinburgh University Press, 1969.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Steps Toward a Computational Metaphysics;Journal of Philosophical Logic;2007-02-15

2. Automated Abduction;Computational Logic: Logic Programming and Beyond;2002

3. An inference method for the complete inverse of relative subsumption;New Generation Computing;1999-03

4. Learning Horn definitions: Theory and an application to planning;New Generation Computing;1999-03

5. Which hypotheses can be found with inverse entailment?;Inductive Logic Programming;1997