About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Šebelík, Jan
Horn clause programs and recursive functions defined by systems of equations. (English). Kybernetika, vol. 18 (1982), issue 2, pp. 106-120
MSC: 03D10, 03D20, 03D60, 68C30, 68Q65, 68T15 | MR 679783 | Zbl 0489.03013
References:
[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 0572084 | Zbl 0426.68002
[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 0491111
Partner of
EuDML logo