348 research outputs found
Some views on information fusion and logic based approaches in decision making under uncertainty
Decision making under uncertainty is a key issue in information fusion and logic based reasoning approaches. The aim of this paper is to show noteworthy theoretical and applicational issues in the area of decision making under uncertainty that have been already done and raise new open research related to these topics pointing out promising and challenging research gaps that should be addressed in the coming future in order to improve the resolution of decision making problems under uncertainty
Algebraic Models for Qualified Aggregation in General Rough Sets, and Reasoning Bias Discovery
In the context of general rough sets, the act of combining two things to form
another is not straightforward. The situation is similar for other theories
that concern uncertainty and vagueness. Such acts can be endowed with
additional meaning that go beyond structural conjunction and disjunction as in
the theory of -norms and associated implications over -fuzzy sets. In the
present research, algebraic models of acts of combining things in generalized
rough sets over lattices with approximation operators (called rough convenience
lattices) is invented. The investigation is strongly motivated by the desire to
model skeptical or pessimistic, and optimistic or possibilistic aggregation in
human reasoning, and the choice of operations is constrained by the
perspective. Fundamental results on the weak negations and implications
afforded by the minimal models are proved. In addition, the model is suitable
for the study of discriminatory/toxic behavior in human reasoning, and of ML
algorithms learning such behavior.Comment: 15 Pages. Accepted. IJCRS-202
Sequences of refinements of rough sets: logical and algebraic aspects
In this thesis, a generalization of the classical Rough set theory is developed considering the so-called sequences of orthopairs that we define as special sequences of rough sets.
Mainly, our aim is to introduce some operations between sequences of orthopairs, and to discover how to generate them starting from the operations concerning standard rough sets. Also, we prove several representation theorems representing the class of finite centered Kleene algebras with the interpolation property, and some classes of finite residuated lattices (more precisely, we consider Nelson algebras, Nelson lattices, IUML-algebras and Kleene lattice with implication) as sequences of orthopairs.
Moreover, as an application, we show that a sequence of orthopairs can be used to represent an examiner's opinion on a number of candidates applying for a job, and we show that opinions of two or more examiners can be combined using operations between sequences of orthopairs in order to get a final decision on each candidate.
Finally, we provide the original modal logic SOn with semantics based on sequences of orthopairs, and we employ it to describe the knowledge of an agent that increases over time, as new information is provided. Modal logic Son is characterized by the sequences (\u25a11,\u2026, \u25a1n) and (O1,\u2026, On) of n modal operators corresponding to a sequence (t1,\u2026, tn) of consecutive times. Furthermore, the operator \u25a1i of (\u25a11,\u2026, \u25a1n) represents the knowledge of an agent at time ti, and it coincides with the necessity modal operator of S5 logic. On the other hand, the main innovative aspect of modal logic SOn is the presence of the sequence (O1,\u2026, On), since Oi establishes whether an agent is interested in knowing a given fact at time ti
Discrete Mathematics and Symmetry
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group
- …