×

Horn clause computability. (English) Zbl 0359.02042


MSC:

03D99 Computability and recursion theory
03D10 Turing machines and related notions
03B10 Classical first-order logic
03D60 Computability and recursion theory on ordinals, admissible sets, etc.
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] H. Andreka and I. Nemeti,The generalised Completeness of Horn Predicate-Logic as a Programming Language, D.A.I. Research Report No. 21, Dept. of Artificial Intelligence, University of Edinburgh, 1976. · Zbl 0496.68021
[2] K. Clark and S.-Å. Tärnlund,A First Order Theory of Data and Programs, Department of Computing and Control, Imperial College London 1976; also to appear in Proc. IFIP 77 Congress, Toronto 1977.
[3] A. Colmerauer, et. al.,Un Système de Communication Homme-Machine en Français. Groupe d’Intelligence Artificielle U.E.R. de Luminy, Université d’Aix-Marseille, 1972.
[4] M. Davies,Eliminating the Irrevelant from Mechanical Proofs, Proc. Symp. Appl. Math., 18, American Mathematical Society. Providence, R,I. 1963.
[5] P. Hayes,Computation and Deduction, Proc. of MFCS Conf. Czechoslovakian Academy of Sciences, 1973.
[6] H. Kanoui,Application de la Démonstration Automatique aux Manipulations Algebriques et à l’Intégration Formelle sur Ordinateur, Groupe d’Intelligence Artificielle, U.E.R. de Luminy, Université d’Aix-Marseille, 1973.
[7] R. Kowalski,Predicate Logic as Programming Language, Proc. IFIP, 1974, North-Holland Pub. Co., Amsterdam. · Zbl 0297.68006
[8] R. Kowalski,Logic for Problem Solving, Memo No. 4, Department of Artificial Intelligence, University of Edinburgh, 1974. · Zbl 0426.68002
[9] M. Minsky,Computation: Finite and Infinite Machines, Prentice-Hall, 1967. · Zbl 0195.02402
[10] J. Reynolds,Transformational Systems and the Algebraic Structure of Atomic formulas, Machine Intelligence 5 (ed.) Meltzer, B. and Michie, D., Edinburgh University Press 1969.
[11] J. A. Robinson,A Machine-oriented Logic Based on the Resolution Principle, J.ACM, vol. 12, 1965. · Zbl 0139.12303
[12] P. Roussel,PROLOG, Manuel de Reference et d’Utilisation, Groupe d’Intelligence Artificielle, U.E.R. de Luminy, Université d’Aix-Marseille, 1975.
[13] A. M. Turing,On Computable Numbers with an Application to the Entscheidungsproblem, Proc. Lond. Math. Soc., Ser. 2, Vol. 42, 1936–7. · Zbl 0016.09701
[14] S.-Å. Tärnlund,Logic Information Processing, TRITA-1034, 1975-11-24, Dept. of Computer Science, Royal Institute of Technology, Stockholm.
[15] S.-Å. Tärnlund,A Logical Basis for Data Bases, TRITA-IBADB-1029, Dept. of Computer Science, Royal Institute of Technology, Stockholm, 1976.
[16] D. Warren,Implementing Prolog, a Language for Programming in Logic, Dept. of Artificial Intelligence, University of Edinburgh, 1976.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.