Skip to main content
SpringerLink
Log in

Fundamental mechanisms for artificial intelligence programming languages

An introduction

  • Conference paper
  • First Online:
Advanced Topics in Artificial Intelligence (ACAI 1987)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 345))

Included in the following conference series:

  • 203 Accesses

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.

V. References

  1. D. Bert. Refinement of generic specifications with algebraic tools. In: IFIP Congress, North-Holland (1983).

    Google Scholar 

  2. Bowen and R.A. Kowalski. Amalgamating language and meta-language in logic programming. In: Logic programming (Clark and Tarnlund, Eds.), Academic Press (1982).

    Google Scholar 

  3. B. Buchberger. History and basic features of the critical-pair/completion approach. In: Proc. 1st Conf. on Rewriting Techniques and Applications, Springer-Verlag, LNCS 202 (1985).

    Google Scholar 

  4. R.M. Burstall, D.B. Macqueen, and D.T. Sannella. HOPE: an experimental applicative language. CSR-62-80, University of Edinburgh (1981).

    Google Scholar 

  5. K.L. Clark and S.A. Tarnlund (Eds.). Logic programming. Academic Press (1982).

    Google Scholar 

  6. W.F. Clocksin and C.S. Mellish. Programming in Prolog. 2nd Ed., North-Holland (1984).

    Google Scholar 

  7. J. Cohen. Describing Prolog by its interpretation and compilation. CACM 28(12) (1985).

    Google Scholar 

  8. A. Colmerauer, H. Kanoui, R. Pasero, and Ph. Roussel. Un système de communication homme-machine en français. Research Report, Groupe d'Intelligence Artificielle, Faculté des Sciences de Luminy, Marseille, France (1973).

    Google Scholar 

  9. A. Colmerauer. Equations and inequations on finite and infinite terms. In: Proc. FGCS'84 (1984).

    Google Scholar 

  10. A. Colmerauer. Prolog in 1O figures. CACM 28(12) (1985).

    Google Scholar 

  11. H. Comon. Sufficient completeness, term rewriting system and anti-unification. In: Proc. 8th CADE (J. Siekmann, Ed.), Springer-Verlag LNCS (1986).

    Google Scholar 

  12. H. Comon. Unification et disunification. Théorie et applications. PhD Thesis, U. Grenoble (1988).

    Google Scholar 

  13. D. DeGroot and G. Lindstrom. Logic programming — Functions, relations and equations. Prentice-Hall (1986).

    Google Scholar 

  14. N. Dershowitz. Computing with rewrite systems. ATR-83 (8478)-1, Aerospace Corporation (1983).

    Google Scholar 

  15. N. Dershowitz. Termination. In: Proc. 1st Conference on Rewriting Techniques and Applications, Springer-Verlag, LNCS 202 (1985).

    Google Scholar 

  16. E. Eder. Properties of subtitution and unification. JSC, 1(1) (1984).

    Google Scholar 

  17. F. Fages. Associative-commutative unification. In: Proc. 7th CADE, Springer-Verlag, LNCS 170 (1984).

    Google Scholar 

  18. M. Fay. First order unification in an equational theory. In: Proc. 4th Workshop on Automated Deduction, Austin, Texas (1979)

    Google Scholar 

  19. J. Herbrand. Recherches sur la théorie de la démonstration. Thèse, U. de Paris (1930). In: Ecrits logiques de Jacques Herbrand, PUF Paris (1968).

    Google Scholar 

  20. G. Huet. Résolution d'équations dans les langages d'ordre 1, 2, ... ω. Thèse d'Etat, U. de Paris VII (1976).

    Google Scholar 

  21. G. Huet. Deduction and computation. In: Proc. Fundamentals of Artificial Intelligence (W. Bibel and Ph. Jorrand, Ed.), 1st Advanced Course in Artificial Intelligence, Vignieu, France, July 1985. Springer-Verlag LNCS 232 (1986).

    Google Scholar 

  22. G. Huet and J.M. Hullot. Proofs by induction in equational theories with constructors. JCSS 25 (1982).

    Google Scholar 

  23. G. Huet and D. Oppen. Equations and rewrite rules. A survey. In: Formal languages: Perspectives and open problems (R. Book, Ed.), Academic Press (1980).

    Google Scholar 

  24. J.M. Hullot. Canonical forms and unification. In: Proc. 5th CADE, Springer-Verlag, LNCS 87 (1980).

    Google Scholar 

  25. J.P. Jouannaud (Ed.). Proceedings of 1st Conference on Rewriting Techniques and Applications. Springer-Verlag, LNCS 202 (1985).

    Google Scholar 

  26. J.P. Jouannaud, C. Kirchner, and H. Kirchner. Incremental construction of unification algorithms in equational theories. In: Proc ICALP'83, Springer-Verlag, LNCS 154 (1983).

    Google Scholar 

  27. J.P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. In: Proc. 11th ACM POPL (1984).

    Google Scholar 

  28. J.P. Jounnaud and P. Lescanne. La réécriture. AFCET TSI 5(6) (1986).

    Google Scholar 

  29. K.M. Kahn. Uniform — a language based upon unification which unifies (much of) Lisp, Prolog and Act1. In: Proc. Workshop on Logic Programming for Intelligent Systems (1981). Also appears in [DeGroot-Lindstrom 86].

    Google Scholar 

  30. C. Kirchner. A new equational unification method: a generalisation of Martelli-Montanari's algorithm. In: Proc. 7th CADE, Springer-Verlag, LNCS 170 (1984).

    Google Scholar 

  31. C. Kirchner and P. Lescanne. Solving disequations. In: Proc. 2nd IEEE Symp. on Logic in Computer Science (1987).

    Google Scholar 

  32. Komorovski. QLOG — The programming environment for Prolog in Lisp. In: Logic programming (Clark and Tarnlund, Eds.), Academic Press (1982).

    Google Scholar 

  33. R.A. Kowalski. Logic for problem solving. Artificial Intelligence Series, North-Holand (1979).

    Google Scholar 

  34. J.L. Lassez, M.J. Maher, and K. Marriott. Unification revisited. Research Report RC 12394, IBM T.J. Watson Research Center (1986).

    Google Scholar 

  35. J.L. Lassez and K. Marriott. Explicit representation of terms defined by counter examples. J. of Automated Reasoning (1987).

    Google Scholar 

  36. G. Lindstrom. Functional programming and the logical variable. 12th ACM POPL (1985).

    Google Scholar 

  37. J.W. Lloyd. Foundations of logic programming. Springer-Verlag (1984).

    Google Scholar 

  38. A. Martelli and U. Montanari. An efficient unification algorithm. ACM TOPLAS, 4(2) (1982).

    Google Scholar 

  39. C.S. Mellish and Hardy. Integrating Prolog in the Poplog environment. In: Implementations of Prolog (J.A. Campbell, Ed.), Ellis Horwood (1984).

    Google Scholar 

  40. M.S. Paterson and M.N. Wegman. Linear unification. JCSS, 16(2) (1978).

    Google Scholar 

  41. G. Plotkin. A note on inductive generalization. In: Machine intelligence 5, (1970).

    Google Scholar 

  42. G. Plotkin. A further note on inductive generalization. In: Machine intelligence 6, (1971).

    Google Scholar 

  43. Uday S. Reddy. Narrowing as the operational semantics of functinal languages. In: Proc. IEEE Symposium on Logic Programming (1985).

    Google Scholar 

  44. J. Reynolds. Transformational systems and the algebraic structure of atomic formulas. In: Machine intelligence 5, (1970).

    Google Scholar 

  45. J.A. Robinson. A machine oriented logic based on the resolution principle. JACM 12(1) (1965).

    Google Scholar 

  46. J.A. Robinson. Logic programming, past, present and future. New Generation Computing 1 (1983).

    Google Scholar 

  47. J.A. Robinson and Sibert. LOGLISP: an alternative to Prolog. In: Machine Inteligence 10 (1982).

    Google Scholar 

  48. Ph. Schnoebelen. Rewriting techniques for the temporal analysis of communicating processes. In: Proc. PARLE Conference, Springer-Verlag, LNCS 259 (1987).

    Google Scholar 

  49. Ph. Schnoebelen. Compilation of pattern matching. Research Report LIFIA, Grenoble (1988).

    Google Scholar 

  50. M. Stickel. A unification algorithm for associative-commutative functions. JACM 28, (1981).

    Google Scholar 

  51. D.A. Turner. Recursion equations as a programming language. In: Functional programming and its applications (D.A. Turner, Ed.), Cambridge University Press (1982).

    Google Scholar 

  52. D.A. Turner. Miranda: a non-strict functional language with polymorphic types. In: Proc. 2nd Conf. on Functional Programming Languages and Computer Architecture, Springer-Verlag, LNCS 201 (1985).

    Google Scholar 

  53. Vere. Induction concept in the predicate calculus. In: Proc. IJCAI'75, (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFIA INPG-CNRS, 46, avenue Félix Viallet, 38000, Grenoble, France

    Philippe Jorrand

Authors
  1. Philippe Jorrand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf T. Nossum

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jorrand, P. (1988). Fundamental mechanisms for artificial intelligence programming languages. In: Nossum, R.T. (eds) Advanced Topics in Artificial Intelligence. ACAI 1987. Lecture Notes in Computer Science, vol 345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50676-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-50676-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50676-8

  • Online ISBN: 978-3-540-46068-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation