On semantic resolution with lemmaizing and contraction and a formal treatment of caching-Reference-Cited by-同舟云学术

On semantic resolution with lemmaizing and contraction and a formal treatment of caching

Published:1998-06 Issue:2 Volume:16 Page:163-200
ISSN:0288-3635
Container-title:New Generation Computing
language:en
Short-container-title:NGCO

Author:

Bonacina Maria Paola,Hsiang Jieh

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Link

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

Reference37 articles.

1. number 516 in Lecture Notes in Computer Science;S. Anantharaman,1990

2. Anantharaman, S. and Hsiang, J., “Automated Proofs of the Moufang Identities in Alternative Rings,”Journal of Automated Reasoning, 6, 1, pp. 76–109, 1990.

3. Astrachan, O. L., “Investigations in Theorem Proving Based on Model Elimination,”Ph.D. thesis, Department of Computer Science, Duke University, 1992.

4. Automated Reasoning Series;O. L. Astrachan,1991

5. Technical Report;O. L. Astrachan,1992

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

1. Set of Support, Demodulation, Paramodulation: A Historical Perspective;Journal of Automated Reasoning;2022-05-24

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

3. On First-Order Model-Based Reasoning;Lecture Notes in Computer Science;2015

4. The Relative Power of Semantics and Unification;Programming Logics;2013

5. Towards a unified model of search in theorem-proving: subgoal-reduction strategies;Journal of Symbolic Computation;2005-02