Algèbres effectives dans la programmation logique avec contraintes

G. Blanc; N. Bleuzen-Guernalec

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1992)

  • Volume: 26, Issue: 3, page 221-242
  • ISSN: 0988-3754

How to cite

top

Blanc, G., and Bleuzen-Guernalec, N.. "Algèbres effectives dans la programmation logique avec contraintes." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 26.3 (1992): 221-242. <http://eudml.org/doc/92416>.

@article{Blanc1992,
author = {Blanc, G., Bleuzen-Guernalec, N.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {resolution invariability; constraints},
language = {fre},
number = {3},
pages = {221-242},
publisher = {EDP-Sciences},
title = {Algèbres effectives dans la programmation logique avec contraintes},
url = {http://eudml.org/doc/92416},
volume = {26},
year = {1992},
}

TY - JOUR
AU - Blanc, G.
AU - Bleuzen-Guernalec, N.
TI - Algèbres effectives dans la programmation logique avec contraintes
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 3
SP - 221
EP - 242
LA - fre
KW - resolution invariability; constraints
UR - http://eudml.org/doc/92416
ER -

References

top
  1. [Ar.Ni. 1] A. ARNOLD et M. NIVAT, The metric space of infinite trees. Algebraic and topological properties, Annales Societatis Matkernaticae Polonae, Séries IV : Fund. Inform., 1980, III, 4, p. 445-476. Zbl0453.68021MR604273
  2. [Ber.2] J. BERSTEL, Mots sans carré et morphismes itérés, Discrete Math., 1980, 29, p. 235-244. Zbl0444.20050MR560766
  3. [Ber. 3] J. BERSTEL, Some recent results on squarefree words, Conférence au « Symposium for Theoretical Aspect of Computer Science », (STACS'84), Paris, avril 1984. Zbl0582.68042MR773306
  4. [B.B.C. 4] G. BLANC, N. BLEUZEN-GUERNALEC et S. COUPET, Kleene Functor and Logic Programming, Laboratoire de Mathématiques de Marseille, 1989. 
  5. [Bl.Blg. 5] G. BLANC et N. BLEUZEN-GUERNALEC, Topologie et Décidabilité dans les Algèbres de mots infinis, Rapport technique, Dept. de Math., Marseille-Luminy, 1990. 
  6. [Cla. 6] K. L. CLARK, Negation as Failure, in Logic and Database, H. GALLAIRE et J. MINKER éd., Plenum Press, New York, 1978, p. 293-322. 
  7. [Col. 7] A. COLMERAUER, Prolog and Infinite Trees, in Logic Programming, K. L. CLARK et S. A. TARNLUND éd., Academic Press, New York, 1982, p. 231-251. MR754008
  8. [Col. 8] A. COLMERAUER, Une introduction à Prolog III, Note du G.I.A., Université d'Aix-Marseille-II, 1989. 
  9. [Coup. 9] S. COUPET-GRIMAL, Deux arguments pour les arbres infinis en Prolog, Thèse de Doctorat de l'Université d'Aix-Marseille-II, 1988. 
  10. [Cour. 10] B. COURCELLE, Fundamental properties of infinite Trees, Theoret. Comput. Sci., 1983, 25, (2), p. 95-169. Zbl0521.68013MR693076
  11. [v.Em.Ko. 11] M. H. VAN EMDEN et R. A. KOWALSKI, The semantics of Predicate Logic as a programming Language, J. A.C.M., 1976, 23, 4, p. 733-742. Zbl0339.68004MR455509
  12. [v.Em.Ll. 12] M. H. VAN EMDEN et W. LLOYD, A logical reconstruction of Prolog II, Proc. 2nd Conference on Logic Programming, Uppsala, Sweden, 1984, p. 35-40. Zbl0594.68033
  13. [Ja.La. 13] J. JAFFAR et J. L. LASSEZ, Constraint Logic Programming, Technical Report, Dept. of Comp. Sci., Monash University, juin 1986. 
  14. [Ja.La. 14] J. JAFFAR et J. L. LASSEZ, Constraint Logic Programming, in Proc. Conf. on Principles of Programming Languages, 1987. 
  15. [J.L.M. 15] J. JAFFAR, J. L. LASSEZ et M. J. MAHER, A logical foundation for Prolog II, technical report n 45, Monash University, 1985. 
  16. [J.L.M. 16] J. JAFFAR, J. L. LASSEZ et M. J. MAHER, Some issues and trends in the semantics of Logic Programming, Proc. 3rd International Conference on Logic Programming LNCS 225, Springer-Verlag, 1986. 
  17. [Ja.St. 17] J. JAFFAR et P. STUCKEY, Semantics of infinite tree logic programming, Theoret. Comput. Sci., 1986, 46, p. 141-158. Zbl0621.68054MR869203
  18. [Llo. 18] J. W. LLOYD, Foundation of Logic Programming, Symbolic Computation, Springer-Verlag, 1984. Zbl0547.68005
  19. [Mac. 19] A. MACINTYRE, Model Completeness, in Handbook of Mathematical Logic, J. BARWISE éd., North-Holland, 1978. 
  20. [Mah. 20] M. J. MAHER, Complete axiomatization of the algebras of finite, rational and infinite trees, Draft of paper in 3rd Logic in Computer Science Conference, Edinburgh, 1988. 
  21. [Ni.Pe. 21] M. NIVAT et D. PERRIN, Automata on Infinite Words, École de Printemps d'Informatique Théorique, Le Mont-Dore, mai 1984, Lecture Notes in Comput. Sci., 192 Zbl0563.00019
  22. [Re.Sa.22] A. RESTIVO et S. SALEMI, Overlap free words on two symbols, Lecture Notes in Comput. Sci., 1984, 192, p. 198-206. Zbl0572.20038MR814744

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.