Skip to main content
SpringerLink
Log in

SPIKE, an automatic theorem prover

  • System Descriptions
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

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

References

  1. L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proceedings 1st IEEE Symposium on Logic in Computer Science, Cambridge (Massachusetts, USA), pages 346–357. IEEE, 1986.

    Google Scholar 

  2. A. Bouhoula, E. Kounalis, and M. Rusinowitch. Automated mathematical induction. Technical Report 1636, INRIA, 1992.

    Google Scholar 

  3. A. Bouhoula. Preuve automatique par paramodulation, réécriture et induction. Rapport interne 91-R-204, Centre de Recherche en Informatique de Nancy, Vandœuvre-lès-Nancy, 1991.

    Google Scholar 

  4. B. el Ayeb, P. Marquis, and M. Rusinowitch. Conjecturing diagnoses. Technical Report 92-LE-LAB-001, Université Sherbrooke, Canada, January 1992. Submitted.

    Google Scholar 

  5. J. Hsiang and M. Rusinowitch. Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method. Journal of the Association for Computing Machinery, 38(3):559–587, July 1991.

    Google Scholar 

  6. E. Kounalis and M. Rusinowitch. On word problem in Horn logic. In J.-P. Jouannaud and S. Kaplan, editors, Proceedings 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of LNCS, pages 144–160. Extended version in Journal of Symbolic Computation, 11(1 & 2), 1991.

    Google Scholar 

  7. E. Kounalis and M. Rusinowitch. Mechanizing inductive reasoning. Bulletin of European Association for Theoretical Computer Science, 41:216–226, June 1990.

    Google Scholar 

  8. P. Lescanne. Implementation of completion by transition rules + control: ORME. In H. Kirchner and W. Wechler, editors, Proceedings 2nd International Workshop on Algebraic and Logic Programming, Nancy (France), volume 463 of LNCS, pages 262–269. Springer-Verlag, 1990.

    Google Scholar 

  9. Pelletier, Francis, and Jeffry. Seventy five problems for testing automatic theorem provers. Journal of Automated Reasoning, pages 191–216, 1986.

    Google Scholar 

  10. Projet Formel Inria. The CAML Reference Manual, March 1989. Version 2.6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIN & INRIA-Lorraine, BP 239, 54506, Vandœuvre-lès-Nancy, France

    Adel Bouhoula & Michaël Rusinowitch

  2. LIR, BP 118, 76134, Mont-St-Aignan, France

    Emmanuel Kounalis

Authors
  1. Adel Bouhoula
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuel Kounalis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michaël Rusinowitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouhoula, A., Kounalis, E., Rusinowitch, M. (1992). SPIKE, an automatic theorem prover. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013087

Download citation

  • DOI: https://doi.org/10.1007/BFb0013087

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation