We provide an axiomatic characterization of Bayesian updating, viewed as a mapping from prior beliefs and new information to posteriors, which is disentangled any reference preferences. updating characterized by Non-Innovativeness (events considered impossible in the remain posterior), Dropping contradicted evidence are Proportionality (for other events, posterior simply rescales prior’s probab...

Axiomatic analysis of the existing retrieval models have shown great power on understanding the retrieval models, which further shows a great opportunities on improve the retrieval performances of existing models. In this work, we tested the axiomatic retrieval models with query expansion on the newly provided data collection. The results show that the proposed method could outperform the basel...

Following Kohlberg-Mertens [8, 1986], we investigate an axiomatic approach to non-cooperative solution concepts. A basic question in this program is identifying a backward-induction axiom (for general games). We show that three axioms—Existence, Rationality, and Difference—together characterize backward induction in perfect-information games satisfying a “single payoff condition.” We discuss im...

A judicious use of labelled terms makes it possible to bring together the simplicity of term rewriting and the sharing power of graph rewriting: this has been known for twenty years in the particular case of orthogonal first-order systems. The present paper introduces a concise and easily usable axiomatic presentation of sharing-via-labelling techniques that applies to higher-order term rewriti...

Lecture 1, 07.03.: We made a review of the material covered in Chapter I of [3], up to Theorem I.9.11 (Transfinite Recursion on Well-founded Relations). Lecture 2, 14.03.: We discussed the notion of a rank, as well as the Mostowski collapsing function material corresponding to Section 9 of [3]. Lecture 3, 04.04.: We discussed hereditarily transitive sets, the DownwardLöwenheim-Skolem-Tarksi The...