English
Related papers

Related papers: Belief Revision and Rational Inference

200 papers

Most approaches for repairing description logic (DL) ontologies aim at changing the axioms as little as possible while solving inconsistencies, incoherences and other types of undesired behaviours. As in Belief Change, these issues are…

Logic in Computer Science · Computer Science 2022-02-22 Jandson S. Ribeiro , Ricardo Guimarães , Ana Ozaki

We introduce a new logic of graded distributed belief that allows us to express the fact that a group of agents distributively believe that a certain fact holds with at least strength k. We interpret our logic by means of computationally…

Logic in Computer Science · Computer Science 2025-12-01 Emiliano Lorini , Dmitry Rozplokhas

This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions.…

History and Overview · Mathematics 2022-07-07 Paul Blain Levy

In this paper we address the interplay among intention, time, and belief in dynamic environments. The first contribution is a logic for reasoning about intention, time and belief, in which assumptions of intentions are represented by…

Logic in Computer Science · Computer Science 2020-04-20 Marc van Zee , Dragan Doder , Leendert van der Torre , Mehdi Dastani , Thomas Icard , Eric Pacuit

Logically constrained term rewriting is a relatively new formalism where rules are equipped with constraints over some arbitrary theory. Although there are many recent advances with respect to rewriting induction, completion, complexity…

Logic in Computer Science · Computer Science 2024-07-08 Takahito Aoto , Naoki Nishida , Jonas Schöpf

We investigate the reasons of having confidence in mathematical theorems. The formalist point of view maintains that formal derivations underlying proofs, although usually not carried out in practice, contribute to this confidence. Opposing…

Logic · Mathematics 2014-11-19 Andrzej Pelc

While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the…

Logic in Computer Science · Computer Science 2017-01-19 Quentin Heath , Dale Miller

There currently exists a gap between the theories proposed by the probability and uncertainty and the needs of Artificial Intelligence research. These theories primarily address the needs of expert systems, using knowledge structures which…

Artificial Intelligence · Computer Science 2013-04-12 Brian Falkenhainer

In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…

Artificial Intelligence · Computer Science 2014-01-17 Claudette Cayrol , Florence Dupin de Saint-Cyr , Marie-Christine Lagasquie-Schiex

It is argued that the usual postulates of quantum mechanics are too strong. It is conjectured that it is possible to interpret all experiments if we maintain the formalism of quantum theory without modification, but weaken the postulates…

Quantum Physics · Physics 2020-11-03 Emilio Santos

Bayes' rule tells us how to invert a causal process in order to update our beliefs in light of new evidence. If the process is believed to have a complex compositional structure, we may ask whether composing the inversions of the component…

Category Theory · Mathematics 2020-07-29 Toby St. Clere Smithe

Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…

Logic in Computer Science · Computer Science 2024-02-27 Sam Buss , Emre Yolcu

We review the theory of renewal reward processes, which describes renewal processes that have some cost or reward associated with each cycle. We present a new simplified proof of the renewal reward theorem that mimics the proof of the…

Probability · Mathematics 2014-04-23 Maria Vlasiou

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Logic in Computer Science · Computer Science 2018-04-25 AnneMarie Borg

Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…

Logic in Computer Science · Computer Science 2016-11-29 Anindya Banerjee , David A. Naumann , Mohammad Nikouei

Large language models (LLMs) that iteratively revise their outputs through mechanisms such as chain-of-thought reasoning, self-reflection, or multi-agent debate lack principled guarantees regarding the stability of their probability…

Computation and Language · Computer Science 2026-03-23 Mike Farmer , Abhinav Kochar , Yugyung Lee

Belief systems are often treated as globally consistent sets of propositions or as scalar-valued probability distributions. Such representations tend to obscure the internal structure of belief, conflate external credibility with internal…

Artificial Intelligence · Computer Science 2025-08-06 Saleh Nikooroo

As large language models (LLMs) continue to demonstrate remarkable abilities across various domains, computer scientists are developing methods to understand their cognitive processes, particularly concerning how (and if) LLMs internally…

Artificial Intelligence · Computer Science 2025-03-17 Daniel A. Herrmann , Benjamin A. Levinstein

This paper is aimed at providing a uniform framework for reasoning about beliefs of multiple agents and their fusion. In the first part of the paper, we develop logics for reasoning about cautiously merged beliefs of agents with different…

Artificial Intelligence · Computer Science 2007-05-23 Churn-Jung Liau

This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…

Artificial Intelligence · Computer Science 2013-03-08 Salem Benferhat , Didier Dubois , Henri Prade