On the complexity of computing minimal unsatisfiable LTL formulas
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | ISSN: 1433-8092 |
| Author | Saïs, Lakhdar, Hacid, Mohand-Said, Hantry, François |
| Maintainer | CCSD |
| Last Updated | May 9, 2026, 10:54 (UTC) |
| Created | May 9, 2026, 10:54 (UTC) |
| Identifier | hal-00870901 |
| Language | en |
| contributor | Centre de Recherche en Informatique de Lens (CRIL) ; Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS) |
| creator | Saïs, Lakhdar |
| date | 2012-05-26T00:00:00 |
| harvest_object_id | 1d1af0f2-a40f-4ad0-b310-ae6cec208c98 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-09-03T00:00:00 |
| set_spec | type:ART |