Algorithm = Logic + Control

Communications of the ACM

Volumn 22, Issue 7, 1979, Pages 424-436

  Kowalski, Robert ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

control language; logic programming; nonprocedural language; program specification; programming methodology; relational data structures

Indexed keywords

EID: 84976816925     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359131.359136     Document Type: Article

References (52)

1. Avi-Itzhak, B., and Naor, P. Some queueing problems with the service station subject to breakdowns. Oper. Res. 11, 3 (1963), 303-320.
2. Basket, F., Chandy, K.M., Muntz, R.R., and Palacois, F.G. Open, closed and mixed networks with different classes of customers. J. ACM 22, 2 (April 1975), 248-260
3. Chamberlin, D.D., Fuller, S.H., and Lin, L.Y. A page allocation strategy for multiprogramming systems with virtual memory. Proc. 4th Symp. Operating Systems Principles, 1973, pp. 66-72.
4. Coffman, E.G., and Mitrani, I. Selecting a scheduling rule that meets pre-specified response time demands. Proc. 5th Symp. Operating Systems Principles, 1975, pp. 187-191.
5. Courtois, P. Decomposability, instability and saturation in multiprogramming systems. Comm. ACM 18, 7 (July 1975), 371-377.
6. Denning, P.J., A note on paging drum efficiency. Computing Surveys 4, 1 (March 1972), 1-4.
7. Ghanem, M.Z. Study of memory partitioning for multiprogramming systems with virtual memory. IBM J. Res. Devel. 19, 5 (1975), 451-457.
8. Hine, J.H., Mitrani, I., and Tsur, S. The use of memory allocation to control response times in paged computer systems with different job classes. 2nd Int. Workshop on Modelling and Performance Evaluation of Computer Systems, Stressa, Oct. 1976, pp. 201-216.
9. Lynch, W.L. Do disk arms move? Tech. Rep. 1118, Jennings Comptr. Centre, Case Western Reserve U., Cleveland, Ohio, 1972.
10. Mitrani, I., and Avi-Itzhak, B. A many server queue with service interruptions. Oper. Res. 16, 3 (1968), 628-638.
11. Mitrani, I., and Hine, J.H. Complete parameterised families of job scheduling strategies. Tech. Rep. 81, Comptg. Lab., U. of Newcastle upon Tyne, England, 1975.
12. Reiser, M., and Kobayashi, H. Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J. Res. Devel. 19, 3 (May 1975), 283-294.
13. Wilhelm, N.C. An anomaly in disk scheduling: A comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses. Comm. ACM 19, 1 (Jan. 1976), 13-17.
14. Bibel, W., and Schreiber, J. Proof procedures in a Gentzen-like system of first-order logic. Proc. Int. Comptng. Symp., North-Holland Pub. Co., Amsterdam, 1975, pp. 205-212.
15. Bibel, W. Programmieren in der Sprache der Prädikatenlogik. Eingereicht als Habibitationsarbeit. Fachbereich Mathematik, Techn. München, Jan. 1975. Shorter versions published as: Prädikatives Programmieren. Lecture Notes in Computer Science, 33, GI-2. Fachtagung über Automatentheorie und formale Sprachen, SpringerVerlag, Berlin, Heidelberg, New York, 1975, pp. 274-283.
16. Bibel, W. Syntheses of strategic definitions and their control. Bericht Nr. 7610, Abt. Mathem., Techn. München, 1976.
17. Bibel, W. A uniform approach to programming. Bericht Nr. 7633, Abtl Mathem., Techn. München, 1976.
18. Bledsoe, W.W., and Bruell, P. A man-machine theorem-proving system. Artif. Intell. 5 (Spring 1974), 51-72.
19. Clark, K.L., and Tärnlund, S.A. A first order theory of data and programs. Information Processing 77, North-Holland Pub. Co., Amsterdam, 1977, pp. 939-944.
20. Clark, K., and Sickel, S. Predicate logic: A calculus for the formal derivation of programs. Proc. Int. Joint Conf. Artif. Intell., 1977.
21. Clark, K. The synthesis and verification of logic programs. Res. Rep., Dept. Comptng. and Control, Imperial College, London, 1977.
22. Clark, K., and Darlington, J. Algorithm analysis through synthesis. Res. Rep., Dept. Comptng. and Control, Imperial College, London, Oct. 1977.
23. Codd, E.F. A relational model for large shared databases. Comm. ACM 13, 6 (June 1970), 377-387.
24. Codd, E.F. Relational completeness of data base sublanguages. In Data Base Systems, R. Rustin, Ed., Prentice-Hall, Englewood Cliffs, N.J., 1972.
25. Colmerauer, A., Kanoui, H., Pasero, R., and Roussel, P. Un systeme de communication homme-machine en francais. Rapport preliminaire, Groupe de Res. en Intell. Artif, U. d'Aix-Marseille, Luminy, 1972.
26. Darlington, J., and Burstall, R.M. A system which automatically improves programs. Proc. of Third Int. Joint Conf. Artif. Intell., S.R.I., Menlo Park, Calif., 1973, pp. 437-542.
27. Darvas, F., Futo, I., and Szeredi, P. Logic based program for predicting drug interactions. To appear in Int. J. Biomedical Computing.
28. Deliyanni, A., and Kowalski, R.A. Logic and semantic networks. Comm. ACM 22, 3 (March 1979), 184-192.
29. Earley, J. An efficient context-free parsing algorithm. Comm. ACM 13, 2 (Feb. 1970), 94-102.
30. van Emden, M.H. Programming in resolution logic. To appear in Machine Representations of Knowledge published as Machine Intelligence 8, E.W. Elcock and D. Michie, Eds., Ellis Horwood and John Wylie.
31. Floyd, R.W. Non-deterministic algorithms. J. ACM 14, 4 (Oct. 1967), 636-644.
32. Hayes, P.J. Computation and deduction. Proc. 2nd MFCS Symp., Czechoslovak Acad, of Sciences, 1973, pp. 105-118.
33. Hewitt, C. Planner: A language for proving theorems in robots. Proc. of Int. Joint Conf. Artif. Intell., Washington, D.C., 1969, pp. 295-301.
34. Hogger, C. Deductive synthesis of logic programs. Res. Rep., Dept. Comptng. and Control, Imperial College, London, 1977.
35. Kleene, S.C. Introduction to Metamathematics. Van Nostrand, New York, 1952.
36. Kowalski, R.A. Logic for problem-solving. Memo No. 75, Dept. Comput. Logic, U. of Edinburgh, 1974.
37. Kowalski, R.A. Predicate logic as programming language. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 569-574.
38. Kowalski, R.A. A proof procedure using connection graphs. J. ACM 22, 4 (Oct. 1974), 572-95.
39. Kowalski, R.A., and Kuehner, D. Linear resolution with selection function. Artif. Intell. 2 (1971), 227-260.
40. Loveland, D.W. A simplified format for the model-elimination theorem-proving procedure. J. ACM 16, 3 (July 1969), 349-363.
41. Mac Carthy, J. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, P. Bratfort and D. Hirschberg, Eds., North-Holland Pub. Co., Amsterdam, 1967.
42. McSkimin, J.R., and Minker, J. The use of a semantic network in a deductive question-answering system. Proc. Int. Joint Conf. Artif. Intell., 1977, pp. 50-58.
43. Petri, C.A. Grundsatzliches zur Beschreibung diskreter Prozesse. Colloq. uber Automathentheorie, Birkhauser Verlag, Basel, Switzerland, 1967.
44. Pratt, V.R. The competence/performance dichotomy in programming. Proc. Fourth ACM SIGACT/SIGPLAN Symp. On Principles of Programming Languages, Santa Monica, Calif., Jan. 1977, pp. 194-200.
45. Robinson, J.A. Automatic deduction with hyper-resolution. Int. J. Comput. Math. 1 (1965), 227-34.
46. Roussel, P. Manual de reference et d'Utilisation. Groupe d'Intell. Artif., UER, Marseille-Luminy, France, 1975.
47. Schwarz, J. Using annotations to make recursion equations behave. Res. Memo, Dept. Artif. Intell., U. of Edinburgh, 1977.
48. Sickel, S. A search technique for clause interconnectivity graphs. IEEE Trans. Comptrs. (Special Issue on Automatic Theorem Proving), Aug. 1976.
49. Tärnlund, S.A. An interpreter for the programming language predicate logic. Proc. Int. Joint Conf. Artif. Intell., Tiblisi, 1975, pp. 601-608.
50. Warren, D. A system for generating plans. Memo No. 76, Dept. Comput. Logic, U. of Edinburgh, 1974.
51. Warren, D., Pereira, L.M., and Pereira, F. PROLOG—The language and its implementation compared with LISP. Proc. Symp. on Artif. Intell. and Programming Languages; SIGPLAN Notices (ACM) 12, 8; SIGART Newsletters (ACM) 64 (Aug. 1977), pp. 109-115.
52. Wirth, N. Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, N.J., 1976.