AI Paper Atlas

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

AAAI 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, alaska family, k=64solved instances: 16 -> 114Improved
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, forobots family, k=64solved instances: 0 -> 38Improved
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, random family, k=64solved instances: 125 -> 935Improved
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, trp family, k=64solved instances: 209 -> 753Improved
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, anzu family, k=64solved instances: 34 -> 68Improved
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, schuppan family, k=64solved instances: 38 -> 57Improved
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, acacia family, k=64solved instances: 10 -> 11No clear effect
use ASP-based syntax-tree MUC extraction instead of BLACKltlf-stc · LTLf MUC, rozier family, k=64solved instances: 70 -> 147Improved
increase bound k from 8 to 64ltlf-stc · LTLf MUC, alaska family, k=8 vs 64solved instances: 129 -> 114Hurt
increase bound k from 8 to 64ltlf-stc · LTLf single MUC time, anzu familymean runtime (s): 11.083 -> 48.160Hurt
increase bound k from 8 to 64ltlf-stc · LTLf MUC enumeration, anzu familymedian number of MUCs enumerated in 120 s: 694 -> 0Hurt
increase bound k from 8 to 64BLACK · LTLf MUC, random family, k=8 vs 64solved instances: 142 -> 125Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy