Skip to main content
SpringerLink
Log in
Book cover

Portuguese Conference on Artificial Intelligence

EPIA 1993: Progress in Artificial Intelligence pp 61–76Cite as

Resolution of constraints in algebras of rational trees

  • Conference paper
  • First Online:

  • 722 Accesses

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

Abstract

This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in polynomial time, the size of the constraints using a rewriting system before applying a complete algorithm. This rewriting system works essentially by rewriting constraints using the information in a partial model. An efficient C implementation of the rewriting system is described and an algorithm for factoring complex constraints is also presented.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Luis Damas, Nelma Moreira, and Giovanni B. Varile. The formai and processing models of CLG. In Fiifth Conference of the European Chapter of the Association for Computational Linguistics, pages 173–178, Berlin, 1991.

    Google Scholar 

  2. Luis Damas, Nelma Moreira, and Giovanni B. Varile. The formal and computational theory of constraint logic grammars. In Proceedings of the Workshop on Constraint Propagation and Linguistic Description, Lugano, 1992.

    Google Scholar 

  3. Luis Damas and Giovanni B. Varile. CLG: A grammar formalism based on constraint resolution. In E.M.Morgado and J.P.Martins, editors, EPIA 89, volume 390 of Lecture Notes in Artificial Intelligence, pages 175–186. Springer Verlag, 1989.

    Google Scholar 

  4. Luis Damas and Giovanni B. Varile. On the satisfiability of complex constraints. In Proceedings of the 14th International Conference on Computational Linguistics (COLING), Nantes, France, 1992.

    Google Scholar 

  5. A. Eisele and J. Dörre. Unification of disjunctive feature descriptions. In 26th Annual Meeting of the Association for Computational Linguistics, Buffalo, New York, 1988.

    Google Scholar 

  6. R. T. Kasper. Unification method for disjunctive feature descriptions. In 25th Annual Meeting of the Association for Computational Linguistics, Standford, CA, 1987.

    Google Scholar 

  7. R. Kaplan and J. Bresnan. Lexical functional grammar: A formal system for grammatical representation. In Joan Bresnan, editor, The Mental Representation of Grammatical Relations. MIT Press, 1982.

    Google Scholar 

  8. Michael J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. Technical report, IBM Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, U.S.A., 1988.

    Google Scholar 

  9. John T. Maxwell and Ronald M. Kaplan. A method for disjunctive constraint satisfaction. In Massaru Tomita, editor, Current Issues in Parsing Technology. Kluwer Academic Publishers, 1991.

    Google Scholar 

  10. Carl Pollard and Ivan Sag. Information Based Syntax and Semantics, Volume 1, Fundamentals, volume 13. Center for the Study of Language and Information Stanford, 1987.

    Google Scholar 

  11. W.C. Rounds and R.T. Kasper. A complete logical calculus for record structures representing linguistic information. In Symposium on Logic in Computer Science, IEEE Computer Society, 1986.

    Google Scholar 

  12. Gert Smolka. Feature logic with subsorts. Technical report, IBM Wissenschafliches Zentrum, Institut für Wissensbasierte Systeme, 1989. LILOG Report 33.

    Google Scholar 

  13. Gert Smolka and Ralf Treinen. Records for logic programming. In Krzysztof Apt, editor, ICLP92. MIT, 1992.

    Google Scholar 

  14. Stuart M. Shieber, Hans Uszkoreit, Fernando C.N. Pereira, J. Robinson, and M. Tyson. The formalism and implementation of PATR-II. In B. J. Grosz and M. E. Stickel, editors, Research on Interactive Acquisition and Use of Knowledge. SRI report, 1983.

    Google Scholar 

  15. Hans Uszkoreit. Categorial unification grammar. In Proceedings of the 11th International Conference on Computational Linguistics (COLING), Bonn, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIACC, Universidade do Porto, Rua do Campo Alegre, 823, 4100, Porto, Portugal

    Luis Damas, Nelma Moreira & Sabine Broda

Authors
  1. Luis Damas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nelma Moreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sabine Broda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Miguel Filgueiras Luís Damas

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damas, L., Moreira, N., Broda, S. (1993). Resolution of constraints in algebras of rational trees. In: Filgueiras, M., Damas, L. (eds) Progress in Artificial Intelligence. EPIA 1993. Lecture Notes in Computer Science, vol 727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57287-2_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-57287-2_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57287-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation