METEORs: High Performance Theorem Provers using Model Elimination-Reference-Cited by-同舟云学术

METEORs: High Performance Theorem Provers using Model Elimination

Published:1991 Issue: Volume: Page:31-59
ISSN:0927-1023
Container-title:Automated Reasoning Series
language:
Short-container-title:

Author:

Astrachan O. L.,Loveland D. W.

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-011-3488-0_2.pdf

Reference35 articles.

1. Khayri A. M. Ali and Roland Karlsson (1990): The Muse Or-Parallel Prolog Model and Its Performance North American Conference on Logic Programming, 757–776.

2. Owen Astrachan (1989): METEOR: Model Elimination Theorem-proving for Efficient OR-parallelism. Master’s thesis. Duke University.

3. R. Bayer and M. Schkolnick (1977): Concurrency of Operations in B-trees. Acta Informatica 9, 1–21.

4. W. Bibel (1990): Short Proofs of the Pigeonhole Formulas Based on the Connection Method. Journal of Automated Reasoning 6, 287–297.

5. W. W. Bledsoe (1990): Challenge Problems in Elementary Calculus. Journal of Automated Reasoning 6(3), 341–359.

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

1. Parallel Theorem Proving;Handbook of Parallel Constraint Reasoning;2018

2. Advances in Connection-Based Automated Theorem Proving;NASA Monographs in Systems and Software Engineering;2017

3. Octopus: Combining Learning and Parallel Search;Journal of Automated Reasoning;2004-09

4. A Taxonomy of Theorem-Proving Strategies;Artificial Intelligence Today;1999

5. On semantic resolution with lemmaizing and contraction and a formal treatment of caching;New Generation Computing;1998-06