Ch\u00e0o m\u1eebng b\u1ea1n \u0111\u1ebfn v\u1edbi h\u01b0\u1edbng d\u1eabn to\u00e0n di\u1ec7n n\u00e0y v\u1ec1 Prolog, m\u1ed9t ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh logic n\u1ed5i b\u1eadt \u0111\u00e3 t\u00ecm th\u1ea5y c\u00e1c \u1ee9ng d\u1ee5ng trong nhi\u1ec1u l\u0129nh v\u1ef1c kh\u00e1c nhau, bao g\u1ed3m c\u1ea3 qu\u1ea3n l\u00fd m\u00e1y ch\u1ee7 proxy. Trong b\u00e0i vi\u1ebft n\u00e0y, ch\u00fang ta s\u1ebd \u0111i s\u00e2u v\u00e0o l\u1ecbch s\u1eed, c\u1ea5u tr\u00fac, t\u00ednh n\u0103ng, lo\u1ea1i, \u1ee9ng d\u1ee5ng v\u00e0 tri\u1ec3n v\u1ecdng trong t\u01b0\u01a1ng lai c\u1ee7a Prolog. Ch\u00fang t\u00f4i c\u0169ng s\u1ebd kh\u00e1m ph\u00e1 m\u1ed1i li\u00ean h\u1ec7 h\u1ea5p d\u1eabn gi\u1eefa m\u00e1y ch\u1ee7 proxy v\u00e0 Prolog, l\u00e0m s\u00e1ng t\u1ecf c\u00e1ch hai c\u00f4ng ngh\u1ec7 d\u01b0\u1eddng nh\u01b0 kh\u00e1c bi\u1ec7t n\u00e0y c\u00f3 th\u1ec3 \u0111\u01b0\u1ee3c k\u1ebft h\u1ee3p v\u1edbi nhau.<\/p>\n
Prolog, vi\u1ebft t\u1eaft c\u1ee7a \u201cL\u1eadp tr\u00ecnh trong LOGic\u201d, c\u00f3 ngu\u1ed3n g\u1ed1c t\u1eeb \u0111\u1ea7u nh\u1eefng n\u0103m 1970. Ng\u00f4n ng\u1eef n\u00e0y \u0111\u01b0\u1ee3c ph\u00e1t tri\u1ec3n b\u1edfi Alain Colmerauer v\u00e0 Philippe Roussel t\u1ea1i \u0110\u1ea1i h\u1ecdc Aix-Marseille, Ph\u00e1p. Prolog \u0111\u01b0\u1ee3c \u0111\u1ec1 c\u1eadp l\u1ea7n \u0111\u1ea7u ti\u00ean v\u00e0o n\u0103m 1972 khi Colmerauer \u0111\u01b0a ra kh\u00e1i ni\u1ec7m v\u1ec1 m\u1ed9t ng\u00f4n ng\u1eef s\u1eed d\u1ee5ng logic h\u00ecnh th\u1ee9c cho m\u1ee5c \u0111\u00edch l\u1eadp tr\u00ecnh.<\/p>\n
Prolog l\u00e0 ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh khai b\u00e1o nh\u1ea5n m\u1ea1nh v\u00e0o l\u00fd lu\u1eadn bi\u1ec3u t\u01b0\u1ee3ng v\u00e0 gi\u1ea3i quy\u1ebft v\u1ea5n \u0111\u1ec1 d\u1ef1a tr\u00ean logic. N\u00f3 d\u1ef1a tr\u00ean logic h\u00ecnh th\u1ee9c v\u00e0 cho ph\u00e9p ng\u01b0\u1eddi d\u00f9ng x\u00e1c \u0111\u1ecbnh c\u00e1c quy t\u1eafc v\u00e0 m\u1ed1i quan h\u1ec7 gi\u1eefa c\u00e1c \u0111\u1ed1i t\u01b0\u1ee3ng, cho ph\u00e9p c\u00e1c c\u01a1 ch\u1ebf suy lu\u1eadn v\u00e0 t\u00ecm ki\u1ebfm hi\u1ec7u qu\u1ea3. C\u00e1c ch\u01b0\u01a1ng tr\u00ecnh Prolog bao g\u1ed3m c\u00e1c s\u1ef1 ki\u1ec7n v\u00e0 quy t\u1eafc bi\u1ec3u di\u1ec5n ki\u1ebfn th\u1ee9c v\u00e0 c\u00e1c m\u1ed1i quan h\u1ec7.<\/p>\n
Prolog ho\u1ea1t \u0111\u1ed9ng d\u1ef1a tr\u00ean c\u01a1 ch\u1ebf h\u1ee3p nh\u1ea5t, bao g\u1ed3m vi\u1ec7c so kh\u1edbp c\u00e1c thu\u1eadt ng\u1eef v\u00e0 gi\u1ea3i c\u00e1c bi\u1ebfn. Khi m\u1ed9t truy v\u1ea5n \u0111\u01b0\u1ee3c th\u1ef1c hi\u1ec7n, Prolog c\u1ed1 g\u1eafng th\u1ed1ng nh\u1ea5t truy v\u1ea5n v\u1edbi c\u00e1c s\u1ef1 ki\u1ec7n v\u00e0 quy t\u1eafc c\u00f3 s\u1eb5n, cho ph\u00e9p truy v\u1ea5n t\u00ecm ra gi\u1ea3i ph\u00e1p th\u00f4ng qua m\u1ed9t quy tr\u00ecnh \u0111\u01b0\u1ee3c g\u1ecdi l\u00e0 quay lui. C\u01a1 ch\u1ebf quay lui n\u00e0y l\u00e0 n\u1ec1n t\u1ea3ng cho kh\u1ea3 n\u0103ng c\u1ee7a Prolog trong vi\u1ec7c kh\u00e1m ph\u00e1 nhi\u1ec1u gi\u1ea3i ph\u00e1p ti\u1ec1m n\u0103ng.<\/p>\n
Prolog t\u1ef1 h\u00e0o c\u00f3 m\u1ed9t s\u1ed1 t\u00ednh n\u0103ng ch\u00ednh gi\u00fap n\u00f3 kh\u00e1c bi\u1ec7t v\u1edbi c\u00e1c ng\u00f4n ng\u1eef l\u1eadp tr\u00ecnh truy\u1ec1n th\u1ed1ng:<\/p>\n
Prolog \u0111\u00e3 ph\u00e1t tri\u1ec3n theo th\u1eddi gian, t\u1ea1o ra nhi\u1ec1u ph\u01b0\u01a1ng ng\u1eef v\u00e0 c\u00e1ch tri\u1ec3n khai kh\u00e1c nhau. M\u1ed9t s\u1ed1 lo\u1ea1i Prolog \u0111\u00e1ng ch\u00fa \u00fd bao g\u1ed3m:<\/p>\n