On the complexity of computing minimal unsatisfiable LTL formulas

Lakhdar Saïs 1 Mohand-Said Hacid 2 François Hantry 2
2 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00870901
Contributor : Francois Chevallier <>
Submitted on : Tuesday, October 8, 2013 - 12:28:29 PM
Last modification on : Tuesday, February 26, 2019 - 11:49:40 AM

Identifiers

  • HAL Id : hal-00870901, version 1

Citation

Lakhdar Saïs, Mohand-Said Hacid, François Hantry. On the complexity of computing minimal unsatisfiable LTL formulas. Electronic Colloquium on Computational Complexity, Hasso Plattner Institute, 2012, 19, pp.69. ⟨http://eccc.hpi-web.de/report/2012/069/⟩. ⟨hal-00870901⟩

Share

Metrics

Record views

174