Advertisement

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

  • E. Giovannetti
  • C. Moiso
Part 2: Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 306)

Keywords

Boolean Function Logic Program Logic Programming Functional Programming Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BK.
    J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, Journal of Computer and System Sciences 32 (1986), pp. 323–362.CrossRefGoogle Scholar
  2. BG.
    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. BL.
    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. BM.
    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. DP.
    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. FA.
    M. Fay, First order unification in an equational theory. Proc. 4th Workshop on Automated Deduction (1979), 161–167.Google Scholar
  7. FR.
    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. GM.
    J.A. Goguen and J. Meseguer, Equality, types, modules and (why not?) generics for logic programming. J. Logic Programming 1 (1984), 179–210.CrossRefGoogle Scholar
  9. HT.
    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. HU.
    J.-M. Hullot, Canonical forms and unification. Proc. 5th Conf. on Automated Deduction, LNCS 87 (Springer Verlag, 1980), 318–334.Google Scholar
  11. KA.
    S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984).Google Scholar
  12. LP.
    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. MI.
    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. RK.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • E. Giovannetti
    • 1
  • C. Moiso
    • 2
  1. 1.Centro Studi E Laboratori TelecommunicazioniCSELTTorinoItaly
  2. 2.Dipartimento di InformaticaUniversità di TorinoTorinoItaly

Personalised recommendations