Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.03000

Fuzzy Implicative Rules: A Unified Approach

Raquel Fernandez-Peralta
View original source ↗Read source document ↗Export metadata ↓

Abstract

Rule mining algorithms are one of the fundamental techniques in data mining for disclosing significant patterns in terms of linguistic rules expressed in natural language. In this paper, we revisit the concept of fuzzy implicative rule to provide a solid theoretical framework for any fuzzy rule mining algorithm interested in capturing patterns in terms of logical conditionals rather than the co-occurrence of antecedent and consequent. In particular, we study which properties should satisfy the fuzzy operators to ensure a coherent behavior of different quality measures. As a consequence of this study, we introduce a new property of fuzzy implication functions related to a monotone behavior of the generalized modus ponens for which we provide different valid solutions. Also, we prove that our modeling generalizes others if an adequate choice of the fuzzy implication function is made, so it can be seen as an unifying framework. Further, we provide an open-source implementation in Python for mining fuzzy implicative associative rules. We test the applicability and relevance of our framework for different real datasets and fuzzy operators.

Explore related subjects

cs.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raquel Fernandez-Peralta. 2025-10-06. Fuzzy Implicative Rules: A Unified Approach. https://arxiv.org/abs/2504.03000

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Proving at Scale for Universal Algebra

We introduce SemiBase, a project that computes and formally certifies finite identity bases for small semigroups. Deciding finite basability is undecidable for finite algebras and remains open for finite semigroups. The task requires a proof that a candidate basis is complete, or a proof that none exists, rather than a single first-order validity query. LLM-guided agents search for these proofs; a referee agent rebuilds them from source, and the Lean kernel checks the resulting corpus in a final audit. Humans choose targets and approve final outcomes. We certify every semigroup of order at most 6: all 1309 semigroups of order at most 5 and all 15973 of order 6, including proofs that the four known nonfinitely based semigroups have no finite basis. The bases for order 6 define 505 distinct varieties, whose inclusion order Vampire determines except for four pairs. The resulting catalogue is a machine-checked account of results scattered across the literature and a tested foundation for order 7.

cs.LO↗
arXiv2026

From Zero-Dimensional to Continuous Dualities: A Double-Categorical Account

We investigate how to systematically construct continuous dualities from zero-dimensional dualities, employing well-known methods from algebra, topology, category theory, and domain theory. While our method is general, this paper focusses on the move from Stone spaces to compact Hausdorff spaces and the move from Priestley spaces to compact ordered Hausdorff spaces. The engine of our approach is Stone duality for relations: on the space side quotienting by a preorder turns zero-dimensional spaces into continuous ones, while distributive lattices with a proximity relation are their algebraic duals. Our duality for relations is inherently order-enriched. Double categories organise both functional and relational morphism in the same structure. The move from zero-dimensional to continuous dualities is then a three-step construction: extend a duality from functional to relational morphism, split idempotents, restrict to maps.

cs.LO↗
arXiv2026

A First Introduction to Isabelle/ML Metaprogramming: Automatic Estimation of Polynomial Degrees

This article offers an introduction to metaprogramming in Isabelle/HOL for beginners, based on a running example for working with multivariate polynomials. The example is motivated by our formalisation of universal Diophantine pairs. We describe the implementation of the poly_degree command, which computes upper bounds on the total degrees of multivariate polynomials and automatically proves their correctness. The complete metaprogram handles a variety of special cases but herein we present a simplified version for the sake of exposition. We describe our development process and design decisions; our goal is to offer a small and self-contained tutorial on Isabelle/ML, for mathematicians who want to get started with metaprogramming.

cs.LO↗