Operations on Soft Sets Revisited

The concept of soft sets introduced by Molodtsov is a general mathematical tool for dealing with uncertainty. Just as the conventional set-theoretic operations of intersection, union, complement, and difference, some corresponding operations on soft sets have been proposed. Unfortunately, such operations cannot keep all classical set-theoretic laws true for soft sets. In this paper, we redefine the intersection, complement, and difference of soft sets and investigate the algebraic properties of these operations along with a known union operation. We find that the new operation system on soft sets inherits all basic properties of operations on classical sets, which justifies our definitions

On the fixed point theory of soft metric spaces

[EN] The aim of this paper is to show that a soft metric induces a compatible metric on the collection of all soft points of the absolute soft set, when the set of parameters is a finite set. We then show that soft metric extensions of several important fixed point theorems for metric spaces can be directly deduced from comparable existing results. We also present some examples to validate and illustrate our approach.Salvador Romaguera thanks the support of Ministry of Economy and Competitiveness of Spain, Grant MTM2012-37894-C02-01.Abbas, M.; Murtaza, G.; Romaguera Bonilla, S. (2016). On the fixed point theory of soft metric spaces. Fixed Point Theory and Applications. 2016(17):1-11. https://doi.org/10.1186/s13663-016-0502-yS111201617Zadeh, LA: Fuzzy sets. Inf. Control 8, 103-112 (1965)Molodtsov, D: Soft set theory - first results. Comput. Math. Appl. 37, 19-31 (1999)Aktaş, H, Çağman, N: Soft sets and soft groups. Inf. Sci. 177, 2726-2735 (2007)Ali, MI, Feng, F, Liu, X, Min, WK, Shabir, M: On some new operations in soft set theory. Comput. Math. Appl. 57, 1547-1553 (2009)Feng, F, Liu, X, Leoreanu-Fotea, V, Jun, YB: Soft sets and soft rough sets. Inf. Sci. 181, 1125-1137 (2011)Jiang, Y, Tang, Y, Chen, Q, Wang, J, Tang, S: Extending soft sets with description logics. Comput. Math. Appl. 59, 2087-2096 (2009)Jun, YB: Soft BCK/BCI-algebras. Comput. Math. Appl. 56, 1408-1413 (2008)Jun, YB, Lee, KJ, Khan, A: Soft ordered semigroups. Math. Log. Q. 56, 42-50 (2010)Jun, YB, Lee, KJ, Park, CH: Soft set theory applied to ideals in d-algebras. Comput. Math. Appl. 57, 367-378 (2009)Jun, YB, Park, CH: Applications of soft sets in ideal theory of BCK/BCI-algebras. Inf. Sci. 178, 2466-2475 (2008)Kong, Z, Gao, L, Wang, L, Li, S: The normal parameter reduction of soft sets and its algorithm. Comput. Math. Appl. 56, 3029-3037 (2008)Majumdar, P, Samanta, SK: Generalized fuzzy soft sets. Comput. Math. Appl. 59, 1425-1432 (2010)Li, F: Notes on the soft operations. ARPN J. Syst. Softw. 1, 205-208 (2011)Maji, PK, Roy, AR, Biswas, R: An application of soft sets in a decision making problem. Comput. Math. Appl. 44, 1077-1083 (2002)Qin, K, Hong, Z: On soft equality. J. Comput. Appl. Math. 234, 1347-1355 (2010)Xiao, Z, Gong, K, Xia, S, Zou, Y: Exclusive disjunctive soft sets. Comput. Math. Appl. 59, 2128-2137 (2009)Xiao, Z, Gong, K, Zou, Y: A combined forecasting approach based on fuzzy soft sets. J. Comput. Appl. Math. 228, 326-333 (2009)Xu, W, Ma, J, Wang, S, Hao, G: Vague soft sets and their properties. Comput. Math. Appl. 59, 787-794 (2010)Yang, CF: A note on soft set theory. Comput. Math. Appl. 56, 1899-1900 (2008)Yang, X, Lin, TY, Yang, J, Li, Y, Yu, D: Combination of interval-valued fuzzy set and soft set. Comput. Math. Appl. 58, 521-527 (2009)Zhu, P, Wen, Q: Operations on soft sets revisited (2012). arXiv:1205.2857v1Feng, F, Jun, YB, Liu, XY, Li, LF: An adjustable approach to fuzzy soft set based decision making. J. Comput. Appl. Math. 234, 10-20 (2009)Feng, F, Jun, YB, Zhao, X: Soft semirings. Comput. Math. Appl. 56, 2621-2628 (2008)Feng, F, Liu, X: Soft rough sets with applications to demand analysis. In: Int. Workshop Intell. Syst. Appl. (ISA 2009), pp. 1-4. (2009)Herawan, T, Deris, MM: On multi-soft sets construction in information systems. In: Emerging Intelligent Computing Technology and Applications with Aspects of Artificial Intelligence, pp. 101-110. Springer, Berlin (2009)Herawan, T, Rose, ANM, Deris, MM: Soft set theoretic approach for dimensionality reduction. In: Database Theory and Application, pp. 171-178. Springer, Berlin (2009)Kim, YK, Min, WK: Full soft sets and full soft decision systems. J. Intell. Fuzzy Syst. 26, 925-933 (2014). doi: 10.3233/IFS-130783Mushrif, MM, Sengupta, S, Ray, AK: Texture classification using a novel, soft-set theory based classification algorithm. Lect. Notes Comput. Sci. 3851, 246-254 (2006)Roy, AR, Maji, PK: A fuzzy soft set theoretic approach to decision making problems. J. Comput. Appl. Math. 203, 412-418 (2007)Zhu, P, Wen, Q: Probabilistic soft sets. In: IEEE Conference on Granular Computing (GrC 2010), pp. 635-638 (2010)Zou, Y, Xiao, Z: Data analysis approaches of soft sets under incomplete information. Knowl.-Based Syst. 21, 941-945 (2008)Cagman, N, Karatas, S, Enginoglu, S: Soft topology. Comput. Math. Appl. 62, 351-358 (2011)Das, S, Samanta, SK: Soft real sets, soft real numbers and their properties. J. Fuzzy Math. 20, 551-576 (2012)Das, S, Samanta, SK: Soft metric. Ann. Fuzzy Math. Inform. 6, 77-94 (2013)Abbas, M, Murtaza, G, Romaguera, S: Soft contraction theorem. J. Nonlinear Convex Anal. 16, 423-435 (2015)Chen, CM, Lin, IJ: Fixed point theory of the soft Meir-Keeler type contractive mappings on a complete soft metric space. Fixed Point Theory Appl. 2015, 184 (2015)Feng, F, Li, CX, Davvaz, B, Ali, MI: Soft sets combined with fuzzy sets and rough sets: a tentative approach. Soft Comput. 14, 8999-9911 (2010)Maji, PK, Biswas, R, Roy, AR: Soft set theory. Comput. Math. Appl. 45, 555-562 (2003)Wardowski, D: On a soft mapping and its fixed points. Fixed Point Theory Appl. 2013, 182 (2013)Kannan, R: Some results on fixed points II. Am. Math. Mon. 76, 405-408 (1969)Meir, A, Keeler, E: A theorem on contraction mappings. J. Math. Anal. Appl. 28, 326-329 (1969)Caristi, J: Fixed point theorems for mappings satisfying inwardness conditions. Trans. Am. Math. Soc. 215, 241-251 (1976)Kirk, WA: Caristi’s fixed-point theorem and metric convexity. Colloq. Math. 36, 81-86 (1976

