Inductive theorem proving by consistency for first-order clauses-Reference-Cited by-同舟云学术

Inductive theorem proving by consistency for first-order clauses

Published:1993 Issue: Volume: Page:226-241
ISSN:0302-9743
Container-title:Conditional Term Rewriting Systems
language:
Short-container-title:

Author:

Ganzinger Harald,Stuber Jürgen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56393-8_17.pdf

Reference20 articles.

1. Leo Bachmair. Proof by consistency in equational theories. In Proc. 3rd IEEE Symp. on Logic in Computer Science, pages 228–233, Edinburgh, July 1988.

2. LNCS 449;L. Bachmair,1990

3. Leo Bachmair and Harald Ganzinger. Completion of first-order clauses with equality by strict superposition. In Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, Montreal, June 1990. Springer LNCS 516.

4. Leo Bachmair and Harald Ganzinger. Perfect model semantics for logic programs with equality. In Proc. 8th Int. Conf. on Logic Programming. MIT Press, 1991.

5. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Technical Report MPI-I-91-208, Max-Planck-Institut für Informatik, Saarbrücken, August 1991.

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

1. Narrowing Based Inductive Proof Search;Programming Logics;2013

2. Harald Ganzinger’s Legacy: Contributions to Logics and Programming;Programming Logics;2013

3. Predicate Completion for non-Horn Clause Sets;Lecture Notes in Computer Science;2011

4. Decidability Results for Saturation-Based Model Building;Automated Deduction – CADE-22;2009

5. SPASS Version 3.5;Automated Deduction – CADE-22;2009