Skip to main content
SpringerLink
Log in

Theorem proving modulo associativity

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1092))

Included in the following conference series:

Abstract

We present an inference system for first-order constrained clauses with equality modulo associativity (A). Our procedure is refutationally complete and reduces to Knuth-Bendix completion modulo A in the equational case. As an essential ingredient we present the first—as far as we know-A-compatible reduction ordering total on the ground A-congruence classes.

This work has been partially supported by the Esprit Working Group CCL, ref. 6028

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.

References

  1. Leo Bachmair. Canonical equational proofs. Birkhäuser, Boston, Mass., 1991.

    Google Scholar 

  2. Leo Bachmair and Nachum Dershowitz. Completion for rewriting modulo a congruence. In Pierre Lescanne, editor, Rewriting Techniques and Applications, [2nd International Conference], LNCS 256, pages 192–203, Bordeaux, France, May 25–27, 1987. Springer-Verlag.

    Google Scholar 

  3. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):1–31, 1994.

    Google Scholar 

  4. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6, pages 244–320. Elsevier Science Publishers B.V., Amsterdam, New York, Oxford, Tokyo, 1990.

    Google Scholar 

  5. G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797–821, October 1980.

    Google Scholar 

  6. Jean-Pierre Jouannaud. Confluent and coherent equational term rewriting systems: Applications to proofs in abstract data types. In Proc. 8th Colloquium on Trees in Algebra and Programming, LNCS 59, pages 269–283. Springer-Verlag, 1983.

    Google Scholar 

  7. Jean-Pierre Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15:1155–1194, 1986.

    Google Scholar 

  8. D. S. Lankford and A. M. Ballantyne. Decision procedures for simple equational theories with commutative-associative axioms: Complete sets of commutative-associative reductions. Technical Report Memo ATP-39, Dept. of Mathematics and Computer Science, Univ. of Texas, Austin, TX, August 1977.

    Google Scholar 

  9. G.S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129–198, 1977.

    Google Scholar 

  10. Paliath Narendran and Michael Rusinowitch. Any ground associative commutative theory has a finite canonical system. In Fourth int. conf. on Rewriting Techniques and Applications, LNCS 488, pages 423–434, Como, Italy, April 1991. Springer-Verlag.

    Google Scholar 

  11. Robert Nieuwenhuis and Albert Rubio. Basic superposition is complete. In B. Krieg-Brückner, editor, European Symposium on Programming, LNCS 582, pages 371–390, Rennes, France, February 26–28, 1992. Springer-Verlag.

    Google Scholar 

  12. Robert Nieuwenhuis and Albert Rubio. AC-Superposition with constraints: No AC-unifiers needed. In Allan Bundy, editor, 12th International Conference on Automated Deduction, LNAI, Nancy, France, June 1994. Springer-Verlag.

    Google Scholar 

  13. Robert Nieuwenhuis and Albert Rubio. Theorem Proving with Ordering and Equality Constrained Clauses. J. of Symbolic Computation, 19(4):321–351, April 1995.

    Google Scholar 

  14. G.E. Peterson and M.E. Stickel. Complete sets of reductions for some equational theories. Journal Assoc. Comput. Mach., 28(2):233–264, 1981.

    Google Scholar 

  15. Albert Rubio. Automated deduction with ordering and equality constrained clauses. PhD. Thesis, Technical University of Catalonia, Barcelona, Spain, 1994.

    Google Scholar 

  16. Albert Rubio and Robert Nieuwenhuis. A total AC-compatible ordering based on RPO. Theoretical Computer Science, 142(2):209–227, May 15, 1995.

    Google Scholar 

  17. Laurent Vigneron. Associative Commutative Deduction with constraints. In Allan Bundy, editor, 12th International Conference on Automated Deduction, LNAI, Nancy, France, June 1994. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universtitat Politècnica de Catalunya, Pau Gargallo 5, 08028, Barcelona, Spain

    Albert Rubio

Authors
  1. Albert Rubio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Kleine Büning

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rubio, A. (1996). Theorem proving modulo associativity. In: Kleine Büning, H. (eds) Computer Science Logic. CSL 1995. Lecture Notes in Computer Science, vol 1092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61377-3_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-61377-3_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68507-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation