English
Related papers

Related papers: Finite Based Contraction and Expansion via Models

200 papers

This paper deals with belief base revision that is a form of belief change consisting of the incorporation of new facts into an agent's beliefs represented by a finite set of propositional formulas. In the aim to guarantee more reliability…

Artificial Intelligence · Computer Science 2020-09-25 Raïda Ktari , Mohamed Ayman Boujelben

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

Subset models provide a new semantics for justifcation logic. The main idea of subset models is that evidence terms are interpreted as sets of possible worlds. A term then justifies a formula if that formula is true in each world of the…

Logic in Computer Science · Computer Science 2023-10-06 Eveline Lehmann , Thomas Studer

We propose a method for an agent to revise its incomplete probabilistic beliefs when a new piece of propositional information is observed. In this work, an agent's beliefs are represented by a set of probabilistic formulae -- a belief base.…

Artificial Intelligence · Computer Science 2016-04-08 Gavin Rens , Thomas Meyer , Giovanni Casini

The AGM theory of belief revision has become an important paradigm for investigating rational belief changes. Unfortunately, researchers working in this paradigm have restricted much of their attention to rather simple representations of…

Artificial Intelligence · Computer Science 2013-01-30 Frans Voorbraak

Knowledge Measures (KMs) aim at quantifying the amount of knowledge/information that a knowledge base carries. On the other hand, Belief Change (BC) is the process of changing beliefs (in our case, in terms of contraction, expansion and…

Artificial Intelligence · Computer Science 2024-03-18 Umberto Straccia , Giovanni Casini

It has been shown that one can accommodate data (Bayes) and constraints (MaxEnt) in one method, the method of Maximum (relative) Entropy (ME) (Giffin 2007). In this paper we show a complex agent based example of inference with two different…

Methodology · Statistics 2016-09-08 Adom Giffin

We present a general, consistency-based framework for belief change. Informally, in revising K by A, we begin with A and incorporate as much of K as consistently possible. Formally, a knowledge base K and sentence A are expressed, via…

Artificial Intelligence · Computer Science 2007-05-23 James Delgrande , Torsten Schaub

Belief revision is an operation that aims at modifying old beliefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms, in particular, in qualitative algebras (QAs) in which the…

Artificial Intelligence · Computer Science 2014-05-06 Valmi Dufour-Lussier , Alice Hermann , Florence Le Ber , Jean Lieber

Belief change is a fundamental problem in AI: Agents constantly have to update their beliefs to accommodate new observations. In recent years, there has been much work on axiomatic characterizations of belief change. We claim that a better…

Artificial Intelligence · Computer Science 2007-05-23 Nir Friedman , Joseph Y. Halpern

In Formal Concept Analysis, a base for a finite structure is a set of implications that characterizes all valid implications of the structure. This notion can be adapted to the context of Description Logic, where the base consists of a set…

Logic in Computer Science · Computer Science 2022-02-22 Ricardo Guimarães , Ana Ozaki , Cosimo Persia , Baris Sertkaya

Many economic theory models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness…

Computer Science and Game Theory · Computer Science 2023-04-11 Yannai A. Gonczarowski , Scott Duke Kominers , Ran I. Shorrer

Argumentation frameworks, consisting of arguments and an attack relation representing conflicts, are fundamental for formally studying reasoning under conflicting information. We use methods from mathematical logic, specifically…

Artificial Intelligence · Computer Science 2025-12-01 Uri Andrews , Luca San Mauro

A model of knowledge representation is described in which propositional facts and the relationships among them can be supported by other facts. The set of knowledge which can be supported is called the set of cognitive units, each having…

Artificial Intelligence · Computer Science 2013-04-12 A. Julian Craddock , Roger A. Browse

This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…

Artificial Intelligence · Computer Science 2017-07-28 Chenwei Shi , Sonja Smets , Fernando R. Velázquez-Quesada

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

Common sense suggests that when individuals explain why they believe something, we can arrive at more accurate conclusions than when they simply state what they believe. Yet, there is no known mechanism that provides incentives to elicit…

Computer Science and Game Theory · Computer Science 2025-02-20 Siddarth Srinivasan , Ezra Karger , Michiel Bakker , Yiling Chen

LLM-based agents are increasingly used to simulate deliberative interactions such as negotiation, conflict resolution, and multi-turn opinion exchange. Yet generated transcripts often do not reveal why an agent's stance changes: movement…

Artificial Intelligence · Computer Science 2026-05-18 Joshua C. Yang , Maurice Flechtner , Damian Dailisan , Michiel A. Bakker

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

Logic in Computer Science · Computer Science 2024-05-22 Michael Benedikt , Ehud Hrushovski

The notion of argumentation and the one of belief stand in a problematic relation to one another. On the one hand, argumentation is crucial for belief formation: as the outcome of a process of arguing, an agent might come to (justifiably)…

Logic in Computer Science · Computer Science 2021-06-23 Alfredo Burrieza , Antonio Yuste-Ginel
‹ Prev 1 2 3 10 Next ›