English
Related papers

Related papers: Modeling selectional restrictions in a relational …

200 papers

The study of semantic relationships has revealed a close connection between these relationships and the morphological characteristics of a language. Morphology, as a subfield of linguistics, investigates the internal structure and formation…

Computation and Language · Computer Science 2023-07-14 Mohamed Naamane

Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in computer science and artificial intelligence. Towards a deep…

Artificial Intelligence · Computer Science 2020-01-24 Heng Zhang , Yan Zhang , Guifei Jiang

Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its…

Category Theory · Mathematics 2012-11-28 Robin Cockett , Richard Garner

This paper introduces a new mechanism for specifying constraints in distributed workflows. By introducing constraints in a contextual form, it is shown how different people and groups within collaborative communities can cooperatively…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 G. E. Graham , M. Anzar Afaq , David Evans , Gerald Guglielmo , Eric Wicklund , Peter Love

Let A be a character sheaf on a reductive connected group G over an algebraically closed field. Assuming that the characteristic is not bad, we show that for certain conjugacy classes D in G the restriction of A to D is a local system up to…

Representation Theory · Mathematics 2012-06-22 G. Lusztig

In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…

Logic · Mathematics 2025-08-29 Wesley H. Holliday

The syntactic structures of sentences can be readily read-out from the activations of large language models (LLMs). However, the ``structural probes'' that have been developed to reveal this phenomenon are typically evaluated on an…

Computation and Language · Computer Science 2025-08-12 Pablo J. Diego-Simón , Emmanuel Chemla , Jean-Rémi King , Yair Lakretz

This paper introduces Relational Type Theory (RelTT), a new approach to type theory with extensionality principles, based on a relational semantics for types. The type constructs of the theory are those of System F plus relational…

Logic in Computer Science · Computer Science 2021-01-26 Aaron Stump , Benjamin Delaware , Christopher Jenkins

A key problem in the description of language structure is to explain its contradictory properties of specificity and generality, the contrasting poles of formulaic prescription and generative productivity. I argue that this is possible if…

cmp-lg · Computer Science 2008-02-03 Robert John Freeman

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

Logic in Computer Science · Computer Science 2017-07-04 Lorenzo Gheri , Andrei Popescu

Semantics, morphology and syntax are strongly interdependent. However, the majority of computational methods for semantic change detection use distributional word representations which encode mostly semantics. We investigate an alternative…

Computation and Language · Computer Science 2021-09-23 Mario Giulianelli , Andrey Kutuzov , Lidia Pivovarova

Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Christof Löding , Sarah Winter

We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…

Logic · Mathematics 2024-11-04 Greta Coraglia , Ivan Di Liberti

We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…

Logic in Computer Science · Computer Science 2007-05-23 Jan Van den Bussche , Emmanuel Waller

This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…

Logic in Computer Science · Computer Science 2013-05-06 Christian Retoré

Ontologies are traditionally expressed in the Web Ontology Language (OWL), that provides a syntax for expressing taxonomies with axioms regulating class membership. The semantics of OWL, based on Description Logic (DL), allows for the use…

Information Theory · Computer Science 2023-09-07 Veronika Heimsbakk , Kristian Torkelsen

This paper discusses the use of `ontologies' in Natural Language Processing. It classifies various kinds of ontologies that have been employed in NLP and discusses various benefits and problems with those designs. Particular focus is then…

cmp-lg · Computer Science 2008-02-03 John A. Bateman

We study special systems with infinitely many degrees of freedom with regard to dynamical evolution and fulfillment of constraint conditions. Attention is focused on establishing a meaningful functional framework, and for that purpose,…

Quantum Physics · Physics 2007-05-23 John R. Klauder

Taxonomies are semantic hierarchies of concepts. One limitation of current taxonomy learning systems is that they define concepts as single words. This position paper argues that contextualized word representations, which recently achieved…

Computation and Language · Computer Science 2019-02-07 Lukas Schmelzeisen , Steffen Staab

After a brief description of the basic theoretical concepts of the string model approach, we discuss the limitations of the method, at low energies, at high energies, and at high particle densities. We also report on recent efforts to…

Nuclear Theory · Physics 2007-05-23 Klaus Werner
‹ Prev 1 4 5 6 7 8 10 Next ›