Skip to main content
SpringerLink
Log in

On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems

  • Conference paper
Functional and Logic Programming (FLOPS 1999)

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

Included in the following conference series:

Abstract

Deterministic conditional rewrite systems permit extra variables on the right-hand sides of the rules. If such a system is quasi-reductive or quasi-simplifying, then it is terminating and has a computable rewrite relation. This paper provides new criteria for showing quasi-reductivity and quasi-simplifyingness. In this context, another criterion from [ALS94] will be rectified and a claim in [MAR96] will be refuted. Moreover, we will investigate under which conditions the properties exhibit a modular behavior.

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. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science (1999) (to appear)

    Google Scholar 

  2. Avenhaus, J., Loría-Sáenz, C.: On conditional rewrite systems with extra variables and deterministic logic programs. In: Pfenning, F. (ed.) LPAR 1994. LNCS (LNAI), vol. 822, pp. 215–229. Springer, Heidelberg (1994)

    Google Scholar 

  3. Bergstra, J.A., Klop, J.W.: Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences 32(3), 323–362 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  5. Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation 3(1), 69–116 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ganzinger, H.: Order-sorted completion: The many-sorted way. Theoretical Computer Science 89, 3–32 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gramlich, B.: Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae 24, 3–23 (1995)

    MATH  MathSciNet  Google Scholar 

  8. Hanus, M.: The integration of functions into logic programming: From theory to practice. The Journal of Logic Programming 19&20, 583–628 (1994)

    Article  MathSciNet  Google Scholar 

  9. Kaplan, S.: Simplifying conditional term rewriting systems: Unification, termination and confluence. Journal of Symbolic Computation 4(3), 295–334 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kurihara, M., Ohuchi, A.: Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science 103, 273–282 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Krishna Rao, M.R.K.: Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science 151, 487–512 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Marchiori, M.: Unravelings and ultra-properties. Technical Report 8, Dept. of Pure and Applied Mathematics, University of Padova, Italy (1995)

    Google Scholar 

  13. Marchiori, M.: Unravelings and ultra-properties. In: Hanus, M., Rodríguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 107–121. Springer, Heidelberg (1996)

    Google Scholar 

  14. Marchiori, M.: On deterministic conditional rewriting. Computation Structures Group, Memo 405. MIT Laboratory for Computer Science, Cambridge (1997)

    Google Scholar 

  15. Middeldorp, A.: Modular properties of conditional term rewriting systems. Information and Computation 104(1), 110–158 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Middeldorp, A., Zantema, H.: Simple termination of rewrite systems. Theoretical Computer Science 175(1), 127–158 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Ohlebusch, E.: Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universität Bielefeld (1994)

    Google Scholar 

  18. Ohlebusch, E.: Transforming conditional rewrite systems with extra variables into unconditional systems. In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning. LNCS (LNAI). Springer, Berlin (1999) (to appear)

    Google Scholar 

  19. Zantema, H.: Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation 17, 23–50 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Technology, University of Bielefeld, P.O. Box 10 01 31, 33501, Bielefeld, Germany

    Enno Ohlebusch

Authors
  1. Enno Ohlebusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp

  2. Tokyo Institute of Technology, Graduate School of Information Sciences and Engineering Ookayama, 2-12-2, Meguro-ku, 152-8552, Tokyo, Japan

    Taisuke Sato

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohlebusch, E. (1999). On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. In: Middeldorp, A., Sato, T. (eds) Functional and Logic Programming. FLOPS 1999. Lecture Notes in Computer Science, vol 1722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10705424_12

Download citation

  • DOI: https://doi.org/10.1007/10705424_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66677-6

  • Online ISBN: 978-3-540-47950-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation