Skip to main content
SpringerLink
Log in

A completeness result for E-unification algorithms based on conditional narrowing

  • Part 2: Submitted Contributions
  • Conference paper
  • First Online:
Foundations of Logic and Functional Programming

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

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. J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, Journal of Computer and System Sciences 32 (1986), pp. 323–362.

    Article  Google Scholar 

  2. P.G. Bosco and E. Giovannetti, IDEAL: an Ideal DEductive Applicative Language, Proc. 1986 Symp. on Logic Programming (IEEE Comp. Society Press, 1986), 89–95.

    Google Scholar 

  3. P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi, A complete characterization of K-LEAF, a logic language with partial functions, Proc. 1987 Symp. on Logic Programming (IEEE Comp. Society Press, 1987).

    Google Scholar 

  4. P.G. Bosco, E. Giovannetti and C. Moiso, Refined strategies for semantic unification. Proc. TAPSOFT '87, NCS 250 (Springer-Verlag, 1987), 276–290.

    Google Scholar 

  5. N. Dershowitz and D.A. Plaisted, Logic programming cum applicative programming, Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 54–66.

    Google Scholar 

  6. M. Fay, First order unification in an equational theory. Proc. 4th Workshop on Automated Deduction (1979), 161–167.

    Google Scholar 

  7. L. Fribourg, SLOG: A logic programming language interpreter based on clausal superposition and rewriting. Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 172–184.

    Google Scholar 

  8. J.A. Goguen and J. Meseguer, Equality, types, modules and (why not?) generics for logic programming. J. Logic Programming 1 (1984), 179–210.

    Article  Google Scholar 

  9. G. Huet, Deduction and computation. In Fundamentals of Artificial Intelligence, W. Bibel and Ph. Jorrand eds., LNCS 232 (Springer-Verlag, 1986), 39–74. 39–74.

    Google Scholar 

  10. J.-M. Hullot, Canonical forms and unification. Proc. 5th Conf. on Automated Deduction, LNCS 87 (Springer Verlag, 1980), 318–334.

    Google Scholar 

  11. S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984).

    Google Scholar 

  12. G. Levi and C. Palamidessi, An approach to the declarative semantics of synchronization in logic languages, Proc. Fourth Conf. on Logic Programming (MIT Press, 1987), 877–893.

    Google Scholar 

  13. D. Miller and G. Nadathur, Higher-order logic programming, Proc. Third Conf. on Logic Programming, LNCS 225 (Springer-Verlag, 1986), 448–462.

    Google Scholar 

  14. P. Rety, C. Kirchner, H. Kirchner and P. Lescanne, NARROWER: A new algorithm for unification and its application to logic programming. Proc. First Int. Conf. on Rewriting Techniques and Applications (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro Studi E Laboratori Telecommunicazioni, CSELT, via Reiss Romoli 274, 10148, Torino, Italy

    E. Giovannetti

  2. Dipartimento di Informatica, Università di Torino, corso Svizzera 185, 10149, Torino, Italy

    C. Moiso

Authors
  1. E. Giovannetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Moiso
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mauro Boscarol Luigia Carlucci Aiello Giorgio Levi

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giovannetti, E., Moiso, C. (1988). A completeness result for E-unification algorithms based on conditional narrowing. In: Boscarol, M., Carlucci Aiello, L., Levi, G. (eds) Foundations of Logic and Functional Programming. Lecture Notes in Computer Science, vol 306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19129-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-19129-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19129-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation