[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Support Ordered Resolution

  • Conference paper
Automated Deduction - CADE-17 (CADE 2000)

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

Included in the following conference series:

  • 468 Accesses

Abstract

In a binary tree representation of a binary resolution proof, rotating some tree edge reorders two adjacent resolution steps. When rotation is not permitted to disturb factoring, and thus does not change the size of the tree, it is invertible and defines an equivalence relation on proof trees. When one resolution step is performed later than another after every sequence of such rotations, we say that resolution supports the other.

For a given ordering on atoms, or on atom occurrences, a support ordered proof orders its resolution steps so that the atoms are resolved consistently with the given order without violating the support relation between nodes. Any proof, including the smallest proof tree, can be converted to a support ordered proof by rotations. For a total order, the support ordered proof is unique. The support ordered proof is also a rank/activity proof where atom occurrences are ranked in the given order.

Procedures intermediate between literal ordered resolution and support ordered resolution are considered. One of these, 1-weak support ordered resolution, allows to resolve on a non-maximal literal only if it is immediately followed by both a factoring and a resolution on some greater literal. In a constrained experiment where literal ordered resolution solves only six of 408 TPTP problems with difficultly between 0.11 and 0.56, 1-weak support ordered resolution solves 75.

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

Access this chapter

Log in via an institution

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. Boyer, R.S.: Locking: A Restriction of Resolution. PhD thesis, University of Texas at Austin (1971)

    Google Scholar 

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

    Google Scholar 

  3. de Nivelle, H.: Resolution games and non-liftable resolution orderings. Collegium Logicum, Annals of the Kurt Gödel Society 2, 1–20 (1996)

    Google Scholar 

  4. Horton, J.D., Spencer, B.: Clause trees: a tool for understanding and implementing resolution in automated reasoning. Artificial Intelligence 92, 25–89 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Horton, J.D., Spencer, B.: Rank/activity: a canonical form for binary resolution. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 412–426. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12, 23–41 (1965)

    Article  MATH  Google Scholar 

  7. Spencer, B., Horton, J.D.: Efficient procedures for detecting and restoring minimality, an extension of the regular restriction of resolution. Journal of Automated Reasoning (to appear)

    Google Scholar 

  8. Sutcliffe, G., Suttner, C., Yemenis, T.: The TPTP problem library. In: Kapur, D. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 252–266. Springer, Heidelberg (1994)

    Google Scholar 

  9. Sutcliffe, G.: The CADE-16 system competition. Journal of Automated Reasoning 24, 371–396 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, University of New Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada, E3B 5A3

    Bruce Spencer & Joseph D. Horton

Authors
  1. Bruce Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph D. Horton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Toyota Technological Institute at Chicago, 1427 E. 60th Street, 60637, Chicago, Illinois

    David McAllester

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spencer, B., Horton, J.D. (2000). Support Ordered Resolution. In: McAllester, D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science(), vol 1831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721959_29

Download citation

  • DOI: https://doi.org/10.1007/10721959_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67664-5

  • Online ISBN: 978-3-540-45101-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation