Abstract
This paper explores the possibilities of programming with graphical representations of logic programs. Two example programs are given in the concurrent logic language FGDC but many languages based on rewrite rules would be suitable for the same treatment. A graphical syntax promises to make programming in suitable ultra high level languages easier and more intuitive.
Similar content being viewed by others
References
Batani, C., Nardelli, E. and Tamassia, R., “A layout algorithm for dataflow diagrams,”TR 11.84, Dept. Informatica e Sistemistica, University of Rome, 1984.
Burt, A. and Ringwood, G. A., “The Bindig Conflict Problem in Concurrent Logic Languages,” Submitted IJPP, 1988.
Eisenstadt, M. and Brayshaw, M., “Graphical Debugging with Transparent Prolog Machine (TPM),”Proceedings of Tenth International Joint Conference on Artificial Intelligence (IJCAI-87), San Mateo CA, Morgan Kaufmann, 1987.
Grafton, R. and Ichikawa, T.,Computer, special issue on Visual Programming, IEEE, 1985.
Kowalski, R. A., “The relation between logic programming and logic specification,”Phil. Trans. R. Soc. Lond. A312, pp. 345–361, 1984.
Takeuchi, A., “How to solve it in concurrent Prolog,”Unpublished note, 1983.
Ringwood, G. A., “Pattern-Directed, Markovian, Guarded Definite Clause Resolution,” Submitted JLP, 1987 but rejected after the unreasonably long time of 21 months.
Ringwood, G. A., “Parlog86 and the Dining Logicians,”CACM, 31, pp. 10–25, 1988.
Ringwood, G. A., “Metalogic Machines: a Comparison of Concurrent Logic Languages,”2nd Int Symp. on AI and Expert Systems, Berlin, 1988.
Ringwood, G. A., “Metalogic Machines: a retrospective rationale of the Japanese Fifth Generation,” to be published Knowledge Engineering Review, CUP.
Ringwood, G. A., “A Comparative Exploration of Concurrent Logic Languages,” to be published Knowledge Engineering Review, CUP.
Author information
Authors and Affiliations
About this article
Cite this article
Ringwood, G.A. Predicates and pixels. New Gener Comput 7, 59–80 (1989). https://doi.org/10.1007/BF03037508
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037508