English
Related papers

Related papers: A survey of paraconsistent logics

200 papers

We analyse a specific instance of the general approach of reasoning based on forgetting by Lang and Marquis. More precisely, we discuss an approach for reasoning with inconsistent information using maximal consistent subsignatures, where a…

Artificial Intelligence · Computer Science 2024-09-02 Matthias Thimm , Jandson Santos Ribeiro Santos

We extend the simply-typed guarded $\lambda$-calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations. This provides a framework for programming…

Programming Languages · Computer Science 2018-02-28 Alejandro Aguirre , Gilles Barthe , Lars Birkedal , Aleš Bizjak , Marco Gaboardi , Deepak Garg

There are several contexts of non-monotonic reasoning where a priority between rules is established whose purpose is preventing conflicts. One formalism that has been widely employed for non-monotonic reasoning is the sceptical one known as…

Artificial Intelligence · Computer Science 2012-11-26 Guido Governatori , Francesco Olivieri , Simone Scannapieco , Matteo Cristani

The KLM approach to defeasible reasoning introduces a weakened form of implication into classical logic. This allows one to incorporate exceptions to general rules into a logical system, and for old conclusions to be withdrawn upon learning…

Artificial Intelligence · Computer Science 2024-10-08 Nicholas Leisegang , Thomas Meyer , Sebastian Rudolph

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

This paper is an extended version of an earlier submission to WoLLIC 2023. We discuss two-layered logics formalising reasoning with probabilities and belief functions that combine the Lukasiewicz $[0,1]$-valued logic with Baaz $\triangle$…

Logic · Mathematics 2025-05-20 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko , Ondrej Majer

We start in this work the study of the relation between the theory of regularity structures and paracontrolled calculus. We give a paracontrolled representation of the reconstruction operator and provide a natural parametrization of the…

Analysis of PDEs · Mathematics 2019-10-29 I. Bailleul , M. Hoshino

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

Calibration, which establishes the correlation between accuracy and model confidence, is important for LLM development. We design three off-the-shelf calibration methods based on self-consistency (Wang et al., 2022) for math reasoning…

Computation and Language · Computer Science 2024-03-18 Ante Wang , Linfeng Song , Ye Tian , Baolin Peng , Lifeng Jin , Haitao Mi , Jinsong Su , Dong Yu

First we introduce the Bailleul-Hoshino's result [4], which links the theory of regularity structures and the paracontrolled calculus. As an application of their result, we give another algebraic proof of the multicomponent commutator…

Analysis of PDEs · Mathematics 2019-03-05 Masato Hoshino

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…

Artificial Intelligence · Computer Science 2013-01-31 Teresa Alsinet , Lluis Godo , Sandra Sandri

Large language models (LLMs) have achieved widespread success on a variety of in-context few-shot tasks, but this success is typically evaluated via correctness rather than consistency. We argue that self-consistency is an important…

Computation and Language · Computer Science 2024-02-09 Angelica Chen , Jason Phang , Alicia Parrish , Vishakh Padmakumar , Chen Zhao , Samuel R. Bowman , Kyunghyun Cho

The `catuskoti' or tetralemma in Buddhist logic is a problematic subject from the modern logical point of view. Recently a many-valued paraconsistent logic was proposed in order to formalize catuskoti adequately by G. Priest. On the other…

Logic · Mathematics 2015-08-21 Tetu Makino

As of the date of this version, this monograph (parts I and II) contains all of the known technical results relative to the Robinson-styled nonstandard modeling of natural languages and certain associated linguistic processes such as…

General Mathematics · Mathematics 2012-12-27 Robert A. Herrmann

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…

Logic in Computer Science · Computer Science 2013-02-05 Giorgi Japaridze

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence…

Artificial Intelligence · Computer Science 2020-02-05 Richard Booth , Giovanni Casini , Thomas Meyer , Ivan Varzinczak

In 1952 P. F. Strawson proposed a logic of presuppositions. It is an interpretation of Aristotelian logic, i.e. of the logic of the traditional syllogism. In 1981 Richard Diaz published a monograph in which he presented truth-relevant…

Logic in Computer Science · Computer Science 2023-02-17 X. Y. Newberry

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

The purpose of this paper is to develop further the main concepts of Phenomena Dynamic Logic (P-DL) and Cognitive Dynamic Logic (C-DL), presented in the previous paper. The specific character of these logics is in matching vagueness or…

Logic in Computer Science · Computer Science 2016-11-17 Evgenii Vityaev , Boris Kovalerchuk , Leonid Perlovsky , Stanislav Smerdov

We introduce a variant of Dependence Logic in which truth is defined not in terms of existence of winning strategies for the Proponent (Eloise) in a semantic game, but in terms of lack of winning strategies for the Opponent (Abelard). We…

Logic · Mathematics 2014-03-17 Pietro Galliani