Preassociative aggregation functions

The classical property of associativity is very often considered in aggregation function theory and fuzzy logic. In this paper we provide axiomatizations of various classes of preassociative functions, where preassociativity is a generalization of associativity recently introduced by the authors. These axiomatizations are based on existing characterizations of some noteworthy classes of associative operations, such as the class of Acz\'elian semigroups and the class of t-norms.Comment: arXiv admin note: text overlap with arXiv:1309.730

The foundational legacy of ASL

Abstract. We recall the kernel algebraic specification language ASL and outline its main features in the context of the state of research on algebraic specification at the time it was conceived in the early 1980s. We discuss the most significant new ideas in ASL and the influence they had on subsequent developments in the field and on our own work in particular.

Cygnus A super-resolved via convex optimisation from VLA data

We leverage the Sparsity Averaging Reweighted Analysis (SARA) approach for interferometric imaging, that is based on convex optimisation, for the super-resolution of Cyg A from observations at the frequencies 8.422GHz and 6.678GHz with the Karl G. Jansky Very Large Array (VLA). The associated average sparsity and positivity priors enable image reconstruction beyond instrumental resolution. An adaptive Preconditioned Primal-Dual algorithmic structure is developed for imaging in the presence of unknown noise levels and calibration errors. We demonstrate the superior performance of the algorithm with respect to the conventional CLEAN-based methods, reflected in super-resolved images with high fidelity. The high resolution features of the recovered images are validated by referring to maps of Cyg A at higher frequencies, more precisely 17.324GHz and 14.252GHz. We also confirm the recent discovery of a radio transient in Cyg A, revealed in the recovered images of the investigated data sets. Our matlab code is available online on GitHub.Comment: 14 pages, 7 figures (3/7 animated figures), accepted for publication in MNRA

The power of linear programming for general-valued CSPs

Let $D$, called the domain, be a fixed finite set and let $\Gamma$, called the valued constraint language, be a fixed set of functions of the form $f:D^m\to\mathbb{Q}\cup\{\infty\}$, where different functions might have different arity $m$. We study the valued constraint satisfaction problem parametrised by $\Gamma$, denoted by VCSP$(\Gamma)$. These are minimisation problems given by $n$ variables and the objective function given by a sum of functions from $\Gamma$, each depending on a subset of the $n$ variables. Finite-valued constraint languages contain functions that take on only rational values and not infinite values. Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a valued constraint language $\Gamma$, BLP is a decision procedure for $\Gamma$ if and only if $\Gamma$ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language $\Gamma$, BLP is a decision procedure if and only if $\Gamma$ admits a symmetric fractional polymorphism of some arity, or equivalently, if $\Gamma$ admits a symmetric fractional polymorphism of arity 2. Using these results, we obtain tractability of several novel classes of problems, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) $k$-submodular on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees.Comment: A full version of a FOCS'12 paper by the last two authors (arXiv:1204.1079) and an ICALP'13 paper by the first author (arXiv:1207.7213) to appear in SIAM Journal on Computing (SICOMP