9 citations · 10 across the 2 of their papers we have counts for
2 papers
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…
cs.LO2011★ 9 cited
Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages
Francois Hantry, Mohand-Said Hacid
Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support f…