Metraipolis › archive › dc_e17a98e7db1f

Bipolar Fuzzy Minimum-Weight Satisfiability under Continuous t-Norms: A Clause-Witness Branch-and-Bound Framework — arXiv:2609.04927

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04927
License (as archived)
CC0-1.0
Archived
2026-10-16T23:11:30.340Z
SHA-256 of the archived text
014aa539ddb63fa11eecc38ac8d4516a11037ce54f9397dbed9be64109e5e133
Stable URL of this page
https://metraipolis.com/documento/dc_e17a98e7db1f

How to cite

Bipolar Fuzzy Minimum-Weight Satisfiability under Continuous t-Norms: A Clause-Witness Branch-and-Bound Framework — arXiv:2609.04927 — arXiv (en), https://arxiv.org/abs/2609.04927 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e17a98e7db1f (Metraipolis archive dc_e17a98e7db1f, sha256 014aa539ddb63fa11eecc38ac8d4516a11037ce54f9397dbed9be64109e5e133)
BibTeX
@misc{dce17a98e7db1f,
  title = {Bipolar Fuzzy Minimum-Weight Satisfiability under Continuous t-Norms: A Clause-Witness Branch-and-Bound Framework — arXiv:2609.04927},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04927},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e17a98e7db1f; sha256 014aa539ddb63fa11eecc38ac8d4516a11037ce54f9397dbed9be64109e5e133},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04927. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Minimum-weight satisfiability asks for a satisfying Boolean assignment of minimum cost, while many fuzzy decision and knowledge systems operate with graded positive and negative relations rather than crisp literals. This paper introduces a bipolar fuzzy minimum-weight satisfiability problem in which positive and negative clause--variable relations, target clause levels, and variable states are represented in the unit interval. The clause requirements are expressed by bipolar fuzzy relational equalities defined with an arbitrary continuous t-norm. Classical minimum-weight CNF satisfiability is recovered as a crisp special case, independently of the selected t-norm, and an optimal Boolean solution is shown to exist in that specialization even though the proposed formulation uses continuous variables. For the graded problem, clause satisfaction is characterized through admissible variable domains and effective clause-witness sets. This structure leads to an exact clause-witness branch-and-bound method with preprocessing, propagation, lower-point closure, and a disjoint-witness packing bound. Computational experiments verify the solver against explicit witness enumeration, mixed-integer baselines, and external SATLIB formulas; on a focused graded ablation set, the packing bound reduces the median number of explored nodes by about 45 percent relative to the single-row witness bound.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.04927 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T22:51:59.421Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).