Skip to main content
SpringerLink
Log in

Invited Talk: Rewrite-Based Deduction and Symbolic Constraints

  • Conference paper
  • First Online:
Automated Deduction — CADE-16 (CADE 1999)

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

Included in the following conference series:

Abstract

Building a state-of-the-art theorem prover requires the combination of at least three main ingredients: good theory, clever heuristics, and the necessary engineering skills to implement it all in an efficient way. Progress in each of these ingredients interacts in different ways.

On the one hand, new theoretical insights replace heuristics by more precise and effective techniques. For example, the completeness proof of basic paramod- ulation [NR95,BGLS95] shows why no inferences below Skolem functions are needed, as conjectured by McCune in [McC90]. Regarding implementation tech- niques, ad-hoc algorithms for procedures like demodulation or subsumption are replaced by efficient, re-usable, general-purpose indexing data structures for which the time and space requirements are well-known.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217–247, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. Leo Bachmair and Harald Ganzinger. Equational reasoning in saturationbased theorem proving. In W. Bibel and P. Schmitt, editors, Automated Deduction: A Basis for Applications. Kluwer, 1998.

    Google Scholar 

  3. L. Bachmair, H. Ganzinger, Chr. Lynch, and W. Snyder. Basic paramodulation. Information and Computation, 121(2):172–192, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, and Albert Rubio. Paramodulation with non-monotonic orderings. In 14th IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, July 2–5, 1999.

    Google Scholar 

  5. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Set constraints are the monadic class. In Eighth Annual IEEE Symposium on Logic in Computer Science, pages 75–83, Montreal, Canada, June 19-23, 1993. IEEE Computer Society Press.

    Google Scholar 

  6. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In 3rd Kurt Gödel Colloquium: Computational Logic and Proof Theory, LNCS 713, pages 83–96. SpringerVerlag, 1993.

    Google Scholar 

  7. Franz Baader and Wayne Snyder. Unification theory. In J.A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers (to appear), 1999.

    Google Scholar 

  8. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, and Michael Rusinowitch. Decision problems in ordered rewriting. In 13th IEEE Symposium on Logic in Computer Science (LICS), pages 410–422, Indianapolis, USA, June 27-30, 1998.

    Google Scholar 

  9. Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387–411, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  10. Harald Ganzinger and Hans de Nivelle. A superposition decision procedure for the guarded fragment with equality. In 14th IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, July 2–5, 1999.

    Google Scholar 

  11. Harald Ganzinger, Christoph Meyer, and Margus Veanes. The two-variable guarded fragment with transitive relations. In 14th IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, July 2–5, 1999.

    Google Scholar 

  12. Harald Ganzinger, Robert Nieuwenhuis, and Pilar Nivela. The Saturate System, 1995. Software and documentation available at: http://www.mpi-sb.mpg.de/SATURATE/Saturate.html.

  13. Harald Ganzinger and Jürgen Stuber. Inductive theorem proving by consistency for first-order clauses (extended abstract). In M[ichaël] Rusinowitch and J[ean-]L[uc] Rémy, editors, The Third InternationalWorkshop on Conditional Term Rewriting Systems, Extended Abstracts, pages 130–135, Pontá-Mousson, France, July 8-10, 1992. Centre de Recherche en Informatique de Nancy and INRIA Lorraine.

    Google Scholar 

  14. J. Hsiang and M Rusinowitch. Proving refutational completeness of theorem proving strategies: the transfinite semantic tree method. Journal of the ACM, 38(3):559–587, jul 1991.

    Article  MATH  MathSciNet  Google Scholar 

  15. Florent Jacquemard, Christoph Meyer, and Christoph Weidenbach. Unification in extensions of shallow equational theories. In Proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-9, volume to appear, Tsukuba, Japan, 1998. Springer.

    Google Scholar 

  16. C. Lynch and C. Scharff. Basic completion with E-cycle simplification. In Artificial Intelligence and Symbolic Computation, lncs 1476, pages 121–121, 1998.

    Google Scholar 

  17. William McCune. Skolem functions and equality in automated deduction. In Tom Dietterich and William Swartout, editors, Proceedings of the 8th National Conference on Artificial Intelligence, pages 246–251, Hynes Convention Centre?, July 29-August 3 1990. MIT Press.

    Google Scholar 

  18. William McCune. Solution of the Robbins problem. Journal of Automated Reasoning, 19(3):263–276, December 1997.

    Article  MATH  MathSciNet  Google Scholar 

  19. Robert Nieuwenhuis. Decidability and complexity analysis by basic paramodulation. Information and Computation, 147:1–21, 1998. Extended abstract in IEEE LICS’96.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Robert Nieuwenhuis and Albert Rubio. Paramodulation with Builtin ACTheories and Symbolic Constraints. Journal of Symbolic Computation, 23(1):1–21, May 1997.

    Article  MATH  MathSciNet  Google Scholar 

  22. Robert Nieuwenhuis and Jos*#x00E9; Miguel Rivero. Solved forms for path ordering constraints. In P. Narendran and M. Rusinowitch, editors, Tenth International Conference on Rewriting Techniques and Applications (RTA), LNCS, Trento, Italy, July 2-4, 1999. Springer-Verlag.

    Google Scholar 

  23. Robert Nieuwenhuis and Albert Rubio. Paramodulation-based theorem proving. In J.A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers (to appear), 1999.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  25. Michael Rusinowitch and Laurent Vigneron. Automated deduction with associative commutative operators. J. of Applicable Algebra in Engineering, Communication and Computation, 6(1):23–56, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  26. G. A. Robinson and L. T. Wos. Paramodulation and theorem-proving in first order theories with equality. Machine Intelligence, 4:135–150, 1969.

    MathSciNet  MATH  Google Scholar 

  27. Laurent Vigneron. Associative Commutative Deduction with constraints. In Alan Bundy, editor, 12th International Conference on Automated Deduction, LNAI 814, pages 530–544, Nancy, France, June 1994. Springer-Verlag.

    Google Scholar 

  28. Christoph Weidenbach. SPASS version 0.49. Journal of Automated Reasoning, 18(2):247–252, April 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. LSI Jordi Girona 1, Technical University of Catalonia, 08034, Barcelona, Spain

    Robert Nieuwenhuis

Authors
  1. Robert Nieuwenhuis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nieuwenhuis, R. (1999). Invited Talk: Rewrite-Based Deduction and Symbolic Constraints. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-48660-7_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66222-8

  • Online ISBN: 978-3-540-48660-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation