Skip to main content
SpringerLink
Log in

Constraint logic programming for computational linguistics

  • Conference paper
  • First Online:
Logical Aspects of Computational Linguistics (LACL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1328))

Abstract

In computational linguistics, we are often interested in developing grammar formalisms declaratively. However, tractability often becomes a problem then. Therefore, we want to argue for the use of constraint logic programming (CLP), and it is yet interesting to note that most logic based natural language systems have not attempted to employ CLP. Our framework and the prototype system UBS combines logic programming with constraint domains (e.g. typed feature structures and finite sets) and constraint techniques (e.g. coroutining).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hassan AÏt-Kaci, Robert Boyer, Patrick Lincoln, and Robert Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115–146, 1989.

    Article  Google Scholar 

  2. Puri Arenas-Sanchez and Agostino Dovier. Minimal set unification. In Manuel Hermenegildo and S. Doaitse Swierstra, editors, Proceedings of the 7th International Symposium on Programming Language Implementation and Logic Programming, pages 397–414. Springer, Berlin, Heidelberg, New York, 1995. In LNCS 982.

    Google Scholar 

  3. Franz Baader and Klaus U. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Ugo Montanari and Francesca Rossi, editors, Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming, Cassis, France, pages 380–397. Springer, Berlin, Heidelberg, New York, 1995. In LNCS 976.

    Google Scholar 

  4. Peter Baumgartner and Frieder Stolzenburg. Constraint model elimination and a PTTP-implementation. In Peter Baumgartner, Reiner Hähnle, and Joachim Posegga, editors, Proceedings of the 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 201–216. Springer, Berlin, Heidelberg, New York, 1995. In LNAI 918.

    Google Scholar 

  5. Bob Carpenter. The Logic of Typed Feature Structures. With Applications to Unification Grammars, Logic Programs and Constraint Resolution. Cambridge University Press, Cambridge, New York, Melbourne, 1992.

    Google Scholar 

  6. Liviu-Virgil Ciortuz. Object-oriented inferences in a logical framework for feature grammars. In Rafael C. Carrasco and Jose Oncina, editors, Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications, pages 45–56. Springer, Berlin, Heidelberg, New York, 1994. In LNCS 862.

    Google Scholar 

  7. Liviu-Virgil Ciortuz. DF constraint system. Technical Report IT-95-280, Université de Lille I, 1995.

    Google Scholar 

  8. Alain Colmerauer. Theoretical model of Prolog II. In Michel van Canegham and David H. D. Warren, editors, Logic programming and its applications, pages 3–31. Ablex Publishing Corporation, Norwood, NJ, 1986.

    Google Scholar 

  9. ECRC GmbH, München. ECLiPSe 3.5: User Manual — Extensions User Manual, 1995.

    Google Scholar 

  10. Thorn Frühwirth. Constraint handling rules. In Andreas Podelski, editor, Constraints: Basics and Trends, pages 90–107. Springer, Berlin, Heidelberg, New York, 1995. In LNCS 910.

    Google Scholar 

  11. Peter Gerstl. Mengenkonzepte in Unifikationsgrammatiken. IWBS Report 223, IBM Deutschland, Stuttgart, 1992.

    Google Scholar 

  12. Stephan Höhne. Wortstellung bei deutschen Infinitiven: Konzeption eines Parsers auf der Basis typisierter Merkmalstrukturen und HPSG und Implementierung in einer constraint-basierten logischen Programmiersprache. Diplomarbeit, Johann-Wolfgang-Goethe-Universität, Frankfurt, 1996.

    Google Scholar 

  13. Joxan Jaffar and Michael J. Mäher. Constraint logic programming: a survey. Journal of Logic Programming, 19,20:503–581, 1994.

    Article  MathSciNet  Google Scholar 

  14. Mark Johnson. Features and formulae. Computational Linguistics, 17(2):131–151, 1991.

    Google Scholar 

  15. Mark Johnson. Computing with features as formulae. Computational Linguistics, 20(1):1–25, 1994.

    Google Scholar 

  16. Ronald Kaplan and Joan Bresnan. Lexical functional grammar: A formal system for grammatical representation. In Joan Bresnan, editor, The Mental Representation of Grammatical Relations, pages 173–281. MIT Press, Cambridge, MA, London, England, 1982.

    Google Scholar 

  17. Ulrich Koch. Deutsche Relativsätze in HPSG. Studienarbeit S 437, Universität Koblenz, 1996.

    Google Scholar 

  18. Christoph Lehner. Grammatikentwicklung mit Constraint-Logikprogrammierung. DISKI 29. infix, Sankt Augustin, 1993.

    Google Scholar 

  19. John Wylie Lloyd. Foundations of Logic Programming. Springer, Berlin, Heidelberg, New York, 1987.

    Google Scholar 

  20. Suresh Manandhar. An attributive logic of set descriptions and set operations. In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, 1994.

    Google Scholar 

  21. Rainer Manthey and François Bry. SATCHMO: a theorem prover implemented in Prolog. In Ewing Lusk and Ross Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction, Argonne, Illinois, USA, 1988, pages 415–434. Springer, Berlin, Heidelberg, New York, 1988. In LNCS 310.

    Google Scholar 

  22. Chris S. Mellish. Implementing systemic classification by unification. Computational Linguistics, 14(1):40–51, 1988.

    Google Scholar 

  23. Chris S. Mellish. Term-encodable description spaces. In D. R. Brough, editor, Logic Programming, New Frontiers, pages 189–207. Intellect Books, 1992. Proceedings of the Conference in Bristol, UK, 1990.

    Google Scholar 

  24. Carl J. Pollard and M. Drew Moshier. Unifying partial description of sets. In Philip Hanson, editor, Information, Language, and Cognition, pages 285–322. University of British Columbia Press, Vancouver, BC, 1990.

    Google Scholar 

  25. Carl J. Pollard and Ivan A. Sag. Information-Based Syntax and Semantics. Volume 1: Fundamentals. CSLI, Leland Stanford Junior University, 1987. CSLI Lecture Notes 13.

    Google Scholar 

  26. Carl J. Pollard and Ivan A. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago, London, 1994. CSLI publication.

    Google Scholar 

  27. Mike Reape. Domain union and word order variation in German. In John Nerbonne, Klaus Netter, and Carl Pollard, editors, German in Head-Driven Phrase Structure Grammar, chapter 5, pages 151–197. CSLI, Leland Stanford Junior University, 1994. CSLI Lecture Notes 46.

    Google Scholar 

  28. Ivan A. Sag. English relative clause constructions. Journal of Linguistics, 1997. To appear.

    Google Scholar 

  29. Patrick Saint-Dizier. Advanced Logic Programming for Language Processing. Academic Press, London, 1994.

    Google Scholar 

  30. Peter H. Schmitt and Wolfgang Wernecke. Tableau calculus for order-sorted logic. In Karl Haus Bläsius, Ulrich Hedtstück, and Claus-Rainer Rollinger, editors, Sorts and Types in Artificial Intelligence, pages 49–60, Berlin, Heidelberg, New York, 1989. Workshop, Eringerfeld, Springer. In LNAI 418.

    Google Scholar 

  31. Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18:229–258, 1994.

    Article  MathSciNet  Google Scholar 

  32. Frieder Stolzenburg. Typisierte Merkmalstrukturen und HPSG. Eine Erweiterung von UBS in SEPIA. Diplomarbeit D 192, Universität Koblenz, 1992.

    Google Scholar 

  33. Frieder Stolzenburg. Membership-constraints and complexity in logic programming with sets. In Franz Baader and Klaus U. Schulz, editors, Frontiers in Combining Systems, pages 285–302. Kluwer Academic, Dordrecht, The Netherlands, 1996.

    Google Scholar 

  34. Frieder Stolzenburg and Martin Volk. UBS — Eine unifikationsbasierte Sprache zur Implementation von HPSG. LDV-Forum, 9(1):10–13, 1992.

    Google Scholar 

  35. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, London, England, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Frieder Stolzenburg & Ulrich Koch

  2. Universität Frankfurt, Robert-Mayer-Str. 11-15, D-60325, Frankfurt, Germany

    Stephan Höhne

  3. Universität Zürich, Winterthurerstr. 190, CH-8057, Zürich, Switzerland

    Martin Volk

Authors
  1. Frieder Stolzenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephan Höhne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ulrich Koch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Volk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stolzenburg, F., Höhne, S., Koch, U., Volk, M. (1997). Constraint logic programming for computational linguistics. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052169

Download citation

  • DOI: https://doi.org/10.1007/BFb0052169

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63700-4

  • Online ISBN: 978-3-540-69631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation