Theories of dynamic reasoning invariably are more elegant on paper than they are in an implementation. A major criticism of the AGM belief revision logic [Gärdenfors 1988] is that it relies on calculations using infinite belief sets to satisfy its postulates for rational belief revision. This has stopped it from being used in any practical systems for reasoning. [Williams 1993] proposes a theor...

The justification of Bayes' rule by cognitive rationality principles is undertaken by extending the propositional axiom systems usually proposed in two contexts of belief change: revising and updating. Probabilistic belief change axioms are introduced, either by direct transcription of the set-theoretic ones, or in a stronger way nevertheless in the spirit of the underlying propositional princi...

There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...

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

Recent developments in philosophical studies of belief revision have led to the construction of models that are much closer to actual computing systems than the earlier models. An operation of contraction (revision) on a logically closed belief set can be obtained by assigning to it a finite belief base and an operation of contraction (revision) on that base. Exact characterizations of such bas...

We propose in this paper a new family of belief merging operators, that is based on a game between sources : until a coherent set of sources is reached, at each round a contest is organized to find out the weakest sources, then those sources has to concede (weaken their point of view). This idea leads to numerous new interesting operators (depending of the exact meaning of “weakest” and “conced...

In this paper we examine ten concrete propositional update operations of the literature. We start by completely characterizing their relative strength and their computational complexity. Then we evaluate the competing update operations w.r.t. the postulates proposed by Katsuno and Mendelzon. It turns out that the majority violates most of the postulates. We argue that all violated postulates ar...

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