Transition systems and dynamic semantics

Cross-speaker anaphora in dynamic semantics

Language and Information ◽

10.29403/li.14.2.7 ◽

2010 ◽

Vol 14 (2) ◽

pp. 103-129

Author(s):

Jae-Il Yeom

Keyword(s):

Dynamic Semantics

Download Full-text

Neural Transition Systems for Modeling Hierarchical Semantic Representations

10.21437/interspeech.2019-3075 ◽

2019 ◽

Author(s):

Riyaz Bhat ◽

John Chen ◽

Rashmi Prasad ◽

Srinivas Bangalore

Keyword(s):

Semantic Representations ◽

Transition Systems

Download Full-text

Battery transition systems

ACM SIGPLAN Notices ◽

10.1145/2578855.2535875 ◽

2014 ◽

Vol 49 (1) ◽

pp. 595-606 ◽

Cited By ~ 2

Author(s):

Udi Boker ◽

Thomas A. Henzinger ◽

Arjun Radhakrishna

Keyword(s):

Transition Systems

Download Full-text

A Computational Treatment of Anaphora and Its Algorithmic Implementation

Journal of Logic Language and Information ◽

10.1007/s10849-020-09322-7 ◽

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.

Download Full-text

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

Fundamenta Informaticae ◽

10.3233/fi-2021-1996 ◽

2021 ◽

Vol 178 (1-2) ◽

pp. 1-30

Author(s):

Florian Bruse ◽

Martin Lange ◽

Etienne Lozes

Keyword(s):

Model Checking ◽

Lower Bounds ◽

Expressive Power ◽

Higher Order ◽

Order Logic ◽

High Complexity ◽

Transition Systems ◽

Recursive Formulas ◽

Second Order Logic ◽

Monadic Second Order Logic

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k < 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

Download Full-text