English
Related papers

Related papers: A Model for Non-Monotonic Reasoning Using Dempster…

200 papers

The sure thing principle and the law of total probability are basic laws in classic probability theory. A disjunction fallacy leads to the violation of these two classical probability laws. In this paper, a new quantum dynamic belief…

Artificial Intelligence · Computer Science 2017-03-08 Zichang He , Wen Jiang

The multiple extension problem arises frequently in diagnostic and default inference. That is, we can often use any of a number of sets of defaults or possible hypotheses to explain observations or make Predictions. In default inference,…

Artificial Intelligence · Computer Science 2013-04-11 Eric Neufeld , David L Poole

With the desire to apply the Dempster-Shafer theory to complex real world problems where the evidential strength is often imprecise and vague, several attempts have been made to generalize the theory. However, the important concept in the…

Artificial Intelligence · Computer Science 2013-04-10 John Yen

Penalty logic, introduced by Pinkas, associates to each formula of a knowledge base the price to pay if this formula is violated. Penalties may be used as a criterion for selecting preferred consistent subsets in an inconsistent knowledge…

Artificial Intelligence · Computer Science 2013-02-28 Florence Dupin de Saint-Cyr , Jerome Lang , Thomas Schiex

The theory of belief functions is widely used for data from multiple sources. Different evidence combination rules have been proposed in this framework according to the properties of the sources to combine. However, most of these…

Artificial Intelligence · Computer Science 2018-10-02 Kuang Zhou , Arnaud Martin , Quan Pan

The use of maximum entropy inference in reasoning with uncertain information is commonly justified by an information-theoretic argument. This paper discusses a possible objection to this information-theoretic justification and shows how it…

Artificial Intelligence · Computer Science 2013-04-15 Daniel Hunter

Many writers have observed that default logics appear to contain the "lottery paradox" of probability theory. This arises when a default "proof by contradiction" lets us conclude that a typical X is not a Y where Y is an unusual subclass of…

Artificial Intelligence · Computer Science 2013-04-08 Eric Neufeld , J. D. Horton

The categorial approach to evidential reasoning can be seen as a combination of the probability kinematics approach of Richard Jeffrey (1965) and the maximum (cross-) entropy inference approach of E. T. Jaynes (1957). As a consequence of…

Artificial Intelligence · Computer Science 2013-03-26 Robert Kennes

Unaided human decision making appears to systematically violate consistency constraints imposed by normative theories; these biases in turn appear to justify the application of formal decision-analytic models. It is argued that both claims…

Artificial Intelligence · Computer Science 2013-04-08 Marvin S. Cohen

The issue of confidence factors in Knowledge Based Systems has become increasingly important and Dempster-Shafer (DS) theory has become increasingly popular as a basis for these factors. This paper discusses the need for an empirical…

Artificial Intelligence · Computer Science 2013-04-15 John F. Lemmer

The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that…

Artificial Intelligence · Computer Science 2022-05-17 How Khang Lim , Avishkar Mahajan , Martin Strecker , Meng Weng Wong

While Evidence Theory (also known as Dempster-Shafer Theory, or Belief Functions Theory) is being increasingly used in data fusion, its potentialities in the Social and Life Sciences are often obscured by lack of awareness of its…

Artificial Intelligence · Computer Science 2025-03-31 Guido Fioretti

Conditioning is crucial in applied science when inference involving time series is involved. Belief calculus is an effective way of handling such inference in the presence of epistemic uncertainty -- unfortunately, different approaches to…

Artificial Intelligence · Computer Science 2021-04-22 Fabio Cuzzolin

We propose an inequality paradigm for probabilistic reasoning based on a logic of upper and lower bounds on conditional probabilities. We investigate a family of probabilistic logics, generalizing the work of Nilsson [14]. We develop a…

Artificial Intelligence · Computer Science 2013-04-15 Benjamin N. Grosof

We propose a new framework for imposing monotonicity constraints in a Bayesian nonparametric setting based on numerical solutions of stochastic differential equations. We derive a nonparametric model of monotonic functions that allows for…

Machine Learning · Statistics 2020-02-26 Ivan Ustyuzhaninov , Ieva Kazlauskaite , Carl Henrik Ek , Neill D. F. Campbell

In this paper we make a contribution to the unification of formal models of defeasible reasoning. We present several translations between formal argumentation frameworks and nonmonotonic logics for reasoning with plausible assumptions. More…

Artificial Intelligence · Computer Science 2016-04-04 Jesse Heyninck , Christian Straßer

Unitary quantum theory, having no Born Rule, is non-probabilistic. Hence the notorious problem of reconciling it with the unpredictability and appearance of stochasticity in quantum measurements. Generalising and improving upon the…

Quantum Physics · Physics 2016-09-28 Chiara Marletto

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by…

Artificial Intelligence · Computer Science 2025-04-25 Lucas Carr , Nicholas Leisegang , Thomas Meyer , Sergei Obiedkov

In dialogical argumentation it is often assumed that the involved parties always correctly identify the intended statements posited by each other, realize all of the associated relations, conform to the three acceptability states (accepted,…

Artificial Intelligence · Computer Science 2017-12-11 Sylwia Polberg , Anthony Hunter

In Dempster-Shafer belief theory, general beliefs are expressed as belief mass distribution functions over frames of discernment. In Subjective Logic beliefs are expressed as belief mass distribution functions over binary frames of…

Artificial Intelligence · Computer Science 2007-05-23 Audun Josang
‹ Prev 1 4 5 6 7 8 10 Next ›