English
Related papers

Related papers: On the analysis of set-based fuzzy quantified reas…

200 papers

A review is presented of the correspondence existing in both classical bivalent logic (BL) and canonical fuzzy logic (CFL) between each law or tautology in propositional calculus and a law in set theory. The latter law consists of the…

General Mathematics · Mathematics 2023-03-13 Osvaldo Skliar , Sherry Gapper , Ricardo E. Monge

FASILL (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language") is a fuzzy logic programming language with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. FASILL…

Programming Languages · Computer Science 2015-01-12 Pascual Julián-Iranzo , Ginés Moreno , Jaime Penabad , Carlos Vázquez

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…

Logic in Computer Science · Computer Science 2024-04-19 Ian Pratt-Hartmann

Statistical Hypothesis Testing (SHT) is a class of inference methods whereby one makes use of empirical data to test a hypothesis and often emit a judgment about whether to reject it or not. In this paper we focus on the logical aspect of…

Artificial Intelligence · Computer Science 2021-06-28 Matthew Booth , Fabien Paillusson

This paper develops a category-theoretic approach to uncertainty, informativeness and decision-making problems. It is based on appropriate first order fuzzy logic in which not only logical connectives but also quantifiers have fuzzy…

General Mathematics · Mathematics 2007-05-23 P. V. Golubtsov , S. S. Moskaliuk

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy…

Logic · Mathematics 2021-10-07 Nikolay Bazhenov , Manat Mustafa , Sergei Ospichev , Luca San Mauro

Background: Wisdom is a superordinate construct that embraces perspective taking, reflectiveness, prosocial orientation, reflective empathetic action, and intellectual humility. Unlike conventional models of reasoning that are rigidly bound…

Artificial Intelligence · Computer Science 2025-09-01 Sweta Kaman , Ankita Sharma , Romi Banerjee

Three classes of models of QHC, the joint logic of problems and propositions, are constructed, including a class of subset/sheaf-valued models that is related to solutions of some actual problems (such as solutions of algebraic equations).…

Logic · Mathematics 2022-10-04 Sergey A. Melikhov

The prevailing approach to distilling reasoning from Large Language Models (LLMs)-behavioral cloning from textual rationales-is fundamentally limited. It teaches Small Language Models (SLMs) to mimic surface-level patterns rather than the…

Artificial Intelligence · Computer Science 2025-10-02 Xiangyu Wen , Junhua Huang , Zeju Li , Min Li , Jianyuan Zhong , Zhijian Xu , Mingxuan Yuan , Yongxiang Huang , Qiang Xu

Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…

Rings and Algebras · Mathematics 2026-02-17 Benyamin Ghojogh , Golbahar Amanpour

In this paper we develop a fuzzy model for the description of the process of Analogical Reasoning by representing its main steps as fuzzy subsets of a set of linguistic labels characterizing the individuals' performance in each step and we…

Artificial Intelligence · Computer Science 2012-05-01 Michael Gr. Voskoglou

As large language models (LLMs) are increasing integrated into fact-checking pipelines, formal logic is often proposed as a rigorous means by which to mitigate bias, errors and hallucinations in these models' outputs. For example, some…

Computation and Language · Computer Science 2026-04-28 Jason Chan , Robert Gaizauskas , Zhixue Zhao

The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou…

Logic in Computer Science · Computer Science 2019-11-18 Amanda Vidal , Francesc Esteva , Lluis Godo

We explore the implications of using fuzzy techniques (mainly those commonly used in the linguistic description/summarization of data discipline) from a natural language generation perspective. For this, we provide an extensive discussion…

Artificial Intelligence · Computer Science 2016-05-18 A. Ramos-Soto , A. Bugarín , S. Barro

We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…

Artificial Intelligence · Computer Science 2018-04-11 Daniel J. Buehrer

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka…

Logic in Computer Science · Computer Science 2015-02-26 Vilem Vychodil

Recent studies on reasoning in language models (LMs) have sparked a debate on whether they can learn systematic inferential principles or merely exploit superficial patterns in the training data. To understand and uncover the mechanisms…

Computation and Language · Computer Science 2025-06-24 Geonhee Kim , Marco Valentino , André Freitas

Clinical decision-making requires reasoning over incomplete, imprecise, and linguistically expressed patient narratives. While large language models (LLMs) excel at extracting latent information from natural language, they lack the…

Artificial Intelligence · Computer Science 2026-05-26 Xiaoyang Fan , Yufan Cai , Zhe Hou , Jin Song Dong

Recent advances in large language models (LLMs) have shown that they can answer questions requiring complex reasoning. However, their ability to identify and respond to text containing logical fallacies or deliberately misleading premises…

Computation and Language · Computer Science 2025-02-19 Zenan Zhai , Hao Li , Xudong Han , Zhenxuan Zhang , Yixuan Zhang , Timothy Baldwin , Haonan Li

A recent strand of research in structural proof theory aims at exploring the notion of analytic calculi (i.e. those calculi that support general and modular proof-strategies for cut elimination), and at identifying classes of logics that…

Logic in Computer Science · Computer Science 2021-02-24 Jinsheng Chen , Giuseppe Greco , Alessandra Palmigiano , Apostolos Tzimoulis
‹ Prev 1 3 4 5 6 7 10 Next ›