摘要: The notion that computation = controlled deduction was first proposed by Pay Hayes [19] and more recently Bibel [2] Vaughn-Pratt [31]. A similar thesis database systems should be regarded as consisting of a relational component, which defines the logic data, control stores retrieves it, has been successfully argued Codd [10]. Hewitt's argument [20] for programming language PLANNER, though generally an against logic, can also algorithms both components. In this paper we shall explore some useful consequences thesis.
acm.org
sci-hub.se 参考文章(32)
Patrick J. Hayes, Computation and Deduction. mathematical foundations of computer science. pp. 105- 117 ,(1973)
Keith L. Clark, Sten-Åke Tärnlund, A First Order Theory of Data and Programs. ifip congress. pp. 939- 944 ,(1977)
Sharon Sickel, Keith L. Clark, Predicate Logic: A Calculus for the Formal Derivation of Programs. international joint conference on artificial intelligence. pp. 419- 420 ,(1977)
Jack Minker, James R. McSkimin, The use of a semantic network in a deductive question-answering system international joint conference on artificial intelligence. pp. 50- 58 ,(1977)
C. A. Petri, Grundsätzliches zur Beschreibung Diskreter Prozesse 3. Colloquium über Automatentheorie. pp. 121- 140 ,(1967) , 10.1007/978-3-0348-5879-3_10
Robert W. Floyd, Non-deterministic algorithms ,(1966)
H. Rasiowa, Introduction to Metamathematics ,(1952)
Carl Hewitt, PLANNER: a language for proving theorems in robots international joint conference on artificial intelligence. pp. 295- 301 ,(1969)
Sten-Ake Tarnlund, An interpreter for the programming language predicate logic international joint conference on artificial intelligence. pp. 601- 608 ,(1975)
Vaughan R. Pratt, The Competence/Performance Dichotomy in Programming POPL. pp. 194- 200 ,(1977)