Eiter, Thomas and Soldà, Davide
(2024)
On Temporal ASP with Eager Unfoldable Operators.
In: Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}, 2023-8-19 - 2023-8-25, Jeju, South Korea.
|
Text
Learning_DBAs (4).pdf - Author Accepted Manuscript Available under License Creative Commons Attribution. Download (396kB) | Preview |
Abstract
<jats:p>Temporal Equilibrium Logic (TEL) extends Answer Set Programming (ASP) with linear-time temporal operators (LTL), enabling reasoning about dynamic systems. However, TEL enforces strong minimization criteria that may preclude intuitive models. Liveness formulas, for instance, tend to fail to have infinite equilibrium models, as TEL minimization postpones satisfaction forever. We address this limitation by introducing eager temporal operators (eager Until, eager Release, etc.), and present non-disjunctive temporal programs (NDTP) as a framework for modeling dependencies, inertia, and non-determinism. The fragment of tight temporal programs (TTP), which can be recognized efficiently based on automata techniques for loop detections, guarantees polynomial encodability into LTL. Practical examples, such as request-grant protocols and user permissions in distributed systems, illustrate the applicability of our approach.</jats:p>
| Item Type: | Conference Item (Unspecified) |
|---|---|
| Uncontrolled Keywords: | 4613 Theory Of Computation, 46 Information and Computing Sciences, 4602 Artificial Intelligence |
| Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 02 May 2024 07:21 |
| Last Modified: | 03 Oct 2025 17:09 |
| DOI: | 10.24963/ijcai.2024/498 |
| Related Websites: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3180722 |
Altmetric
Altmetric