Infinitary Belief Revision

Lecture Notes in Computer Science

2003

Self Cite

Abstract. In this paper we investigate the properties of iterated multiple belief revision. We examine several typical assumptions for iterated revision operations with an ontology where an agent assigns ordinals to beliefs, representing strength or firmness of beliefs. A notion of minimal change is introduced to express the idea that if no evidence to show how a belief set should be reordered after it is revised, the changes on the ordering should be minimal. It has been shown that under the assumption of minimal change, the multiple version of Darwiche and Pearl's postulate (C1) holds no matter in what degree new information is accepted. Moreover, under the same assumption, Boutilier's postulate (CB) holds if and only if new information is always accepted in the lowest degree of firmness while Nayak et al.'s postulate (CN ) holds if and only if new information is always accepted in the highest degree. These results provide an ontological base for analyzing the rationality of postulates of iterated belief revision.

Section: Preliminaries In Multiple Belief Revisionmentioning

confidence: 99%

Section: Preliminaries In Multiple Belief Revisionmentioning

confidence: 99%

“…(EE5) does not satisfied by NOP. Therefore NOP is weaker version of EE (see more detail about the relationship between NOP and EE in [22]). …”

Section: Nop Is Called a Nicely-ordered Partition (Nop) If It Satisfimentioning

confidence: 99%

“…It has been shown in [22] that a set revision operator satisfies the nine postulates if and only if it is a NOP-based revision 3 .…”

Section: Nop Is Called a Nicely-ordered Partition (Nop) If It Satisfimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Properties of Iterated Multiple Belief Revision

Lecture Notes in Computer Science

2003

Self Cite

A Logical Multidemand Bargaining Model with Integrity Constraints

Jing

Luo

et al. 2015

Int. J. Intell. Syst.

Self Cite

This paper proposes a logical model of multi-demand bargaining with integrity constraints. We also construct a simultaneous concession solution to bargaining games of this kind and show that the solution is uniquely characterized by a set of logical properties. Moreover, we prove that the solution also satisfies the most fundamental game theoretic properties such as symmetry and Pareto optimality. In addition, by lots of simulation experiments we study how the number of conflicting demands, bargainers' risk attitude, and bargainer number influence the bargaining success rate and efficiency as well as the agreement quality. C 2015 Wiley Periodicals, Inc.

Logical Properties of Belief-Revision-Based Bargaining Solution

Lecture Notes in Computer Science

2006

Self Cite

Abstract. This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized belief revision. With the construction, the computation of bargaining solution can be converted to the calculation of maximal consistent hierarchy of prioritized belief sets. We prove that the syntax-independent solution of bargaining satisfies a set of desired logical properties for agreement function and negotiation function. Finally we show that the computational complexity of beliefrevision-based bargaining can be reduced to Δ