Theoretical Computer Science
Computational aspects of linear logic
Computational aspects of linear logic
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Semantic construction in feature-based TAG
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Generating with a grammar based on tree descriptions: a constraint-based approach
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Polarized unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
The Non-associativity of Polarized Tree-Based Grammars
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Associative Grammar Combination Operators for Tree-Based Grammars
Journal of Logic, Language and Information
TuLiPA: towards a multi-formalism parsing environment for grammar engineering
GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
Interaction grammar for the Persian language: noun and adjectival phrases
ALR7 Proceedings of the 7th Workshop on Asian Language Resources
Research on Language and Computation
Towards modular development of typed unification grammars
Computational Linguistics
The metagrammar compiler: an NLP application with a multi-paradigm architecture
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
| Hi-index | 0.00 |
Interaction Grammars (IG) are a new linguistic formalism which is based on descriptions of underspecified trees in the framework of intuitionistic linear logic (ILL). Syntactic composition, which is expressed by deduction in linear logic, is controlled by a system of polarized features. In this way, parsing amounts to generating models of trees descriptions and it is implemented as a constraint satisfaction problem.