Logical Aspects of Computational Linguistics

LACL.- k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.- Dependency Structure Grammars.- Towards a Computational Treatment of Binding Theory.- Translating Formal Software Specifications to Natural Language.- On the Selective Lambek Calculus.- Grammatical Development with Xmg.- Lambek-Calculus with General Elimination Rules and Continuation Semantics.- A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars.- Large Scale Semantic Construction for Tree Adjoining Grammars.- A Compositional Approach Towards Semantic Representation and Construction of ARABIC.- Strict Deterministic Aspects of Minimalist Grammars.- A Polynomial Time Extension of Parallel Multiple Context-Free Grammar.- Learnable Classes of General Combinatory Grammars.- On Expressing Vague Quantification and Scalar Implicatures in the Logic of Partial Information.- Describing Lambda Terms in Context Unification.- Category TheoreticalSemantics for Pregroup Grammars.- Feature Constraint Logic and Error Detection in ICALL Systems.- Linguistic Facts as Predicates over Ranges of the Sentence.- How to Build Argumental Graphs Using TAG Shared Forest: A View from Control Verbs Problematic.- When Categorial Grammars Meet Regular Grammatical Inference.- The Expressive Power of Restricted Fragments of English.- The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars.- More Algebras for Determiners.