Metraipolis › archive › dc_e07a21ada476
Formal Explanations for Linear Temporal Logic over Finite Traces — arXiv:2610.35169
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.35169
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-27T08:02:32.951Z
- SHA-256 of the archived text
5220fad31e1f29d02647e0b0bc46ced62910f648eb99707022a4e993dc4b4018- Stable URL of this page
https://metraipolis.com/documento/dc_e07a21ada476
How to cite
Formal Explanations for Linear Temporal Logic over Finite Traces — arXiv:2610.35169 — arXiv (en), https://arxiv.org/abs/2610.35169 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e07a21ada476 (Metraipolis archive dc_e07a21ada476, sha256 5220fad31e1f29d02647e0b0bc46ced62910f648eb99707022a4e993dc4b4018)
BibTeX
@misc{dce07a21ada476,
title = {Formal Explanations for Linear Temporal Logic over Finite Traces — arXiv:2610.35169},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.35169},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e07a21ada476; sha256 5220fad31e1f29d02647e0b0bc46ced62910f648eb99707022a4e993dc4b4018},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.35169. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Linear Temporal Logic over Finite Traces (LTLf) is widely used in Artificial Intelligence to specify desired temporal behavior and determine whether finite traces satisfy or violate it. Explaining these outcomes is essential for debugging and trust. However, existing approaches typically capture either sufficient reasons or counterfactual causes, without clarifying their relationship. We introduce a native characterization of abductive (AXps) and contrastive (CXps) explanations directly over finite traces, based on locking and unlocking time-indexed events. We prove its equivalence to the classifier-based formulation, and show that CXps coincide with a recently proposed temporal causality semantics for LTLf. This characterization enables an efficient implementation based on the enumeration of minimal unsatisfiable cores and minimal correction sets of ASP programs. Experiments on real-world event logs demonstrate the effectiveness of the approach. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2610.35169 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-27T07:55:30.970Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).