skip to main content
10.1145/143559.150707acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article
Free Access

Proving functionally difficult problems through model generation

Published:01 April 1992Publication History
First page image

References

  1. CH73.Chang, C., and R. Char-Tung Lee, Svmboli; Lo~ and Mec.henical Theorem Provina. Academic Preee, Inc., 1973, Orlando. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. LU85.Lusk, E., and R. Overbeek, "Logic Problems", Aeeociation of Automated ReaeQnir~ Newsletter, No. 4, 1985, p. 7, Association of Automated Reasoning.Google ScholarGoogle Scholar
  3. MA88.Manthey, R. and F. Bry, "SATCHMO: a Theorem Prover Implemented in Prolog", Lecture notes in Comouter Science Vol.31 O, E. Luck end R. Overbeek, erie., from the Ninth international Conference on Automated Deduction, pp. 415-434, Springer-Verlag, NY, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. MO85.Morgan, C., "Logic Problems", A~ooiati~n Automated Re~eoninu NewMetter, No. 3, 1985 p.4, Association of Automated Reasoning.Google ScholarGoogle Scholar
  5. PE86.Pelfetier, F.J., "Seventy-Five Probleme for Testing Automatic Theorem Provers", pp. 191 - 216,~of Aptomated Reasonina, Volume 2, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. RA91.Rankin, R., and R. Wilker,on, "Verification of Results end Correction of SATCHMO", Toohnical Report ~, Department of Computer Science, University of Miseouri-Rolla, March, 1991.Google ScholarGoogle Scholar

Index Terms

  1. Proving functionally difficult problems through model generation

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SAC '92: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
          April 1992
          1296 pages
          ISBN:089791502X
          DOI:10.1145/143559

          Copyright © 1992 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 April 1992

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate1,650of6,669submissions,25%
        • Article Metrics

          • Downloads (Last 12 months)7
          • Downloads (Last 6 weeks)1

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader