The Tbilisi Symposium on Logic, Language and Computation: Selected Papers

Author:   Jonathan Ginzburg (Hebrew University of Jerusalem) ,  Zurab Khasidashvili (NTT Basic Research) ,  Carl-Wilhelm Vogel (University of Dublin) ,  Jean-Jacques Lévy (Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt)
Publisher:   Centre for the Study of Language & Information
ISBN:  

9781575860985


Pages:   408
Publication Date:   28 January 1998
Format:   Paperback
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $79.20 Quantity:  
Add to Cart

Share |

The Tbilisi Symposium on Logic, Language and Computation: Selected Papers


Add your own review!

Overview

This volume brings together papers from linguists, logicians, and computer scientists from thirteen countries (Armenia, Denmark, France, Georgia, Germany, Israel, Italy, Japan, Poland, Spain, Sweden, UK, and USA). 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 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.

Full Product Details

Author:   Jonathan Ginzburg (Hebrew University of Jerusalem) ,  Zurab Khasidashvili (NTT Basic Research) ,  Carl-Wilhelm Vogel (University of Dublin) ,  Jean-Jacques Lévy (Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt)
Publisher:   Centre for the Study of Language & Information
Imprint:   Centre for the Study of Language & Information
Dimensions:   Width: 15.20cm , Height: 2.50cm , Length: 22.80cm
Weight:   0.560kg
ISBN:  

9781575860985


ISBN 10:   1575860988
Pages:   408
Publication Date:   28 January 1998
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Table of Contents

Introduction; 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List