Anti-dynamics: presupposition projection without dynamic semantics

2007 ◽  
Vol 16 (3) ◽  
pp. 325-356 ◽  
Author(s):  
Philippe Schlenker
Keyword(s):  
Dynamic Semantics ◽  
Presupposition Projection

scholarly journals Dynamic Semantics, Derived Presuppositions, and the Proviso Problem

2014 ◽  
Author(s):  
David Edward Schueler
Keyword(s):  
Dynamic Semantics ◽  
Presupposition Projection

<p>The proviso problem (Geurts 1996) is a descriptive inadequacy of satisfaction-type theories of presupposition projection (Heim 1983). DRT models (Geurts 1999) predict the (b) (strengthened) presuppositions below, but DRT fails to model true conditional presuppositions like (1a).</p><p>(1)  a.   Presupposition<sub>sat</sub>:    b.  Presupposition<sub>default</sub>:</p><p> </p><p>(2))      a.    Presupposition<sub>sat</sub>:    b.  Presupposition<sub>default</sub>:  and</p>I propose with DRT that strengthening is structural, but within a fully compositional variant of Heim’s (1983) dynamic semantics.

Cross-speaker anaphora in dynamic semantics

2010 ◽  
Vol 14 (2) ◽  
pp. 103-129
Author(s):  
Jae-Il Yeom
Keyword(s):  
Dynamic Semantics

Presupposition Projection of Conditionals

2019 ◽  
Vol 23 (1) ◽  
pp. 69-89
Author(s):  
Seong Eun Park
Keyword(s):  
Presupposition Projection

scholarly journals A Computational Treatment of Anaphora and Its Algorithmic Implementation

2020 ◽  
Author(s):  
Jean-Philippe Bernardy ◽  
Stergios Chatzikyriakidis ◽  
Aleksandre Maskharashvili
Keyword(s):  
Dynamic Semantics ◽  
Test Suite ◽  
Abstract Syntax ◽  
Computational Approaches ◽  
Complex Cases

AbstractIn this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach–Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.

scholarly journals Self-organising Logic of Structures as a Basis for a Dependency-based Dynamic Semantics Model

2015 ◽  
pp. 25-55
Author(s):  
Maciej Piasecki
Keyword(s):  
Language Use ◽  
Semantic Representation ◽  
Theoretical Perspective ◽  
Expressive Power ◽  
Dynamic Semantics ◽  
Huge Number ◽  
Language Data ◽  
Polish Language ◽  
Representation Language ◽  
Local Range

Self-organising Logic of Structures as a Basis for a Dependency-based Dynamic Semantics ModelWe present Self-organising Logic of Structures (SLS), a semantic representation language of high expressive power, which was designed for a fully compositional representation of discourse anaphora following the Dynamic Semantics paradigm. The application of SLS to the description of possible meanings of Polish multiple quantifier sentences is discussed. Special attention is paid to the phenomena of: cardinality dependency/independency of Noun Phrase quantifiers and variety of quantification. Semantic representation based on several formal operators is proposed. They can be combined in many different ways, if one takes a purely theoretical perspective. However, in the paper we show that this huge number is practically reduced in the language use and is governed by several constraints motivated by the analysis of Polish language data. The Hypothesis of Local Range of Cardinality Dependency is formulated as an alternative to representations based on quantifier rising technique. SLS provides a multi-layered language description of inter-linked representation of sever antification, reference, presupposition and anaphora.

scholarly journals Polymorphic subtyping for effect analysis: The dynamic semantics

1997 ◽  
pp. 172-206 ◽  
Author(s):  
Torben Amtoft ◽  
Flemming Nielson ◽  
Hanne Riis Nielson ◽  
Jürgen Ammann
Keyword(s):  
Dynamic Semantics ◽  
Effect Analysis

scholarly journals Task model simulators: a review

2015 ◽  
Vol Volume 3, Issue 3, Special... (Special issue on Task Models) ◽  
Author(s):  
Thomas Lachaume ◽  
Laurent Guittet ◽  
Patrick Girard ◽  
Allan Fousse
Keyword(s):  
Human Activity ◽  
Dynamic Semantics ◽  
Early Years ◽  
Task Model ◽  
Long Time ◽  
International Audience ◽  
Pencil And Paper

International audience La description de l’activité humain-système par des modèles de tâches existe depuis plusieurs années. Après l’époque papier-crayon, les outils d’édition des modèles de tâches ont permis la conception et l’archivage des modèles selon une notation rigoureuse, et la vérification de leur cohérence. Mais la compréhension de la dynamique est restée affaire de spécialiste jusqu’à l’apparition des simulateurs de modèles. Une simulation permet d’appréhender les enchaînements réels de tâches - décrits implicitement par les opérateurs temporels - et de valider les scénarios ainsi réalisés. Cet article décrit et compare les simulateurs actuellement disponibles et maintenus, et explique leurs différents usages en fonction des buts et niveaux d’expertise des utilisateurs. De nouvelles perspectives d’évolutions de ces modèles et outils sont alors définies dans le but d’améliorer leur sémantique. Task modelling has enabled the building of models of human activity for a long time. In the early years, pencil and paper where the only means available to build task models from task model notations. Because of the lack of computed constraints, task models often did not conform to the notation. To solve this problem, some tools were designed by authors in order to help users create, modify and save correct models that conform to the notation syntactic rules. However, understanding the full semantics of task models appeared difficult for practitioners. The dynamic aspects of task models could only be understood "in the user's head". New tools, named simulators, emerged to solve this problem. They allow to "run" or to "simulate" task models and to record scenarios. This execution fulfils the semantics of task model operators, which define the task dynamic semantics. Simulators can be used in many ways such as understanding model semantics, verifying or validating models, building valid scenarios, etc. In this article, we describe and compare currently available and maintained task model simulators, and explain the different usages of these tools, according to user goals and qualifications. Then, we explore the different challenges for these tools to exploit the complete semantics of task models.

Sign in / Sign up

Export Citation Format

Share Document