|
|
|||
|
||||
OverviewThis book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Logical Aspects of Computational Linguistics, LACL'98, held in Grenoble, France, in December 1998. The 15 revised full papers presented together with one invited paper were carefully reviewed and selected during two rounds of refereeing from 33 submissions and 19 conference presentations. Among the topics covered are various types of grammars, categorical inference, automated reasoning, constraint handling, logical forms, dialogue semantics, unification, and proofs. Full Product DetailsAuthor: Michael MoortgatPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2001 ed. Volume: 2014 Dimensions: Width: 15.50cm , Height: 1.60cm , Length: 23.50cm Weight: 0.950kg ISBN: 9783540422518ISBN 10: 354042251 Pages: 294 Publication Date: 13 June 2001 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsInvited Paper.- Deductions with Meaning.- Contributed Papers.- Computational Solutions for Structural Constraints.- Hypothetical Reasoning and Basic Non-Constituent Coordination in Yype-Logical Grammar.- Computational and Structural Aspects of Openly Specified Type Hierarchies.- Anaphora and Quantification in Categorial Grammar.- An LTAG Perspective on Categorial Inference.- Dominance Constraints: Algorithms and Complexity.- Strict Compositionality and Literal Movement Grammars.- Categorial Minimalism.- Sequential Construction of Logical Forms.- Derivational Minimalism Is Mildly Context–Sensitive.- Dominance Constraints in Context Unification.- A Revision System of Circular Objects and Its Applications to Dynamic Semantics of Dialogues.- Lexicalized Proof-Nets and TAGs.- Lambek Calculus Proofs and Tree Automata.- Grammars with Composite Storages.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |