Abstract
Complex indeterminates and their notation are introduced into Prolog. The syntax and semantics of the new language are described. The language builds in an extension to the usual unification. Detailed examples are given to demonstrate discourse models based on situation semantics in the proposed language. Discourse, connective and resource situations are included in the examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise, J. and Perry, J.Situations and Attitudes, MIT Press, 1983.
Barwise, J., “Lectures on Situation Semantics,”Winter Quarter at CSLI, 1984.
Bowen, D. (ed.), Byrd, L. M., Pereira, F. C. N., Pereira, L. M. and Warren, D. H. D.,DE Csystem-10 Prolog User’s Manual, Department of Artificial Intelligence, University of Edinburgh, 1982.
Brady, M. and Berwick, R. (eds.),Computational Models of Discourse, MIT Press, 1982.
Bresnan, J. (ed.),Mental Representation of Grammatical Relations, MIT Press, 1983.
Colmerauer, A., “Prolog II: Reference Manual and Theoretical Model.,”Internal Report, Groupe Intelligence Artificielle, Universite d’Aix-Marseille II, 1982.
van Emden, M. H. and Lloyd, J. W., “A Logical Reconstruction of Prolog II,”Journal of Logic Programming,Vol.,1,No. 2, 1984.
Gazdar, G., Klein, E., Pullum, G. K. and Sag, I. A.,Generalized Phrase Structure Grammar, Basil Blackwell Publisher Ltd., Oxford, 1985.
Hilbert, D. and Bernays, P.,Grundlagen der Mathematik II, Springer, 1939.
Jaffar, J., Lassez, J-L. and Lloyd, J. W., “Completeness of the Negation-as-Failure Rule,”Proceeding 8th IJCAI, Karsruhe, pp. 500–506, Aug., 1983.
Jaffar, J., Lassez, J-L. and Maher, J. “A Theory of Complete Logic Programs with Equality,”Journal of Logic Programming,Vol. 1,No. 3, 1984.
Lloyd, J. W., “Foundations of Logic Programming,”Technical Report, 82/7, Department of Computer Science, University of Melbourne, 1982; revised March, 1984.
Maehara, S.,Mathematical Logic, Baifu-kan, Tokyo, 1976, [in Japanese]
Mukai, K., “Horn Clause Logic with Parameterized Types for Situation Semantics Programming,”ICOT Technical Report, TR-101, February, 1985.
Mukai, K., “Feature System and Unification,” inSome Aspects of Generalized Phrase Structure Grammar, ICOT Working Group 3.4; also inICOT Technical Memorandum, TM-0103, March, 1985.
Mukai, K., “Unification over Complex Indeterminates in Prolog,”ICOT Technical Report, TR-113, June, 1985; also inProceedings of the Logic Programming Conference ’85, Tokyo, July, 1985.
Pereira, F. C. N. and Shieber, S. M., “The Semantics of Grammar Formalisms Seen as Computer Languages,”Proceedings of the 10th International Conference on Computational Linguistics, Stanford University, California, 1984.
Pereira, F. C. N. and Warren, D. H. D., “Definite Clause Grammars for Language Analysis —A Survey of the Formalism and a Comparison with Augmented Transition Networks,Artificial Intelligence, 13, pp. 231–278, 1980.
Scott, Danna S., “Domains for Denotational Semantics,”Proceedings of ICALP’82, Aarhus, Denmark, July, 1982.
Shieber, S. M., “The Design of a Computer Language for Linguistic Information,”Proceedings of the 10th International Conference on Computational Linguistics, Stanford University, 1984.
Suzuki, H., “MAID: a Man-machine Interface for Domestic Affairs,”ICOT Technical Memorandum, TM-0058, Institute for New Generation Computer Technology, Tokyo, 1984.
Uchida, S. and Yokoi, T., “Sequential Inference Machine: SIM —Progress Report —,”Proceedings of the International Conference on Fifth Generation Computer Systems 1984 (ICOT, ed.), pp. 58–69, November, 1984.
Author information
Authors and Affiliations
Additional information
This is a revised version of Ref. 16)
About this article
Cite this article
Mukai, K., Yasukawa, H. Complex indeterminates in Prolog and its application to discourse models. NGCO 3, 441–466 (1985). https://doi.org/10.1007/BF03037080
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037080