In this paper, we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of conflict and two quantities of agreement are defined. The former is shown to be a generalization of the Dalal distance. The latter are, respectively, a quantity of strong agreement which measures the amount of informati...

Evidence shows that the font size of study items significantly influences judgments of learning (JOLs) and that people's JOLs are generally higher for larger words than for smaller words. Previous studies have suggested that font size influences JOLs in a belief-based way. However, few studies have directly examined how much people's beliefs contribute to the font-size effect in JOLs. This stud...

In real applications, how to measure the uncertain degree of sensor reports before applying sensor data fusion is a big challenge. In this paper, in the frame of Dempster-Shafer evidence theory, a weighted belief entropy based on Deng entropy is proposed to quantify the uncertainty of uncertain information. The weight of the proposed belief entropy is based on the relative scale of a propositio...

We present a novel trust model based on BAF-Logic, a system of reasoning that was originally developed for Belief Augmented Frames (BAF), to perform inexact reasoning over knowledge represented as Minsky frames and augmented with twin belief values that measure an Agent’s degree of belief for and against a proposition. By applying BAF-Logic to trust modeling, we are not only able to model trust...

In general, identifying a solution concept only incompletely specifies a mechanism design problem. The designer must consider which among a multiplicity of solutions is likely to be played, as well as the possibility that actual play will not correspond to any solution. Given that actual play is the ultimate determiner of a mechanism’s success, we advocate that designers embrace the correspondi...

Glenn Shafer Prakash P. Shenoy School of Business University of Kansas Lawrence, Kansas 66045 Modifiable combining functions are a synthesis of two general approaches to combining evidence. Be­ cause they facilitate the acquisition, representation, explanation, and modification of expert knowl­ edge about combinations of evidence, they are presented as a device for knowledge engineers, not as a...

The problem of multiple object classification based on discordant and non-specific data is considered. A general methodology for solving this problem is suggested and a suboptimal single-scan algorithm, referred to as the the global nearest neighbour (GNN), is implemented. The exact global dissimilarity measure, which is minimised by the GNN algorithm, is derived within the framework of the bel...

The degree of trust that an agent has for another is the strength of the agent’s belief that the other will enact its commitments without variation. A strong sense of trust may be sufficient justification for one agent to sign a contract with another when all that matters is the possibility of variation between commitment and enactment. In non-trivial contracts the agents’ information is typica...

In his ‘Objective Bayesian calibration and the problem of non-convex evidence’, Gregory Wheeler criticises the principle I invoke in Williamson (2010) for calibrating degrees of belief with chances. Bayesian epistemologists commonly appeal to some sort of Calibration norm that says that degrees of belief should be calibrated to known chances. Typically they invoke a principle variously known as...

We present a decision procedure for the V3-theory of 3[0,0'], the Turing degrees below 0'. The two main ingredients are a new extension of embeddings result and a strengthening of the initial segments results below 0' of [Lei]. First, given any finite subuppersemilattice U ot 3[0,0'] with top element 0' and an isomorphism type V of a poset extending U consistently with its structure as an usl s...