AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Enumerating Minimal Unsatisfiable Cores of LTLf Formulae

Antonio Ielo, Giuseppe Mazzotta, Rafael Peñaloza, 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 iterative-deepening probe depth with satisfiability certification instead of a single fixed depthmus2muc · Example formula X^5 beta and X^5 not betanumber of MUSes: two MUSes at depth 3 vs unique MUS {X^5 beta, X^5 not beta} at depth at least 5Improved
enumerate MUCs with mus2muc rather than must (ReMUS, MARCO, TOME)LTLf MUC enumeration · Full benchmark suitefully enumerated instances: can fully-enumerate more or less 500 more instances than any must variantImproved
use mus2muc instead of aaltaf-muc variants and aaltaf-uc for a single MUCsingle MUC extraction · Benchmark suite, hardest instancesruntimeImproved
choose between ReMUS, MARCO and TOME algorithms in mustmust · Benchmark suitefully enumerated instancesNo clear effect
aaltaf-muc binary variants versus aaltaf-ucsingle core extraction · Hardest instancesruntimeImproved

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