Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation-Reference-Cited by-同舟云学术

Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation

Published:1991 Issue: Volume: Page:181-193
ISSN:0302-9743
Container-title:Conditional and Typed Rewriting Systems
language:
Short-container-title:

Author:

Bertling Hubert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54317-1_90.pdf

Reference13 articles.

1. L. Bachmair. Proof Methods for Equational Theories. PhD thesis, University of Illinois at Urbana-Champaign, USA, 1987.

2. L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. of the 1st IEEE Symposium on Logic in Computer Science, Boston, MA, pp. 346–357, 1986.

3. H. Bertling. Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation. PhD thesis, FB Informatik, Universität Dortmund, 1990.

4. H. Bertling and H. Ganzinger. Completion-Time Optimization of Rewrite-Time Goal Solving. In Proc. of the 3rd International Conference on Rewriting Techniques and Applications, Chapel Hill, LNCS 355, pp. 45–58, Berlin-Heidelberg-New York, April 1989. Springer-Verlag.

5. N. Dershowitz and J.P. Jounannaud. Rewrite Systems. In Handbook of Theoretical Computer Science, Volume B, Chapter 15. North-Holland, 1989.

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

1. Linear and unit-resulting refutations for Horn theories;Journal of Automated Reasoning;1996-06

2. Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation;Conditional and Typed Rewriting Systems;1991

3. Canonical sets of horn clauses;Automata, Languages and Programming;1991