Skip to main content

Str+ve\(\subseteq\): The Str+ve-based subset prover

  • Conference paper
  • First Online:
10th International Conference on Automated Deduction (CADE 1990)

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

Included in the following conference series:

  • 166 Accesses

Abstract

Str+ve [7], a prover for inequalities, employs a highly restrictive and successful strategy for implementing the transitivity property of < and the interpolation axiom of the reals. In str+ve, transitivity is carried out by chaining and interpolation by variable elimination. Since the subset relation is also transitive, a slightly altered version of chaining can carry out that property for subset as well. But interpolation does not hold for the subset relation. Nonetheless, we can apply a version of variable elimination.

In this way, we are designing a theorem prover, str+ve \(\subseteq\), which incorporates the strategy behind str+ve in order to handle formulas with set predicates.

This work supported by National Science Foundation Grant CCR-8613 706.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bledsoe, W. W., “The Sup-Inf Method in Presburger Arithmetic”. The University of Texas at Austin, Math Department Memo ATP-18. December 1974. Essentially the same as: A new method for proving certain Presburger formulas. Fourth IJCAI, Tbilisi, USSR, September 3–8, 1975.

    Google Scholar 

  2. Bledsoe, W. W., “A Maximal Method for Set Variables in Automatic Theorem Proving”, Machine IJntelligence 9, (J. E. Hayes, D. Michie and L. I. Mikulich, eds.), Ellis Harwood Lim., Chichester, (1979) 53–100.

    Google Scholar 

  3. Bledsoe W. W., “Journal Ready Proofs: A New Standard for Interactive Proof Presentation”, Univ of Texas CS Dept Memo, ATP 88, (August 1989).

    Google Scholar 

  4. Bledsoe, W. W., “The Paracompactness Theorem”, Univ of Texas CS Dept Memo, ATP 96, (June 1989).

    Google Scholar 

  5. Bledsoe, W. W., and L. M. Hines, “Variable Elimination and Chaining in a Resolution-Base Prover for Inequalities”, Proc. 5th Conference on Automated Deduction, Les Arcs, France, Springer-Verlag, (July 1980) 70–87.

    Google Scholar 

  6. Feng, Guohui, “Hand Proofs of the Compact-Hausdorff-Regular Theorem and the Attains Maximum Theorem”, Univ of Texas CS Dept Memo, ATP 98, (August 1989).

    Google Scholar 

  7. Hines, L. M., and W. W. Bledsoe, “The Str+ve Prover”, Technical Report ATP-100, University of Texas, Austin, (August 1989).

    Google Scholar 

  8. Kelley, John L., General Topology, D. Van Nostrand Company, Inc., Princeton, New Jersey, (1955).

    Google Scholar 

  9. Rabinov, A., “A Restriction of Factoring in Binary Resolution.” Proc. 9th International Conference of Automated Deduction, Argonne, Illinois, USA, Springer-Verlag, (May 1988) 582–591.

    Google Scholar 

  10. Slagle, James R., “Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets”, Journal of ACM, Vol 19, No 1, (January 1972), 120–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mark E. Stickel

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hines, L. (1990). Str+ve\(\subseteq\): The Str+ve-based subset prover. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-52885-7_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47171-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics