English
Related papers

Related papers: Quantification in ordinary language

200 papers

In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional,…

Artificial Intelligence · Computer Science 2014-11-27 M. Pereira-Fariña , Juan C. Vidal , F. Díaz-Hermida , A. Bugarín

Major advances have recently been made in merging language and vision representations. But most tasks considered so far have confined themselves to the processing of objects and lexicalised relations amongst objects (content words). We…

Computation and Language · Computer Science 2017-04-11 Ionut Sorodoc , Sandro Pezzelle , Aurélie Herbelot , Mariella Dimiccoli , Raffaella Bernardi

In this paper, we highlight a profound difference between conditional statements in mathematical logic and natural languages. This difference exists even when the conditional statements are used in mathematical theorems.

Logic in Computer Science · Computer Science 2022-08-02 Kamaledin Ghiasi-Shirazi

Philosophers of science commonly connect ontology and science, stating that these disciplines maintain a two-way relationship: on the one hand, we can extract ontology from scientific theories; on the other hand, ontology provides the…

History and Philosophy of Physics · Physics 2025-04-24 Raoni Arroyo , Jonas R. Becker Arenhart

First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…

Logic in Computer Science · Computer Science 2026-02-24 Fabian Vehlken , Thomas Zeume , Emilio Carrasco Bustamante , Maëlle Cornély , Lukas Pradel

Natural language understanding applications such as interactive planning and face-to-face translation require extensive inferencing. Many of these inferences are based on the meaning of particular open class words. Providing a…

cmp-lg · Computer Science 2008-02-03 Marc Light , Lenhart Schubert

Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…

Logic in Computer Science · Computer Science 2024-02-14 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

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 present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…

Logic · Mathematics 2022-12-16 Matthias Eberl

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

Distributional semantics has had enormous empirical success in Computational Linguistics and Cognitive Science in modeling various semantic phenomena, such as semantic similarity, and distributional models are widely used in…

Computation and Language · Computer Science 2019-05-20 Matthijs Westera , Gemma Boleda

This paper proposes to compute the meanings associated to sentences with generic NPs corresponding to the most of generalized quantifier. We call these generics specimens and they resemble stereotypes or prototypes in lexical semantics. The…

Logic · Mathematics 2011-11-09 Christian Retoré

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Formal Languages and Automata Theory · Computer Science 2014-04-29 Thomas Place , Marc Zeitoun

Artificial intelligence assisted mathematical proof has become a highly focused area nowadays. One key problem in this field is to generate formal mathematical proofs from natural language proofs. Due to historical reasons, the formal proof…

Programming Languages · Computer Science 2024-05-14 Lihan Xie , Zhicheng Hui , Qinxiang Cao

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…

Logic · Mathematics 2024-08-23 Boris Čulina

Hartle and Srednicki have suggested that standard quantum theory does not favor our typicality. Here an alternative version is proposed in which typicality is likely, Eventual Quantum Mechanics. This version allows one to calculate…

High Energy Physics - Theory · Physics 2008-11-26 Don N. Page

Since the quantum field theory treats a system of particles, there must be a distribution which is associated with the system of particles. It means that a meaningful quantity is adjoined in the system of particles. It seems that these…

General Physics · Physics 2008-10-25 Yeong-Shyeong Tsai

Theories of natural language and concepts have been unable to model the flexibility, creativity, context-dependence, and emergence, exhibited by words, concepts and their combinations. The mathematical formalism of quantum theory has…

Artificial Intelligence · Computer Science 2016-09-09 Diederik Aerts , Jan Broekaert , Liane Gabora , Sandro Sozzo

This work introduces a novel framework of uniform realizability that unifies and generalizes various realizability interpretations of logic, particularly focussing on the treatment of atomic formulas and quantifiers. Traditional…

Logic in Computer Science · Computer Science 2026-03-05 Ulrich Berger , Paulo Oliva

Qualitative and quantitative approaches to reasoning about uncertainty can lead to different logical systems for formalizing such reasoning, even when the language for expressing uncertainty is the same. In the case of reasoning about…

Artificial Intelligence · Computer Science 2021-04-07 Matthew Harrison-Trainor , Wesley H. Holliday , Thomas F. Icard