Research map / Learning theory and algorithms / Combinatorial and search optimization
Computing Syntax Tree-based Minimal Unsatisfiable Cores of LTLf Formulas
Valeria Fionda, Antonio Ielo, Francesco Ricca
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 ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, alaska family, k=64 | solved instances: 16 -> 114 | Improved |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, forobots family, k=64 | solved instances: 0 -> 38 | Improved |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, random family, k=64 | solved instances: 125 -> 935 | Improved |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, trp family, k=64 | solved instances: 209 -> 753 | Improved |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, anzu family, k=64 | solved instances: 34 -> 68 | Improved |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, schuppan family, k=64 | solved instances: 38 -> 57 | Improved |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, acacia family, k=64 | solved instances: 10 -> 11 | No clear effect |
| use ASP-based syntax-tree MUC extraction instead of BLACK | ltlf-stc · LTLf MUC, rozier family, k=64 | solved instances: 70 -> 147 | Improved |
| increase bound k from 8 to 64 | ltlf-stc · LTLf MUC, alaska family, k=8 vs 64 | solved instances: 129 -> 114 | Hurt |
| increase bound k from 8 to 64 | ltlf-stc · LTLf single MUC time, anzu family | mean runtime (s): 11.083 -> 48.160 | Hurt |
| increase bound k from 8 to 64 | ltlf-stc · LTLf MUC enumeration, anzu family | median number of MUCs enumerated in 120 s: 694 -> 0 | Hurt |
| increase bound k from 8 to 64 | BLACK · LTLf MUC, random family, k=8 vs 64 | solved instances: 142 -> 125 | Hurt |
Closest papers by meaning
- End-to-End Learning of LTLf Formulae by Faithful LTLf Encoding (AAAI 2024 · similarity 0.87)
- LTLf Synthesis Under Unreliable Input (AAAI 2025 · similarity 0.84)
- Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence (AAAI 2025 · similarity 0.84)
- Reasoning-as-Logic-Units: Scaling Test-Time Reasoning in Large Language Models Through Logic Unit Alignment (ICML 2025 · similarity 0.84)
- Divide and Translate: Compositional First-Order Logic Translation and Verification for Complex Logical Reasoning (ICLR 2025 · similarity 0.84)
- A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming (AAAI 2024 · similarity 0.83)
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.
