Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Šebelík, Jan. Horn clause programs and recursive functions defined by systems of equations. Kybernetika, Tome 18 (1982) no. 2, pp. 106-120. http://geodesic.mathdoc.fr/item/KYB_1982_18_2_a1/
@article{KYB_1982_18_2_a1,
author = {\v{S}ebel{\'\i}k, Jan},
title = {Horn clause programs and recursive functions defined by systems of equations},
journal = {Kybernetika},
pages = {106--120},
year = {1982},
volume = {18},
number = {2},
mrnumber = {679783},
zbl = {0489.03013},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1982_18_2_a1/}
}
[1] C. L. Chang R. T. C. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press New York 1971.
[2] S. C. Kleene: Introduction to Metamathematics. North-Holland Publishing Co. - Amsterodam, P. Noordhoff N. V. - Groningen 1967.
[3] R. Kowalski: Logic for Problem Solving. North-Holland, New York 1979. | MR | Zbl
[4] J. Šebelík P. Štěpánek: Horn clause programs suggested by recursive functions. In: Prcceedings of the Logic Programming Workshop (S. Å. Tärnlund, ed.), Debrecen (Hungary), July 14-16, 1980.
[5] J. Šebelík P. Štěpánek: Horn clause programs for recursive functions. Preprint, 1980.
[6] S. Å. Tärnlund: Logic Information Processing. TRITA-IBADB-91029, 1975-11-24, Dept. Comp. Sci., Royal Institute of Tech., Stockholm 1975.
[7] S. Å. Tärnlund: Horn clause computability. BIT 17 (1977), 215-226. | MR