In this work, we address the problem of revision of OWL-DL knowledge bases. We focus on belief bases revision as it has previously been shown that OWL-DL is not AGM-compliant for revision. Previously an algorithm for belief base semi-revision for propositional logic has been defined; in particular it has been shown how the diagnosis problem can be translated into a revision problem. In this wor...

We generalize the Bayes’ theorem within the transferable belief model framework. The Generalized Bayesian Theorem (GBT) allows us to compute the belief over a space Θ given an observation x ⊆ X when one knows only the beliefs over X for every θi ∈ Θ. We also discuss the Disjunctive Rule of Combination (DRC) for distinct pieces of evidence. This rule allows us to compute the belief over X from t...

Accurately predicting the capacity of lithium battery is conducive to improving its safety. Affected by complex internal electrochemical reaction and external use conditions, prediction accuracy difficult guarantee; at same time, existing methods are unexplainable, resulting in inability trace process. Therefore, a model based on belief rule base with interpretability interval optimization stra...

A database is a device to store and retrieve information. In the terminology of Levesque [Levesque, 1984], a database comes equipped with a querying function ASK and an update function TELL. The query ASK(light-on) means that the database is asked whether it follows from the data contained in it that the light in question is on. The answer is basically “yes” or “no”. (There might be more cooper...

This paper contributes a novel embedding model which measures the probability of each candidate belief 〈h, r, t,m〉 in a large-scale knowledge repository via simultaneously learning distributed representations for entities (h and t), relations (r), and even the words in relation mentions (m). It facilitates knowledge completion by means of simple vector operations to discover new beliefs. Given ...

Many fault detection techniques/algorithms for detecting faults in rule bases have appeared in the literature. These techniques assume that the rule base is static. This paper presents a new approach/algorithm for detecting faults in dynamic rule bases, where rules may be added/deleted in response to certain events happening in the system being controlled by the rule base. This is performed by ...

Dempster’s rule, non-normalized conjunctive rule, Yager’s rule and Dubois-Prade’s rule for belief functions combination are generalized to be applicable to hyper-power sets according to the DSm theory. A comparison of the rules with DSm rule of combination is presented. A series of examples is included.

This paper is about Spohn’s theory of epistemic beliefs. The main ingredients of Spohn’s theory are (i) a functional representation of an epistemic state called a disbelief function, and (ii) a rule for revising this function in light of new information. The main contribution of this paper is as follows. First, we provide a new axiomatic definition of an epistemic state and study some of its pr...

In this report1, we argue that to apply rationality results of belief dynamics theory to various practical problems, it should be generalised in two respects: rst of all, it should allow certain part of belief to be declared immutable; and secondly, the belief state need not be deductively closed. Such a generalisation of belief dynamics, referred to as knowledge base dynamics, is presented, al...