Related papers: Approximate reasoning with aggregation functions s…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
We present an approximate converse theorem which measures how close a given set of irreducible admissible unramified unitary generic local representations of GL(n) is to a genuine cuspidal representation. To get a formula for the measure,…
Fuzzy implication functions have been widely investigated, both in theoretical and practical fields. The aim of this work is to continue previous works related to fuzzy implications constructed by means of non necessarily associative…
In this work, we consider the problem of distributed approximation of functions over multiple-access channels with additive noise. In contrast to previous works, we take fast fading into account and give explicit probability bounds for the…
Most fuzzy systems including fuzzy decision support and fuzzy control systems provide out-puts in the form of fuzzy sets that represent the inferred conclusions. Linguistic interpretation of such outputs often involves the use of linguistic…
In this paper, we propose the theory of fuzzy limit of fuzzy function depending on the Altai principle and using the representation theorem (resolution principle) to run the fuzzy arithmetic
The set similarity join problem is a fundamental problem in data processing and discovery, relying on exact similarity measures between sets. In the presence of alterations, such as misspellings on string data, the fuzzy set similarity join…
In this paper we introduce a new type of approximate state reductions where the behaviors of the reduced and the original automaton do not have to be identical, but they must match on all words of length less than or equal to some given…
We study algorithms for the Submodular Multiway Partition problem (SubMP). An instance of SubMP consists of a finite ground set $V$, a subset of $k$ elements $S = \{s_1,s_2,...,s_k\}$ called terminals, and a non-negative submodular set…
Fuzzy answer set programming is a declarative framework for representing and reasoning about knowledge in fuzzy environments. However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, DFLP, with fuzzy answer set…
A new analytical approximation function is proposed to accurately fit the solution of a fractional differential equation of order one-half, whose nonhomogeneous term is defined by a modified Bessel function of the first kind. The exact…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
With the widespread use of machine learning to support decision-making, it is increasingly important to verify and understand the reasons why a particular output is produced. Although post-training feature importance approaches assist this…
Fault detection methods have their pros and cons. Thus, it is possible that some methods can complement each other and offer consequently better diagnostic systems. The integration of various characteristics is a way to develop "hybrid"…
The paper extends the widely used in optimisation theory decoupling techniques to infinite collections of functions. Extended concepts of uniform lower semicontinuity and firm uniform lower semicontinuity are discussed. The main theorems…
In this article we utilise abstract convexity theory in order to unify and generalize many different concepts from nonsmooth analysis. We introduce the concepts of abstract codifferentiability, abstract quasidifferentiability and abstract…
Our aim of this paper is to develop new map matching algorithms and to improve upon previous work. We address two key approaches: Analytic Hierarchy Process (AHP) map matching and fuzzy logic map matching. AHP is a decision-making method…
Several concepts of approximate reasoning in uncertainty processing are linked to the processing of distribution functions. In this paper we make use of probabilistic framework of approximate reasoning by proposing a Lebesgue-type approach…
We prove a compactness theorem in the context of Hennessy-Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process…
We consider the problem where a set of individuals has to classify $m$ objects into $p$ categories and does so by aggregating the individual classifications. We show that if $m\geq 3$, $m\geq p\geq 2$, and classifications are fuzzy, that…