Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Automated Reasoning

IJCAR 2004: Automated Reasoning pp 45–59Cite as

A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting

  • Conference paper

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

Abstract

Redundancy criteria are an important means to restrict the search space of a theorem prover. In the presence of associative and commutative (AC) operators saturating provers soon generate many similar equations, most of them are redundant. We present a new criterion that is specialized for the AC-case and leads to significant speed-ups. The criterion uses a new sufficient test for the unsatisfiability of ordering constraints. The test runs in polynomial time, is easy to implement, and covers reduction orderings in a generic way, with possible extensions for LPO and KBO.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avenhaus, J., Hillenbrand, T., Löchner, B.: On using ground joinable equations in equational theorem proving. Journal of Symbolic Computation 36(1-2), 217–233 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Avenhaus, J., Löchner, B.: CCE: Testing ground joinability. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS(LNAI), vol. 2083, pp. 658–662. Springer, Heidelberg (2001)

    Google Scholar 

  3. Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion Without Failure. In: Resolution of Equations in Algebraic Structures, Rewriting Techniques, vol. 2, pp. 1–30. Academic Press, London (1989)

    Google Scholar 

  4. Bachmair, L., Ganzinger, H.: Rewrite-Based Equational Theorem Proving with Selection and Simplification. Journal of Logic and Computation 3(4), 217–247 (1994)

    Article  MathSciNet  Google Scholar 

  5. Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Deciding the confluence of ordered term rewrite systems. ACM Transactions on Computational Logic 4(1), 33–55 (2003)

    Article  MathSciNet  Google Scholar 

  6. Comon, H., Treinen, R.: The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science 176, 67–87 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 9. vol. I, pp. 535–610. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  8. Hsiang, J., Rusinowitch, M.: On word problems in equational theories. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, Springer, Heidelberg (1987)

    Google Scholar 

  9. Hurd, J.: Using inequalities as term ordering constraints. Technical Report 567, University of Cambridge Computer Laboratory (2003)

    Google Scholar 

  10. Johann, P., Socher-Ambrosius, R.: Solving simplification ordering constraints. In: Jouannaud, J.-P. (ed.) CCL 1994. LNCS, vol. 845, pp. 352–367. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  11. Kapur, D.: Shostak’s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 23–37. Springer, Heidelberg (1997)

    Google Scholar 

  12. Korovin, K., Voronkov, A.: Knuth-Bendix constraint solving is NPcomplete. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 979–992. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Löchner, B., Hillenbrand, T.: A phytography of Waldmeister. AI Communications 15(2-3), 127–133 (2002), www.waldmeister.org

    MATH  Google Scholar 

  14. Löchner, B.: Joinability is undecidable for ordered rewriting. Technical Report, FB Informatik, Technische Universität Kaiserslautern (2004)

    Google Scholar 

  15. Martin, U., Nipkow, T.: Ordered rewriting and confluence. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 366–380. Springer, Heidelberg (1990)

    Google Scholar 

  16. Nieuwenhuis, R.: Simple LPO constraint solving methods. Information Processing Letters 47, 65–69 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 7. vol. I, pp. 371–443. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  18. Nieuwenhuis, R., Rivero, J.: Practical algorithms for deciding path ordering constraint satisfaction. Information & Computation 178, 422–440 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM 35(8), 102–114 (1992), Library available at www.cs.umd.edu/projects/omega/

    Article  Google Scholar 

  20. Plaisted, D.A., Zhu, Y.: Equational reasoning using AC constraints. In: Proc. of the Fifteenth International Joint Conference on Artificial Intelligence, vol. 1, pp. 108–113. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  21. Suttner, C.B., Sutcliffe, G.: The TPTP problem library (TPTP v2.1.0). Technical Report 97/08, Department of Computer Science, James Cook University, Townsville, Australia (1997), See www.tptp.org

Download references

Author information

Authors and Affiliations

  1. FB Informatik, Technische Universität Kaiserslautern, Kaiserslautern, Germany

    Bernd Löchner

Authors
  1. Bernd Löchner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Dep. of Computer Science, ETH, Zurich, Switzerland

    David Basin

  2. LORIA & INRIA Lorraine UMR 7503,  

    Michaël Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Löchner, B. (2004). A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25984-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22345-0

  • Online ISBN: 978-3-540-25984-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation