English
Related papers

Related papers: A dependently-typed calculus of event telicity and…

200 papers

This work proposes a dependent type theory that combines functions and session-typed processes (with value dependencies) through a contextual monad, internalising typed processes in a dependently-typed lambda-calculus. The proposed…

Programming Languages · Computer Science 2018-01-25 Bernardo Toninho , Nobuko Yoshida

The interpretation of the lexical aspect of verbs in English plays a crucial role for recognizing textual entailment and learning discourse-level inferences. We show that two elementary dimensions of aspectual class, states vs. events, and…

Computation and Language · Computer Science 2020-11-03 Thomas Kober , Malihe Alikhani , Matthew Stone , Mark Steedman

We present two Dialectica-like constructions for models of intensional Martin-L\"of type theory based on G\"odel's original Dialectica interpretation and the Diller-Nahm variant, bringing dependent types to categorical proof theory. We set…

Category Theory · Mathematics 2021-05-04 Sean K. Moss , Tamara von Glehn

Though languages can evolve slowly, they can also react strongly to dramatic world events. By studying the connection between words and events, it is possible to identify which events change our vocabulary and in what way. In this work, we…

Computation and Language · Computer Science 2019-09-24 Guy D. Rosin , Kira Radinsky

Dependently typed lambda calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types" notion, such calculi can also encode the correspondence between…

Logic in Computer Science · Computer Science 2010-07-07 Zachary Snow , David Baelde , Gopalan Nadathur

We present a sequential model for temporal relation classification between intra-sentence events. The key observation is that the overall syntactic structure and compositional meanings of the multi-word context between events are important…

Computation and Language · Computer Science 2017-07-25 Prafulla Kumar Choubey , Ruihong Huang

This paper deals with an extended model of computations which uses the parameterized families of entities for data objects and reflects a preliminary outline of this problem. Some topics are selected out, briefly analyzed and arranged to…

Logic in Computer Science · Computer Science 2007-05-23 Larissa Ismailova , Konstantin Zinchenko , Lioubouv Bourmistrova

Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as…

Category Theory · Mathematics 2024-09-05 Daniel Quigley

In formal semantics, there are two well-developed semantic frameworks: event semantics, which treats verbs and adverbial modifiers using the notion of event, and degree semantics, which analyzes adjectives and comparatives using the notion…

Computation and Language · Computer Science 2020-11-03 Izumi Haruta , Koji Mineshima , Daisuke Bekki

Formalisms for specifying statistical models, such as probabilistic-programming languages, typically consist of two components: a specification of a stochastic process (the prior), and a specification of observations that restrict the…

Databases · Computer Science 2015-01-06 Vince Barany , Balder ten Cate , Benny Kimelfeld , Dan Olteanu , Zografoula Vagena

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

The behavioral specification of an object-oriented grammar model is considered. The model is based on full lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon…

cmp-lg · Computer Science 2008-02-03 Susanne Schacht , Udo Hahn , Norbert Broeker

To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary…

Logic in Computer Science · Computer Science 2015-12-18 Leonardo de Moura , Jeremy Avigad , Soonho Kong , Cody Roux

By adequate employing of complex event processing (CEP), valuable information can be extracted from the underlying complex system and used in controlling and decision situations. An example application area is management of IT systems for…

Software Engineering · Computer Science 2012-08-02 Istvan David

Probabilistic topic models are generative models that describe the content of documents by discovering the latent topics underlying them. However, the structure of the textual input, and for instance the grouping of words in coherent text…

Computation and Language · Computer Science 2016-06-02 Georgios Balikas , Massih-Reza Amini , Marianne Clausel

We investigate the extent to which Linear Temporal Logic (LTL) formulas can be uniquely characterized by a finite set of labeled examples. We consider different types of examples, ranging from finite words to transfinite words, as well as…

Logic in Computer Science · Computer Science 2026-04-27 Balder ten Cate , Dana Fisman , Roi Ohayon , Patrik Sestic

The combination of argumentation and probability paves the way to new accounts of qualitative and quantitative uncertainty, thereby offering new theoretical and applicative opportunities. Due to a variety of interests, probabilistic…

Artificial Intelligence · Computer Science 2018-03-12 Regis Riveret , Pietro Baroni , Yang Gao , Guido Governatori , Antonino Rotolo , Giovanni Sartor

Aspectual meaning refers to how the internal temporal structure of situations is presented. This includes whether a situation is described as a state or as an event, whether the situation is finished or ongoing, and whether it is viewed as…

Computation and Language · Computer Science 2023-03-13 Annemarie Friedrich , Nianwen Xue , Alexis Palmer

Deverbal nouns are nominal forms of verbs commonly used in written English texts to describe events or actions, as well as their arguments. However, many NLP systems, and in particular pattern-based ones, neglect to handle such nominalized…

Computation and Language · Computer Science 2023-06-27 Aviv Weinstein , Yoav Goldberg

In this position paper, we propose a reasoning framework that can model the reasoning process underlying natural language inferences. The framework is based on the semantic tableau method, a well-studied proof system in formal logic. Like…

Computation and Language · Computer Science 2025-02-10 Lasha Abzianidze
‹ Prev 1 2 3 10 Next ›