Research map / Large language models / Retrieval and knowledge
Minimal Undefinedness for Fuzzy Answer Sets
Mario Alviano, Giovanni Amendola, Rafael Peñaloza
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use binary search instead of progression, epsilon=0.1 | MUFAS computation · Hamiltonian Cycle | solved instances: 22% -> 100% | Improved |
| use binary search instead of epsilon-improvement, epsilon=0.1 | MUFAS computation · Hamiltonian Cycle | solved instances: 0% -> 100% | Improved |
| use binary search instead of progression, epsilon=0.01 | MUFAS computation · Hamiltonian Cycle | solved instances: 67% -> 94% | Improved |
| use binary search instead of progression, epsilon=0.001 | MUFAS computation · Hamiltonian Cycle | solved instances: 44% -> 83% | Improved |
| use binary search instead of progression, epsilon=0.1 | MUFAS computation · Hamiltonian Cycle | bound difference ub-lb: 0.409 -> 0.073 | Improved |
| use Z3 minimize instead of binary search, epsilon=0.1 | MUFAS computation · Hamiltonian Cycle | solved instances: 100% -> 6% | Hurt |
| decrease epsilon from 0.1 to 0.01 | binary search · Hamiltonian Cycle | solved instances: 100% -> 94% | Hurt |
| decrease epsilon from 0.01 to 0.001 | binary search · Hamiltonian Cycle | solved instances: 94% -> 83% | Hurt |
| decrease epsilon from 0.1 to 0.01 | progression · Hamiltonian Cycle | solved instances: 22% -> 67% | Improved |
| decrease epsilon from 0.01 to 0.001 | progression · Hamiltonian Cycle | solved instances: 67% -> 44% | Hurt |
| decrease epsilon from 0.1 to 0.001 | binary search · Hamiltonian Cycle | bound difference ub-lb: 0.073 -> 0.005 | Improved |
| decrease epsilon from 0.01 to 0.001 | progression · Hamiltonian Cycle | bound difference ub-lb: 0.111 -> 0.565 | Hurt |
Closest papers by meaning
- Exact ASP Counting with Compact Encodings (AAAI 2024 · similarity 0.82)
- A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming (AAAI 2024 · similarity 0.81)
- On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? (AAAI 2024 · similarity 0.80)
- Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence (AAAI 2025 · similarity 0.80)
- Program-as-Weights: A Programming Paradigm for Fuzzy Functions (NeurIPS 2026 · similarity 0.79)
- QuestBench: Can LLMs ask the right question to acquire information in reasoning tasks? (NeurIPS 2025 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
