Odile Papini 1 ; Vincent Risch 2
CC-BY 4.0
@article{ROIA_2024__5_2-3_17_0,
author = {Odile Papini and Vincent Risch},
title = {Introduction {(EN)}},
journal = {Revue Ouverte d'Intelligence Artificielle},
pages = {17--29},
publisher = {Association pour la diffusion de la recherche francophone en intelligence artificielle},
volume = {5},
number = {2-3},
year = {2024},
doi = {10.5802/roia.69en},
language = {en},
url = {https://roia.centre-mersenne.org/articles/10.5802/roia.69en/}
}
TY - JOUR AU - Odile Papini AU - Vincent Risch TI - Introduction (EN) JO - Revue Ouverte d'Intelligence Artificielle PY - 2024 SP - 17 EP - 29 VL - 5 IS - 2-3 PB - Association pour la diffusion de la recherche francophone en intelligence artificielle UR - https://roia.centre-mersenne.org/articles/10.5802/roia.69en/ DO - 10.5802/roia.69en LA - en ID - ROIA_2024__5_2-3_17_0 ER -
%0 Journal Article %A Odile Papini %A Vincent Risch %T Introduction (EN) %J Revue Ouverte d'Intelligence Artificielle %D 2024 %P 17-29 %V 5 %N 2-3 %I Association pour la diffusion de la recherche francophone en intelligence artificielle %U https://roia.centre-mersenne.org/articles/10.5802/roia.69en/ %R 10.5802/roia.69en %G en %F ROIA_2024__5_2-3_17_0
Odile Papini; Vincent Risch. Introduction (EN). Revue Ouverte d'Intelligence Artificielle, Volume 5 (2024) no. 2-3, pp. 17-29. doi : 10.5802/roia.69en. https://roia.centre-mersenne.org/articles/10.5802/roia.69en/
[1] Le manuel de Prolog IV, PrologIA, Marseille, 1996
[2] Optimal Narrowing of a Block of Sortings in Optimal Time, Constraints An Int. J., Volume 5 (2000) no. 1/2, pp. 85-118 | DOI | Zbl
[3] (Site personnel, http://alain.colmerauer.free.fr)
[4] An Interesting Subset of Natural Language, Logic Programming (K. L. Clark; S. A. Tarnlund, eds.), Academic Press, 1982, pp. 45-66
[5] Prolog in 10 Figures, Comm. ACM, Volume 28 (1985) no. 12, pp. 1296-1310 | DOI
[6] An Introduction to Prolog III, Commun. ACM, Volume 33 (1990) no. 7, pp. 69-90 | DOI
[7] Les systèmes Q ou un formalisme pour analyser et synthètiser des phrases sur ordinateur, TAL, Volume 33 (1992), pp. 105-148 https://api.semanticscholar.org/CorpusID:170632988
[8] Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees, Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International * Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings (Jacques Calmet; Belaid Benhamou; Olga Caprotti; Laurent Henocque; Volker Sorge, eds.) (Lecture Notes in Computer Science), Volume 2385, Springer (2002), pp. 2-3 | DOI | Zbl
[9] On the Complexity of Universal Programs, Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers (Maurice Margenstern, ed.) (Lecture Notes in Computer Science), Volume 3354, Springer (2004), pp. 18-35 | DOI | Zbl
[10] Back to the Complexity of Universal Programs, Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings (Peter J. Stuckey, ed.) (Lecture Notes in Computer Science), Volume 5202, Springer (2008), pp. 1-20 | DOI
[11] Un système de communication en français (Octobre 1972) (http://alain.colmerauer.free.fr/) (Rapport préliminaire de fin de contrat IRIA)
[12] The Birth of Prolog, History of Programming Languages Conference (HOPL-II) (John A. N. Lee; Jean E. Sammet, eds.), ACM, 1993, pp. 37-52 (Preprints, Cambridge, Massachusetts, USA, April 20-23, 1993)
[13] The quest for artificial intelligence : a history of ideas and achievements, Cambridge University Press, 2010 | DOI
[14] Hommage à Alain Colmerauer, Bulletin de l’AFIA, Volume 97 (2019), p. 4 (https://afia.asso.fr/wp-content/uploads/2019/05/97_jui17.pdf)
[15] Numéro Spécial en hommage à Jacques Pitrat, Revue Ouverte d’Intelligence Artificielle, Volume 3 (2022) no. 1-2, pp. 1-18
Cité par Sources :