Details
| Original language | English |
|---|---|
| Title of host publication | AAAI Proceedings |
| Editors | Michael Wooldridge, Jennifer Dy, Sriraam Natarajan |
| Pages | 10517-10524 |
| Number of pages | 8 |
| Publication status | Published - 25 Apr 2024 |
Publication series
| Name | Proceedings of the AAAI Conference on Artificial Intelligence |
|---|---|
| Number | 9 |
| Volume | 38 |
| ISSN (Print) | 2159-5399 |
| ISSN (electronic) | 2374-3468 |
Abstract
Expressing system specifications using Computation Tree Logic (CTL) formulas, formalising programs using Kripke structures, and then model checking the system is an established workflow in program verification and has wide applications in AI. In this paper, we consider the task of model enumeration, which asks for a uniform stream of output systems that satisfy the given specification. We show that, given a CTL formula and a system (potentially falsified by the formula), enumerating satisfying submodels is always hard for CTL-regardless of which subset of CTL operators is considered. As a silver lining on the horizon, we present fragments via restrictions on the allowed Boolean functions that still allow for fast enumeration.
ASJC Scopus subject areas
- Computer Science(all)
- Artificial Intelligence
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
AAAI Proceedings. ed. / Michael Wooldridge; Jennifer Dy; Sriraam Natarajan. 2024. p. 10517-10524 (Proceedings of the AAAI Conference on Artificial Intelligence; Vol. 38, No. 9).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Submodel Enumeration for CTL Is Hard
AU - Fröhlich, Nicolas
AU - Meier, Arne
N1 - Publisher Copyright: Copyright © 2024, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2024/4/25
Y1 - 2024/4/25
N2 - Expressing system specifications using Computation Tree Logic (CTL) formulas, formalising programs using Kripke structures, and then model checking the system is an established workflow in program verification and has wide applications in AI. In this paper, we consider the task of model enumeration, which asks for a uniform stream of output systems that satisfy the given specification. We show that, given a CTL formula and a system (potentially falsified by the formula), enumerating satisfying submodels is always hard for CTL-regardless of which subset of CTL operators is considered. As a silver lining on the horizon, we present fragments via restrictions on the allowed Boolean functions that still allow for fast enumeration.
AB - Expressing system specifications using Computation Tree Logic (CTL) formulas, formalising programs using Kripke structures, and then model checking the system is an established workflow in program verification and has wide applications in AI. In this paper, we consider the task of model enumeration, which asks for a uniform stream of output systems that satisfy the given specification. We show that, given a CTL formula and a system (potentially falsified by the formula), enumerating satisfying submodels is always hard for CTL-regardless of which subset of CTL operators is considered. As a silver lining on the horizon, we present fragments via restrictions on the allowed Boolean functions that still allow for fast enumeration.
UR - http://www.scopus.com/inward/record.url?scp=85189321591&partnerID=8YFLogxK
U2 - 10.48550/arXiv.2312.09868
DO - 10.48550/arXiv.2312.09868
M3 - Conference contribution
SN - 978-1-57735-887-9
T3 - Proceedings of the AAAI Conference on Artificial Intelligence
SP - 10517
EP - 10524
BT - AAAI Proceedings
A2 - Wooldridge, Michael
A2 - Dy, Jennifer
A2 - Natarajan, Sriraam
ER -