Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Jeopardy

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1999)

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

Included in the following conference series:

  • 248 Accesses

Abstract

We consider functions defined by ground-convergent leftlinear rewrite systems. By restricting the depth of left sides and disallowing defined symbols at the top of right sides, we obtain an algorithm for function inversion.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Aguzzi, G., Modigliani, U.: A criterion to decide the semantic matching problem. Proc. Intl. Conf. on Logic and Algebra, Italy (1995).

    Google Scholar 

  2. Christian, J.: Some termination criteria for narrowing and E-narrowing. Proc. 11th Intl. Conf. on Automated Deduction, Saratoga Springs, NY. Lecture Notes in Artificial Intelligence 607:582–588, Springer-Verlag, Berlin (1992).

    Google Scholar 

  3. Comon, H.: On unification of terms with integer exponents. Tech. Rep. 770, Université de Paris-Sud, Laboratoire de Réchérche en Informatique (1992).

    Google Scholar 

  4. Comon, H., Haberstrau, M., Jouannaud, J.P.: Decidable problems in shallow equational theories. Tech. Rep. 718, Université de Paris-Sud, Laboratoire de Réchérche en Informatique (1991).

    Google Scholar 

  5. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science B: 243–320, North-Holland, Amsterdam (1990).

    Google Scholar 

  6. Dershowitz, N., Mitra, S.: Higher-order and semantic unification. Proc. 13th Conf. on Foundations of Software Technology and Theoretical Computer Science, Bombay, India. Lecture Notes in Artificial Intelligence 761:139–150, Springer-Verlag, Berlin (1993).

    Google Scholar 

  7. Dershowitz, N., Mitra, S., Sivakumar., G.: Decidable matching for convergent systems (Preliminary version). Proc. 11th Conference on Automated Deduction, Saratoga Springs, NY. Lecture Notes in Artificial Intelligence 607:589–602, Springer-Verlag, Berlin (1992).

    Google Scholar 

  8. Dershowitz, N., Plaisted, D. A.: Equational programming. In: J. E. Hayes, D. Michie, J. Richards, eds., Machine Intelligence 11: The logic and acquisition of knowledge, 21–56. Oxford Press, Oxford (1988).

    Google Scholar 

  9. Dershowitz, N., Reingold, E. M.: Calendrical Calculations. Cambridge University Press, Cambridge (1997).

    MATH  Google Scholar 

  10. Fages, F., Huet, G.: Unification and matching in equational theories. Proc. 8th Colloq. on Trees in Algebra and Programming, L’Aquila, Italy. Lecture Notes in Computer Science 159:205–220, Springer-Verlag, Berlin (1983).

    Google Scholar 

  11. Heilbrunner, S., Hölldobler, S.: The undecidability of the unification and matching problem for canonical theories. Acta Informatica 24(2):157–171 (1987).

    Article  MATH  MathSciNet  Google Scholar 

  12. Hullot, J.-M.: Canonical forms and unification. Proc. 5th Intl. Conf. on Automated Deduction, Les Arcs, France, Lecture Notes in Computer Science 87:318–334, Springer-Verlag, Berlin (1980).

    Google Scholar 

  13. Jacquemard, F.: Decidable approximations of term rewriting systems. Proc. 7th Intl. Conf. on Rewriting Techniques and Applications, New Brunswick, NJ. Lecture Notes in Computer Science 1103:362–376, Springer-Verlag, Berlin (1966).

    Google Scholar 

  14. Mitra, S.: Semantic unification for convergent systems. Ph.D. thesis, Dept. of Computer Science, University of Illinois, Urbana, IL, Tech. Rep. UIUCDCS-R-94-1855 (1994).

    Google Scholar 

  15. Narendran, P., Pfenning, F., Statman, R.: On the unification problem for Cartesian closed categories. J. Symbolic Logic 62(2):636–647 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  16. Nieuwenhuis, R.: Decidability and complexity analysis by basic paramodulation. Information and Computation 147:1–21 (1998).

    Google Scholar 

  17. Plaisted, D. A.: Semantic confluence tests and completion methods. Information and Computation 65:182–215 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tel-Aviv University Ramat Aviv, Tel-Aviv, 69978, Israel

    Nachum Dershowitz

  2. Enterprise Component Technology, 162 36th “A” Cross 3rd Main, 7th Block Jayanagar, Bangalore, 560 082, India

    Subrata Mitra

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subrata Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany — SUNY, Albany, NY, 12222, USA

    Paliath Narendran

  2. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, F-54602, Villers les Nancy, Cedex, France

    Michael Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dershowitz, N., Mitra, S. (1999). Jeopardy. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-48685-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66201-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation