Image de couverture de livre

An Efficient Computational Framework for Discrete Fuzzy Numbers Based on Total Orders

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mir, Arnau, Mus, Alejandro, Riera, Juan Vicente
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science Computation and Language Discrete Mathematics Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The unstable formula theorem revisited via algorithms
par: Malliaris, Maryanthe, et autres
Publié: (2022)

Agnostic Online Learning and Excellent Sets
par: Malliaris, Maryanthe, et autres
Publié: (2021)

A Second Soul: Celebrating the Many Languages of Programming -- Festschrift in Honor of Peter Thiemann's Sixtieth Birthday
par: Bieniusa, Annette, et autres
Publié: (2024)

Efficient reversal of transductions of sparse graph classes
par: Dreier, Jan, et autres
Publié: (2026)

Boolean Variation and Boolean Logic BackPropagation
par: Nguyen, Van Minh
Publié: (2023)

First-Order Logic and Twin-Width for Some Geometric Graphs
par: Geniet, Colin, et autres
Publié: (2025)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
par: Van Caudenberg, Daimy, et autres
Publié: (2025)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
par: Fuchser, Janne, et autres
Publié: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
par: Lyon, Tim S.
Publié: (2022)

Logic-based analogical proportions
par: Antić, Christian
Publié: (2024)

Symbolic Sets for Proving Bounds on Rado Numbers
par: Ahmed, Tanbir, et autres
Publié: (2025)

Graphical Conditions for the Existence, Unicity and Number of Regular Models
par: Trinh, Van-Giang, et autres
Publié: (2025)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
par: Feller, Thomas, et autres
Publié: (2023)

SAT-Solving the Poset Cover Problem
par: Yuan, Chih-Cheng Rex, et autres
Publié: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
par: Haar, Stefan, et autres
Publié: (2025)

Verifying Sampling Algorithms via Distributional Invariants
par: Zilken, Daniel, et autres
Publié: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
par: Trinh, Van-Giang, et autres
Publié: (2025)

Learning Foundations Beneath the Stars
par: Cardone, Felice, et autres
Publié: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
par: Bacik, Piotr, et autres
Publié: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
par: Memmi, Gerard
Publié: (2024)

Hypergraph rewriting and Causal structure of $λ-$calculus
par: Bajaj, Utkarsh
Publié: (2024)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
par: Dreier, Jan
Publié: (2021)

Separability Properties of Monadically Dependent Graph Classes
par: Bonnet, Édouard, et autres
Publié: (2025)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
par: Mählmann, Nikolas
Publié: (2025)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

The Iteration Number of the Weisfeiler-Leman Algorithm
par: Grohe, Martin, et autres
Publié: (2023)

The commutativity problem for effective varieties of formal series, and applications
par: Clemente, Lorenzo
Publié: (2025)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
par: Carette, Titouan, et autres
Publié: (2025)

Sequential composition of answer set programs
par: Antić, Christian
Publié: (2021)

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey $R(3, 8)$ and $R(3, 9)$ Problems
par: Li, Zhengyu, et autres
Publié: (2025)

Analogical proportions II
par: Antić, Christian
Publié: (2024)

First order complexity of finite random structures
par: Demin, Danila, et autres
Publié: (2024)

An Expansion-Based Approach for Quantified Integer Programming
par: Hartisch, Michael, et autres
Publié: (2025)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)