Refinement theorems in resolution theory-Reference-Cited by-同舟云学术

Refinement theorems in resolution theory

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

Author:

Luckham David

Publisher

Springer Berlin Heidelberg

Link

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

Reference9 articles.

1. Andrews, P. B., "Resolution with Merging", JACM, 15, No. 3, pp. 367–381, July 1968.

2. Luckham, D., "The Resolution Principle in Theorem-Proving", Machine Intelligence 1, Collins and Michie (Eds), American Elsevier Inc., New York, 1967.

3. Luckham, D., "Some Tree-Paring Strategies for Theorem-Proving", Machine Intelligence 3, D. Michie (Ed), Edinburgh University Press, pp. 95–112, 1968.

4. Robinson, J. A., "A Machine-Oriented Logic Based on the Resolution Principle", JACM, 12, No. 1, pp. 23–41, January 1965.

5. Robinson, J. A., "Automatic Deduction with Hyper-Resolution", International Journal of Computer Mathematics, Vol. 1, pp. 227–234, 1965.

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

1. A Survey of the Proof-Theoretic Foundations of Logic Programming;Theory and Practice of Logic Programming;2021-11-18

2. Multi-ary α-ordered linear minimal resolution method in lattice-valued logic system1;Journal of Intelligent & Fuzzy Systems;2018-03-22

3. Deductive logic in solving computer knowledge representation;Izvestiya MGTU MAMI;2014-09-10

4. α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic;International Journal of Computational Intelligence Systems;2014

5. Logic Programming in the 1970s;Logic Programming and Nonmonotonic Reasoning;2013