Skip to main content
SpringerLink
Log in

Violet

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Violet is an easy-to-use theorem prover based on locking resolution, with integrated equality extensions that use term rewriting and Knuth–Bendix completion. Violet participated in the CADE-13 ATP System Competition.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boyer, R. S.: Locking: A Restriction of Resolution, PhD thesis, University of Texas at Austin, 1970.

  2. Brand, D.: Proving theorems with the modification method, SIAM Journal on Computing 4 (1975), 412–430.

    Google Scholar 

  3. Charniak, E., Riesbek, C. R. and McDermott, D. V.: Artificial Intelligence Programming, Lawrence Erlbaum, Hillsdale, NJ, 1980.

    Google Scholar 

  4. Franz, Inc.: Allegro CL User Guide, Berkeley, California, 1996 (Lisp Version 4.3).

  5. Greenbaum, S.: Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic, PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1986.

  6. Knuth, D. E. and Bendix, P. B.: Simple word problems in universal algebras, in Computational Problems in Abstract Algebra, Pergamon, Oxford, U.K., 1970, pp. 263–297.

    Google Scholar 

  7. McCune, W. W. and Wos, L.: Otter: The CADE-13 competition incarnations, Journal of Automated Reasoning 18(2) (1997).

  8. Plaisted, D. and Greenbaum, S.: A structure-preserving clause form translation, Journal of Symbolic Computation 2 (1986), 293–304.

    Google Scholar 

  9. Robinson, G. and Wos, L.: Paramodulation and theorem-proving in first order theories with equality, in Machine Intelligence 4, Edinburgh University Press, Edinburgh, Scotland, 1969, pp. 135–150.

    Google Scholar 

  10. Robinson, J. A.: Automatic deduction with hyper-resolution, International Journal of Computer Mathematics 1 (1965), 227–234.

    Google Scholar 

  11. Sutcliffe, G. and Suttner, C. B.: The results of the CADE-13 ATP system competition, Journal of Automated Reasoning 18(2) (1997).

  12. Wos, L., Robinson, G. and Carson, D.: Efficiency and completeness of the set of support strategy in theorem proving, Journal of the Association for Computing Machinery 12 (1965), 536–541.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hewlett-Packard Laboratories, 1501 Page Mill Road, MS 4A-D, Palo Alto, CA, 94304-1126, USA

    Steve Greenbaum

Authors
  1. Steve Greenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Greenbaum, S. Violet. Journal of Automated Reasoning 18, 259–264 (1997). https://doi.org/10.1023/A:1005820421829

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005820421829

Search

Navigation