arXiv (OAI Expanded)
open access
Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming
This paper introduces SATFuL, a SAT solver for fuzzy logics. In contrast to the Boolean case, for which numerous SAT solvers exist, the SAT problem for fuzzy logics has attracted less attention, even though these tools have interesting applications. Unlike existing SAT solvers for fuzzy logics, SATF
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming#785147
- Enhanced Filtering Algorithms for the Euclidean Traveling Salesperson Problem and its variants in Constraint Logic Programming#444688
- EXPERIMENTS WITH AN INTEGER PROGRAMMING FORMULATION OF AN EXPERT SYSTEM#933532
- A bipolar fuzzy relation equation framework for clinical decision support systems#927757
- AN ALGORITHM FOR BICRITERION LINEAR-PROGRAMMING#208081
Record · ID 783557
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive