Processing language with logical types and active constraints

Authors:
Patrick Saint-Dizier
Affiliations:
IRIT Université Paul Sabatier, Toulouse, France
Venue:
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Year:
1991

Citing 6
Cited 2

Login: A logic programming language with built-in inheritance

Journal of Logic Programming
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An introduction to Prolog III

Communications of the ACM
Programming in logic with constraints for natural language processing

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Expressing disjunctive and negative feature constraints with classical first-order logic

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Typed unification grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3

Inheritance and constraint-based grammar formalisms

Computational Linguistics - Special issue on inheritance: I
Using active constraints to parse GPSGs

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this document, we present a language which associates type construction principles to constraint logic programming. We show that it is very appropriate for language processing, providing more uniform, expressive and efficient tools and treatments. We introduce three kinds of constraints, that we exemplify by motivational examples. Finally, we give the procedural semantics of our language, combining type construction with SLD-resolution.