most citedOn the Complexity of Computing Minimal Unsatisfiable LTL formulas

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LO2012★ 1 cited

On the Complexity of Computing Minimal Unsatisfiable LTL formulas

Francois Hantry, Lakhdar Saïs, Mohand-Saïd Hacid

We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU-search) are FPSPACE complete because of the very exp…