English
Related papers

Related papers: Belief functions on lattices

200 papers

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

Formal Languages and Automata Theory · Computer Science 2019-05-09 Pablo Barcelo , Chih-Duo Hong , Xuan-Bach Le , Anthony W. Lin , Reino Niskanen

We define a notion of Morse function and establish Morse theory-like theorems over offsets of any compact set in a Euclidean space at regular values of their distance function. Using non-smooth analysis and tools from geometric measure…

Geometric Topology · Mathematics 2025-07-28 Antoine Commaret

We develop a general assumption-lean framework for constructing uniformly valid confidence sets for functionals defined by moment equalities, referred to as $Z$-functionals. Our approach combines self-normalized statistics with a test…

Statistics Theory · Mathematics 2025-07-11 Woonyoung Chang , Arun Kumar Kuchibhotla

This article extends the hypotheses assessment method to the case with two competing simple hypotheses. In doing so we further clarify the benefits that hypotheses assessments can bring to classical statistical analyses. Given that…

Methodology · Statistics 2025-03-25 Graham N. Bornholt

This chapter provides a overview of Bayesian inference, mostly emphasising that it is a universal method for summarising uncertainty and making estimates and predictions using probability statements conditional on observed data and an…

Methodology · Statistics 2010-02-11 Christian P. Robert , Jean-Michel Marin , Judith Rousseau

We prove that functions defined on a lattice in a finite dimensional torus with bounded finite differences can be smoothly extended to the whole torus, and relate the bounds on the extension's derivatives with bounds on the original…

Differential Geometry · Mathematics 2008-11-27 P. Duarte , M. J. Torres

We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in the same applications as discrete Costas arrays. We construct…

Combinatorics · Mathematics 2007-06-12 Konstantinos Drakakis , Scott Rickard

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…

Artificial Intelligence · Computer Science 2016-11-26 Henry E. Kyburg

Belief fusion is the principle of combining separate beliefs or bodies of evidence originating from different sources. Depending on the situation to be modelled, different belief fusion methods can be applied. Cumulative and averaging…

Artificial Intelligence · Computer Science 2007-12-10 Audun Josang

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

Combinatorics · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

Several approaches of structuring (factorization, decomposition) of Dempster-Shafer joint belief functions from literature are reviewed with special emphasis on their capability to capture independence from the point of view of the claim…

Artificial Intelligence · Computer Science 2017-07-14 Mieczysław A. Kłopotek

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

We prove some new properties of fidelity (transition probability) and concurrence, the latter defined by straightforward extension of Wootters notation. Choose a conjugation and consider the dependence of fidelity or of concurrence on…

Quantum Physics · Physics 2009-10-31 Armin Uhlmann

A substantial generalisation is put forward of the theory of subjective fiducial inference as it was outlined in earlier papers. In particular, this theory is extended to deal with cases where the data are discrete or categorical rather…

Other Statistics · Statistics 2021-04-09 Russell J. Bowater

The classical conception of falsification presents scientific theories as entities that are decisively refuted when their predictions fail. This picture has long been challenged by both philosophical analysis and scientific practice, yet…

Other Statistics · Statistics 2025-12-09 Tommaso Costa

A common assumption in modern microeconomic theory is that choice should be rationalizable via a binary preference relation, which \citeauthor{Sen71a} showed to be equivalent to two consistency conditions, namely $\alpha$ (contraction) and…

Multiagent Systems · Computer Science 2025-07-22 Felix Brandt , Paul Harrenstein

Many models of economics assume that individuals distort objective probabilities. We propose a simple consistency condition on distortion functions, which we term distortion coherence, that ensures that the function commutes with…

Theoretical Economics · Economics 2024-06-10 Christopher P. Chambers , Yusufcan Masatlioglu , Collin Raymond

Both religion and science start with basic assumptions that cannot be proved but are taken on faith. Here I note that one basic assumption that is rather common in both enterprises is the assumption that in comparing different hypotheses…

Popular Physics · Physics 2008-11-07 Don N. Page

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

Optimization and Control · Mathematics 2024-03-11 Moslem Zamani , François Glineur , Julien M. Hendrickx
‹ Prev 1 8 9 10 Next ›