This collection aims to serve as a catalyst for new interdisciplinary developments in language, logic and computation and to introduce new ideas from the expanded European academic community. Spanning a wide range of disciplines, the papers included in this volume cover such topics as formal semantics of natural language, dynamic semantics, channel theory, formal syntax of natural language, formal language theory, corpus-based methods in computational linguistics, computational semantics, syntactic and semantic aspects of l-calculus, non-classical logics, and a fundamental problem in predicate logic.
|Publisher:||Center for the Study of Language and Inf|
|Series:||Center for the Study of Language and Information - Lecture Notes Series|
|Edition description:||74th ed.|
|Product dimensions:||6.00(w) x 9.00(h) x 0.90(d)|
Table of ContentsIntroduction; Part I. Natural Language Semantics: 1. An account of negated sentences in the DRT framework; 2. Austinian propositions, Davidsonian events and perception complements; 3. A situation-theoretic interpretation of Bare plurals; Part II. Dynamic Semantics and Channel Theory: 4. The public and the private: two domains of analysis for semantic theory; 5. Modal subordination, focus and complement anaphora; 6. First-order theory change systems and their dynamic semantics; 7. A generalizable semantics for a default inheritance reasoner; Part III. Theoretical Linguistics: 8. An HPSG approach to definite concord and elliptical nominals; 9. On recent formal analyses of topic; Part IV. Computational Linguistics: 10. Estimating hidden Markov model topologies; 11. An evaluation of statistical scores for word association; 12. Computing incoherence of sentences from a logical representation of their semantics; 13. Lexical disambiguation with fine-grained tagsets; Part IV. Formal Language Theory: 14. Implementational aspects of a categorial grammar based on partial proof trees; 15. How to get rid of projection rules in context-free tree grammars; Part VI. Logic: 16. Some results in monadic Heyting algebras; 17. Decidability and finite model property of substructural logics; 18. A logic-based framework for action theories; 19. A modular presentation of modal logics in a logical framework; 20. On a logically but not functionally complete calculus in three-valued logic; Part VII. Theoretical Computer Science: 21. Sharing graphs, sharing morphisms, and (optimal) λ-graph reductions; 22. Logical full abstraction and PCF; properties of infinite reduction paths in untyped λ-calculus.