English
Related papers

Related papers: Modal languages for topology: expressivity and def…

200 papers

Language model architectures are predominantly first created for English and subsequently applied to other languages. It is an open question whether this architectural bias leads to degraded performance for languages that are structurally…

Computation and Language · Computer Science 2025-11-12 Kushal Tatariya , Wessel Poelman , Miryam de Lhoneux

The study of linguistic typology is rooted in the implications we find between linguistic features, such as the fact that languages with object-verb word ordering tend to have post-positions. Uncovering such implications typically amounts…

Computation and Language · Computer Science 2019-06-19 Johannes Bjerva , Yova Kementchedjhieva , Ryan Cotterell , Isabelle Augenstein

In this paper we give automata-based representation of LTL-FO$^+$ properties. LTL-FO$^+$ is an extension of LTL that includes first-order quantification over bounded variable, thus greatly increasing the expressivity of the language. An…

Formal Languages and Automata Theory · Computer Science 2016-10-25 Yannick Lebrun , Raphaël Khoury , Sylvain Hallé

While object diagrams (ODs) are widely used as a means to document object-oriented systems, they are expressively weak, as they are limited to describe specific possible snapshots of the system at hand. In this paper we introduce modal…

Software Engineering · Computer Science 2014-09-09 Shahar Maoz , Jan Oliver Ringert , Bernhard Rumpe

We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We show that this quantification should be distinguished from second-order quantification and…

Logic in Computer Science · Computer Science 2023-08-31 Pierre Carbonnelle , Matthias Van der Hallen , Marc Denecker

We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued…

Artificial Intelligence · Computer Science 2014-05-06 Hannes Strass

Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between $\mathrm{FO(TC^1)}$ and $\mathrm{FO(LFP)}$; (2)…

Logic in Computer Science · Computer Science 2015-06-30 Facundo Carreiro

We investigate the expressive power of state space models (SSM), which have recently emerged as a potential alternative to transformer architectures in large language models. Building on recent work, we analyse SSM expressiveness through…

Logic in Computer Science · Computer Science 2026-01-28 Eric Alsmann , Lowejatan Noori , Martin Lange

Human beings possess the most sophisticated computational machinery in the known universe. We can understand language of rich descriptive power, and communicate in the same environment with astonishing clarity. Two of the many contributors…

Computation and Language · Computer Science 2021-01-01 Karthikeya Ramesh Kaushik , Andrea E. Martin

We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…

Formal Languages and Automata Theory · Computer Science 2022-05-03 Joel D. Day , Vijay Ganesh , Nathan Grewal , Florin Manea

Some aspects of the physical nature of language are discussed. In particular, physical models of language must exist that are efficiently implementable. The existence requirement is essential because without physical models no communication…

Quantum Physics · Physics 2007-05-23 Paul Benioff

We prove in this paper that, under suitable coinditions on an initial data set, we can obtain Area and Curvature Estimates for simple marginally outer trapped surfaces (or MOTS). Using this estimates, we derive a Compactness Theorem for…

Differential Geometry · Mathematics 2011-08-30 José M. Espinar

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

Logic in Computer Science · Computer Science 2023-07-11 Xinghan Liu , Emiliano Lorini

Languages vary widely in how meanings map to word forms. These mappings have been found to support efficient communication; however, this theory does not account for systematic relations within word forms. We examine how a restricted set of…

Computation and Language · Computer Science 2026-01-27 Doreen Osmelak , Yang Xu , Michael Hahn , Kate McCurdy

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

Logic · Mathematics 2025-11-05 Toby Meadows

In this paper, we introduce the simulations and bisimulations on polarity-based semantics for non-distributive modal logic, which are natural generalizations of those notions on Kripke semantics for modal logic. We also generalize other…

Logic · Mathematics 2024-04-09 Yiwen Ding , Krishna Manoorkar , Mattia Panettiere , Ruoding Wang

Motivated by applications in moduli theory, we introduce a flexible and powerful language for expressing lower bounds on relative dimension of morphisms of schemes, and more generally of algebraic stacks. We show that the theory is robust…

Algebraic Geometry · Mathematics 2013-05-29 Brian Osserman

The paper discusses how compositional semantics is implemented in the Verbmobil speech-to-speech translation system using LUD, a description language for underspecified discourse representation structures. The description language and its…

cmp-lg · Computer Science 2008-02-03 Johan Bos , Björn Gambäck , Christian Lieske , Yoshiki Mori , Manfred Pinkal , Karsten Worm

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

The terms 'semantics' and 'ontology' are increasingly appearing together with 'explanation', not only in the scientific literature, but also in organizational communication. However, all of these terms are also being significantly…

Artificial Intelligence · Computer Science 2023-04-24 Giancarlo Guizzardi , Nicola Guarino
‹ Prev 1 4 5 6 7 8 10 Next ›