Skip to main content

First-Order Atom Definitions Extended

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2001)

Abstract

We extend the notion of atom definitions in first-order formulae by guards. These are conditions restricting the atom definition in a form that frequently occurs in many application areas of automated theorem proving. We give a suficient and complete criterion for a formula to contain such a definition and provide an effective algorithm to actually retrieve the definition in an applicable form. An implementation within our prover Spass leads to significant performance improvements in application areas where atom definitions are present.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Degtyarev and A. Voronkov. Stratified resolution. In D. McAllester, editor, 17th International Conference on Automated Deduction (CADE-17), volume 1831, pages 365–384, Pittsburgh, 2000.

    Google Scholar 

  2. Andreas Nonnengart, Georg Rock, and Christoph Weidenbach. On generating small clause normal forms. In Claude Kirchner and Hélène Kirchner, editors, 15th International Conference on Automated Deduction, CADE-15, volume 1421 of LNAI, pages 397–411. Springer, 1998.

    Google Scholar 

  3. David A. Plaisted and Yunshan Zhu. Replacement rules with definition detection. In Ricardo Caferra and Gernot Salzer, editors, Automated Deduction in Classical and Non-Classical Logics, volume 1761 of LNAI, pages 80–94. Springer, 1998.

    Google Scholar 

  4. Geoff Sutcliffe, Christian B. Suttner, and Theodor Yemenis. The TPTP problem library. In Alan Bundy, editor, Twelfth International Conference on Automated Deduction, CADE-12, volume 814 of LNAI, pages 252–266, Nancy, France, June 1994. Springer.

    Google Scholar 

  5. Christoph Weidenbach. Combining Superposition, Sorts and Splitting. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, chapter 27, pages 1965–2013. Elsevier Science Publishers B.V., 2001.

    Google Scholar 

  6. Larry Wos. Automated Reasoning, 33 Basic Research Problems. Prentice Hall, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Afshordel, B., Hillenbrand, T., Weidenbach, C. (2001). First-Order Atom Definitions Extended. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45653-8_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42957-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics