Sciweavers

2696 search results - page 6 / 540
» Semantic Abstraction and Anaphora
Sort
View
EACL
2003
ACL Anthology
13 years 11 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren
SIGDIAL
2010
13 years 7 months ago
Presupposition Accommodation as Exception Handling
Van der Sandt's algorithm for handling presupposition is based on a "presupposition as anaphora" paradigm and is expressed in the realm of Kamp's DRT. In recen...
Philippe de Groote, Ekaterina Lebedeva
ACL
2006
13 years 11 months ago
Translating HPSG-Style Outputs of a Robust Parser into Typed Dynamic Logic
The present paper proposes a method by which to translate outputs of a robust HPSG parser into semantic representations of Typed Dynamic Logic (TDL), a dynamic plural semantics de...
Manabu Sato, Daisuke Bekki, Yusuke Miyao, Jun-ichi...
BIRTHDAY
2009
Springer
14 years 1 months ago
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantic
Machines Olivier Danvy BRICS Report Series RS-08-7 ISSN 0909-0878 July 2008 08-7O.Danvy:DenotationalSemantics,NaturalSemantics,andAbstractMachinesforScheme
Olivier Danvy
APLAS
2006
ACM
14 years 3 months ago
Proof Abstraction for Imperative Languages
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
William L. Harrison