Skip to main content
SpringerLink
Log in

On the use of conditional rewrite rules in inductive theorem proving

  • Part 1 Research Articles
  • Conference paper
  • First Online:
Conditional Term Rewriting Systems (CTRS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 308))

Included in the following conference series:

  • 132 Accesses

(Extended Abstract)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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, J., Klop, J.W. Conditional Rewrite Rules: Confluence and Termination, Journal of Computer and System Sciences 32, pp. 323–362, 1986.

    Article  Google Scholar 

  3. Boyer, R., Moore, J.S. A Computational Logic. Academic Press, 1979.

    Google Scholar 

  4. 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, H. A Completion Procedure for Conditional Equational Specifications. Technical Report, U. of Dortmund, 1987.

    Google Scholar 

  6. Hsiang, J., Rusinowitch, M., On Word Problems in Equational Theories, 14th Intl. Colloquium on Automata, Languages and Programming, Karlsruhe, 1987.

    Google Scholar 

  7. 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, 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, S. Conditional Rewrite Rules. Theoretical Computer Science 33, 175–193, 1984.

    Article  Google Scholar 

  10. Kaplan, S. Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence. Rept. 194, L.R.I., U. of Orsay, 1984.

    Google Scholar 

  11. Kuechlin, W. Inductive Completion by Ground Proof Transformation. Rept. 87-08, U. of Delaware, 1987.

    Google Scholar 

  12. 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, 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 

Download references

Author information

Authors and Affiliations

  1. L.I.E.N.S., 45 rue d'Ulm, 75005, Paris, France

    Laurent Fribourg

Authors
  1. Laurent Fribourg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Kaplan J. -P. Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fribourg, L. (1988). On the use of conditional rewrite rules in inductive theorem proving. In: Kaplan, S., Jouannaud, J.P. (eds) Conditional Term Rewriting Systems. CTRS 1987. Lecture Notes in Computer Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19242-5_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-19242-5_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19242-8

  • Online ISBN: 978-3-540-39166-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation