English
Related papers

Related papers: Belief merging within fragments of propositional l…

200 papers

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…

Logic · Mathematics 2016-01-13 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

In this contribution we explore choice revision, a sort of belief change in which the new information is represented by a set of sentences and the agent could accept some of the sentences while rejecting the others. We propose a generalized…

Logic in Computer Science · Computer Science 2018-05-04 Li Zhang

Opinion and multi-document summarisation often involve genuinely conflicting viewpoints, yet many existing approaches, particularly LLM-based systems, implicitly smooth disagreement and over-represent majority opinions. This limits the…

Computation and Language · Computer Science 2026-01-09 Favour Yahdii Aghaebe , Tanefa Apekey , Elizabeth Williams , Nafise Sadat Moosavi

AGM's belief revision is one of the main paradigms in the study of belief change operations. Recently, several logics for belief and information change have been proposed in the literature and used to encode belief change operations in rich…

Logic in Computer Science · Computer Science 2021-01-06 Marlo Souza , Álvaro Moreira , Renata Vieira

Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…

Logic in Computer Science · Computer Science 2016-08-10 Umair Siddique , Osman Hasan , Sofiène Tahar

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

Logic in Computer Science · Computer Science 2018-05-01 Radu Iosif , Cristina Serban

Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of clusters to be used in GBP has remained more of an art then a…

Artificial Intelligence · Computer Science 2012-07-19 Max Welling

We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose modular, transitive relations for collective beliefs. They allow us to represent conflicting opinions and they have a clear…

Artificial Intelligence · Computer Science 2007-05-23 Pedrito Maynard-Reid , Daniel Lehmann

For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first…

Logic in Computer Science · Computer Science 2023-06-22 Thomas Place , Varun Ramanathan , Pascal Weil

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

We present a logical framework that enables us to define a formal theory of computational trust in which this notion is analysed in terms of epistemic attitudes towards the possible objects of trust and in relation to existing evidence in…

Logic in Computer Science · Computer Science 2025-06-19 Francesco A. Genco

The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. In order to apply the rationality result of belief dynamics theory to various…

Logic in Computer Science · Computer Science 2015-01-28 Radhakrishnan Delhibabu

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new…

Artificial Intelligence · Computer Science 2013-02-01 Salem Benferhat , Claudio Sossai

As language models (LMs) become integral to fields like healthcare, law, and journalism, their ability to differentiate between fact, belief, and knowledge is essential for reliable decision-making. Failure to grasp these distinctions can…

Computation and Language · Computer Science 2024-10-29 Mirac Suzgun , Tayfun Gur , Federico Bianchi , Daniel E. Ho , Thomas Icard , Dan Jurafsky , James Zou

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

Recently, much work has been carried out to study simplicial interpretations of modal logic. While notions of (distributed) knowledge have been well investigated in this context, it has been open how to model belief in simplicial models. We…

Logic in Computer Science · Computer Science 2026-01-13 Christian Cachin , David Lehnherr , Thomas Studer

One topic that is likely to attract an increasing amount of attention within the Knowledge-base systems research community is the coordination of information provided by multiple experts. We envision a situation in which several experts…

Artificial Intelligence · Computer Science 2013-03-08 Izhar Matzkevich , Bruce Abramson

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

We consider the one-variable fragment of first-order logic extended with Presburger constraints. The logic is designed in such a way that it subsumes the previously-known fragments extended with counting, modulo counting or cardinality…

Logic in Computer Science · Computer Science 2019-09-17 Bartosz Bednarczyk
‹ Prev 1 3 4 5 6 7 10 Next ›