Skip to main content
SpringerLink
Log in

Narrowing with built-in theories

  • Submitted Papers
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1988)

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

Included in the following conference series:

Abstract

Rewriting and narrowing provide a nice theoretical framework for the integration of logic and functional programming. For practical applications however narrowing is still much too inefficient. In this paper we show how narrowing modulo equality theories may considerably increase the efficiency of the narrowing process.

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. M. Bellia, G. Levi: The Relation between Logic and Functional languages: A Survey. J. Logic Programming 3 (1986), 217–236

    Article  MATH  Google Scholar 

  2. A. Bockmayr: Conditional rewriting and narrowing as a theoretical framework for logic-functional programming: A Survey. Int. Bericht 10/86, Fak. f. Informatik, Univ. Karlsruhe, 1986

    Google Scholar 

  3. A. Bockmayr: Narrowing with Inductively Defined Functions. Int. Bericht 25/86, Fak. f. Informatik, Univ. Karlsruhe, 1986

    Google Scholar 

  4. A. Bockmayr: A Note on a Canonical Theory with Undecidable Unification and Matching Problem. J. Autom. Reas. 3 (1987), 379–381

    MathSciNet  MATH  Google Scholar 

  5. P. G. Bosco, E. Giovannetti, C. Mosio: Refined Strategies for Semantic Unification. TAPSOFT 87, Pisa, 1987, Springer LNCS 250

    MATH  Google Scholar 

  6. W. Büttner, H. Simonis: Embedding Boolean Equations into Logic Programming. J. Symb. Comput. 4 (1987), 191–205

    Article  MATH  Google Scholar 

  7. A. Colmerauer: Opening the Prolog III Universe. BYTE, Aug. 1987, 177–182

    Google Scholar 

  8. M. Clausen, A.Fortenbacher: Efficient Solution of Linear Diophantine Equations. Int. Ber. 32/87, Fak. f. Informatik, Univ. Karlsruhe, 1987; to appear in J. Symb. Comput.

    Google Scholar 

  9. D. DeGroot, G. Lindstrom: LOGIC PROGRAMMING — Functions, Relations and Equations. Prentice Hall 1986

    Google Scholar 

  10. N. Dershowitz, D. A. Plaisted: Logic Programming cum Applicative Programming. Symp. on Logic Programming, Boston 1985, IEEE

    Google Scholar 

  11. M. Fay: First Order Unification in an Equational Theory. 4th Workshop on Automated Deduction, Austin, Texas, 1979

    Google Scholar 

  12. L. Fribourg: Handling Function Definitions Through Innermost Superposition and Rewriting. Rewriting Techniques and Applications, Dijon 1985, Springer LNCS 202

    Google Scholar 

  13. E. Giovannetti, C. Moiso: A Completeness Result for E-Unification Algorithms Based on Conditional Narrowing. Foundations of Logic and Functional Programming, Trento 1986, Springer LNCS 306

    Google Scholar 

  14. G. Huet, D. C. Oppen: Equations and Rewrite Rules, A Survey. Formal Language Theory (Ed. R. V. Book), Academic Press 1980

    Google Scholar 

  15. J.M. Hullot: Canonical Forms and Unification. 5th Conference on Automated Deduction, Les Arcs 1980, Springer LNCS 87

    Google Scholar 

  16. H. Hussmann: Unification in Conditional-Equational Theories. Technical Report MIP-8502, Univ. Passau, Jan.1985 short version: EUROCAL 85, Linz, Springer LNCS 204

    Google Scholar 

  17. J. Jaffar, J.-L. Lassez: Constraint Logic Programming. POPL 87, München, 1987

    Google Scholar 

  18. J. Jaffar, J.-L. Lassez M. S. Maher: Logic Programming Language Scheme. In [DeGroot/Lindstrom 86]

    Google Scholar 

  19. J. P. Jouannaud: Church-Rosser computations with equational term rewriting systems. 8th CAAP, L'Aquila, 1983, Springer LNCS 159

    Google Scholar 

  20. J. P. Jouannaud, H. Kirchner: Completion of a set of rules modulo a set of equations. SIAM J. Comput. 15,4 (1986), 1155–1194

    Article  MathSciNet  MATH  Google Scholar 

  21. J. P. Jouannaud, C. Kirchner and H. Kirchner: Incremental construction of unification algorithms in equational theories. 10th ICALP, Barcelona, 1983, Springer LNCS 154

    Google Scholar 

  22. J. P. Jouannaud, M. Munoz: Termination of a set of rules modulo a set of equations. 7th CADE, Napa Valley, 1984, Springer LNCS 170

    Google Scholar 

  23. S. Kaplan: Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence. J. Symb. Comput. 4 (1987), 295–334

    Article  MathSciNet  MATH  Google Scholar 

  24. T. Käufl: Reasoning about systems of linear inequalities. Int. Ber. 16/87, Fak. f. Informatik, Univ. Karlsruhe, 1987

    Google Scholar 

  25. C. Kirchner: Methodes et outils de conception systématique d'algorithmes d'unification dans les théories equationnelles. Thèse d'état, Univ. Nancy, 1985

    Google Scholar 

  26. U. Martin, T. Nipkow: Unification in Boolean Rings. CADE-8, Oxford 1986, Springer LNCS 230

    Google Scholar 

  27. T. Nipkow: Unification in Primal Algebras. CAAP 88, Nancy 1988, Springer LNCS 299

    Google Scholar 

  28. W. Nutt, P. Réty, G. Smolka: Basic Narrowing Revisited. SEKI-Report SR 87-07, Univ. Kaiserslautern, 1987

    Google Scholar 

  29. P. Padawitz: Strategy-Controlled Reduction and Narrowing. Rewriting Techniques and Applications, Bordeaux 1987, Springer LNCS 256

    MATH  Google Scholar 

  30. G. E. Peterson, M. Stickel: Complete Sets of Reductions for Some Equational Theories. J.ACM 28 (1981), 233–264

    Article  MathSciNet  MATH  Google Scholar 

  31. G. D. Plotkin: Building-In Equational Theories. Machine Intelligence 7 (1972)

    Google Scholar 

  32. P. Réty, C. Kirchner, H. Kirchner, P. Lescanne: NARROWER: a new algorithm for unification and its application to Logic Programming. Rewriting Techniques and Applications, Dijon 1985, Springer LNCS 202

    Google Scholar 

  33. M. Schmidt-Schauss: Unification in a Combination of Arbitrary Disjoint Equational Theories. CADE-9, Argonne 1988, Springer LNCS 310

    Google Scholar 

  34. M. Stickel: Automated Deduction by Theory Resolution. J. Autom. Reas. 1 (1985), 333–355

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sonderforschungsbereich 314 "Künstliche Intelligenz — Wissensbasierte Systeme" Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, Postfach 6980, D-7500, Karlsruhe 1, Germany

    Alexander Bockmayr

Authors
  1. Alexander Bockmayr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Grabowski P. Lescanne W. Wechler

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Akademie-Verlag Berlin

About this paper

Cite this paper

Bockmayr, A. (1988). Narrowing with built-in theories. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-50667-5_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46063-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation