Skip to main content
SpringerLink
Log in

The semantics of answer literals

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

Abstract

We describe a semantics for answer literals that is not tied to the specific detaisl of the resolution proof procedure. We also describe a number of applications of answer literals to mathematical theorem proving.

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. Bruck, R. H.: A Survey of Binary Systems, Springer-Verlag, 1958.

  2. Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

  3. Fitting, M.: First-Order Logic and Automated Theorem Proving, Springer-Verlag, 1990.

  4. Green, C.: Theorem proving by resolution as a basis for question-answering systems, in B. Meltzer and D. Michie (eds), Machine Intelligence, Vol. 4, 1969, pp. 183–205.

  5. HuntingtonE.: New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell's Principia Mathematica, AMS Transactions 35 (1933), 274–304.

    Google Scholar 

  6. KunenK.: The shortest single axioms for groups of exponent 4, Computers and Mathematics with Applications 29 (1995), 1–12.

    Google Scholar 

  7. LuckhamD. and NilssonN. J.: Extracting information from resolution proof trees, Artificial Intelligence 2 (1971), 27–54.

    Google Scholar 

  8. McCune, W. W.: OTTER 3.0 Reference Manual and Guide, Technical Report ANL-94/6, Argonne National Laboratory, 1994.

  9. WinkerS.: Robbins algebra: Conditions that make a near-Boolean algebra Boolean, J. Automated Reasoning 6 (1990), 465–489.

    Google Scholar 

  10. WinkerS.: Absorption and idempotency criteria for a problem in near-Boolean algebras, J. Algebra 153 (1992), 414–423.

    Google Scholar 

  11. Wos, L.: OTTER and the Moufang identity problem, J. Automated Reasoning (to appear).

  12. Wos, L., Overbeek, R., Lusk, E., and Boyle, J.: Automated Reasoning: Introduction and Applications, 2nd edn, McGraw-Hill, 1992.

Download references

Author information

Authors and Affiliations

  1. University of Wisconsin, 53706, Madison, WI, U.S.A.

    Kenneth Kunen

Authors
  1. Kenneth Kunen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Author supported by NSF Grant CCR-9503445.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kunen, K. The semantics of answer literals. J Autom Reasoning 17, 83–95 (1996). https://doi.org/10.1007/BF00247669

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Search

Navigation