Fuzzy Rule-Based Classification Systems (FRBCS) are highly investigated by researchers due to their noise-stability and  interpretability. Unfortunately, generating a rule-base which is sufficiently both accurate and interpretable, is a hard process. Rule weighting is one of the approaches to improve the accuracy of a pre-generated rule-base without modifying the original rules. Most of the pro...

Standard belief change assumes an underlying logic containing full classical propositional logic. However, there are good reasons for considering belief change in less expressive logics as well. In this paper we build on recent investigations by Delgrande on contraction for Horn logic. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. This result...

This paper examines the relationship between Shafer's belief functions and convex sets of probability distributions. Kyburg's (1986) result showed that belief function models form a subset of the class of closed convex probability distributions. This paper emphasizes the importance of Kyburg's result by looking at simple examples involving Bernoulli trials. Furthermore, it is shown that many co...

The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. In order to apply the rationality result of belief dynamics theory to various practical problems, it should be generalized in two respects: first it should allow a certain part of belief to be declared as immutable; and second, the belief sta...

Datalog+/is a family of emerging ontology languages that can be used for representing and reasoning over lightweight ontologies in Semantic Web. In this paper, we propose an approach to performing belief base revision for Datalog+/ontologies. We define a kernel based belief revision operator for Datalog+/and study its properties using extended postulates, as well as an algorithm to revise Datal...

We slightly improve on characterization results already in the literature for base revision. We show that in order to axiomatically characterize revision operators in a logic the only conditions this logic is required to satisfy are: finitarity and monotonicity. A characterization of limiting cases of revision operators, full meet and maxichoice, is also offered. In the second part of the paper...

Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraints. In this paper, we show that this is not suited to every merging scenario. We study the case when the bases are ”rationalized” with respect to the integrity constraints during the merging process. We define in formal terms several independence conditions for...

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...