On the use of conditional rewrite rules in inductive theorem proving

  • Laurent Fribourg
Part 1 Research Articles
Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)


Theorem Prove Critical Pair Correctness Proof Inductive Property Ground Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bachmair et al. 86]
    [Bachmair et al. 86] Bachmair, L., Dershowitz, N., Hsiang, J. Ordering for Equational Proofs, 1st Symposium on Logic in Computer Science, Cambridge, pp. 346–357, 1986.Google Scholar
  2. [Bergstra & Klop 86]
    Bergstra, J., Klop, J.W. Conditional Rewrite Rules: Confluence and Termination, Journal of Computer and System Sciences 32, pp. 323–362, 1986.CrossRefGoogle Scholar
  3. [Boyer & Moore 79]
    Boyer, R., Moore, J.S. A Computational Logic. Academic Press, 1979.Google Scholar
  4. [Fribourg 86]
    Fribourg, L. A Strong Restriction of the Inductive Completion Procedure, 13th Intl. Colloquium on Automata, Languages and Programming, pp. 105–115, Rennes, 1986. (also to appear in J. Symbolic Computation).Google Scholar
  5. [Ganzinger 87]
    Ganzinger, H. A Completion Procedure for Conditional Equational Specifications. Technical Report, U. of Dortmund, 1987.Google Scholar
  6. [Hsiang & Rusinowitch 87]
    Hsiang, J., Rusinowitch, M., On Word Problems in Equational Theories, 14th Intl. Colloquium on Automata, Languages and Programming, Karlsruhe, 1987.Google Scholar
  7. [Huet & Hullot 80]
    Huet, G., Hullot, J.M. Proofs by Induction in Equational Theories with Constructors. 21st Annual Symp. on Foundations of Computer Science, pp. 96–107, 1980.Google Scholar
  8. [Jouannaud & Kounalis 86]
    Jouannaud, J.P., Kounalis, E. Proofs by Induction in Equational Theories Without Constructors. Symp. on Logic in Computer Science, Cambridge (MA), pp. 358–366, 1986.Google Scholar
  9. [Kaplan 84a]
    Kaplan, S. Conditional Rewrite Rules. Theoretical Computer Science 33, 175–193, 1984.CrossRefGoogle Scholar
  10. [Kaplan 84b]
    Kaplan, S. Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence. Rept. 194, L.R.I., U. of Orsay, 1984.Google Scholar
  11. [Kuechlin 87]
    Kuechlin, W. Inductive Completion by Ground Proof Transformation. Rept. 87-08, U. of Delaware, 1987.Google Scholar
  12. [Robinson & Wos 69]
    Robinson., G., Wos, L. Paramodulation and Theorem Proving in First Order Theories with Equality, Machine Intelligence 4, Meltzer and Michie, eds., Edinburgh University Press, pp. 135–150, 1969.Google Scholar
  13. [Smith 85]
    Smith, D.R. Reasoning by Cases and the Formation of Conditional Programs. Intl. Joint Conf. on Artificial Intelligence, Los Angeles, pp. 215–218, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Laurent Fribourg
    • 1
  1. 1.L.I.E.N.S.ParisFrance

Personalised recommendations