Abstract
This paper presents a symbolic constraint logic programming language cu-Prolog, and shows a simple Japanese parser based on JPSG (Japanese Phrase Structure Grammar) as a suitable application.
cu-Prolog employs constraint unification instead of the ordinary unification, and handles symbolic constraints in terms of user-defined predicates. The program clause of cu-Prolog is an expansion of Horn clause and is called Constraint Added Horn Clause (CAHC). The constraint satisfaction mechanism of cu-Prolog is based on the unfold/fold transformation of logic programming.
Unlike most conventional CLP systems, cu-Prolog deals with constraints on the Herbrand universe to describe constraints on symbolic and combinatorial objects. In the application of natural language processing or of many AI problems, this kind of constraint is more important than those on numerical or boolean objects. In comparison with Prolog, cu-Prolog also has richer descriptive power, and is more declarative. In particular, cu-Prolog enables a natural implementation of unification-based grammar formalisms such as GPSG,HPSG, and JPSG.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing. Prentice-Hall, 1972.
Jon Barwise and John Perry. Situation and Attitudes. MIT Press, Cambridge, Mass, 1983.
Alan Borning, Michael Maher, Amy Martindale, and Molly Wilson. Constraint Hierarchies and Logic Programming. In Proc. of 6th International Conference of Logic Programming, pages 149–164, 1989.
A. Colmerauer. Prolog II Reference Manual and Theoretical Model. Technical report, ERACRANS 363, Groupe d'Intelligence Artificielle, Universite d'Aix-Marseille II, October 1982.
Gerald Gazdar, Ewan Klein, Geoffrey K. Pullum, and Ivan A. Sag. Generalized Phrase Structure Grammar. Basil Blackwell, England:Oxford, 1985.
Takao GUNJI. Japanese Phrase Structure Grammar. Reidel, Dordrecht, 1986.
Kôiti HASIDA. A Constraint-Based View of Language. Presented at Workshop on Situation Theory and its Application, 1989.
Kôiti HASIDA and Hidetosi SIRAI. Jyokentsuki Tan'itsu-ka (Conditioned Unification). Computer Software, 3(4):28–38, 1986. (in Japanese).
Joxan Jaffar and Jean Louis Lassez. Constraint Logic Programming. In Proceedings of the 14th ACM POPL Conference, pages 111–119, Munich, 1987.
Mitchell P. Marcus. A Theory of Syntactic Recognition for Natural Language. MIT Press, Cambridge:Mass, 1980.
Carl Pollard and Ivan A. Sag. Information-Based Syntax and Semantics, Vol.1 Fundamentals. CSLI Lecture Notes Series No.13. Stanford:CSLI, 1987.
Stuart M. Shieber. An Introduction to Unification-Based Approach to Grammar. CSLI Lecture Notes Series No.4. Stanford: CSLI, 1986.
Hisao TAMAKI and Taisuke SATO. UNFOLD/FOLD Transformation of Logic Programs. In Proc. of Second International Conference on Logic Programming, pages 127–137, 1983.
Hisao TAMAKI and Taisuke SATO. OLD Resolution with Tabulation. In Proc. of Third International Conference on Logic Programming, pages 84–98, 1986.
Hiroshi TSUDA, Kôiti HASIDA, and Hidetosi SIRAI. JPSG Parser on Constraint Logic Programming. In Proc. of 4th ACL European Chapter, pages 95–102, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hiroshi, T., Kôiti, H., Hidetosi, S. (1991). cu-Prolog and its application to a JPSG parser. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '89. LP 1989. Lecture Notes in Computer Science, vol 485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53919-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-53919-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53919-3
Online ISBN: 978-3-540-46398-6
eBook Packages: Springer Book Archive