Abstract
We describe telingo, an extension of the ASP system clingo with temporal operators over finite linear time and provide insights into its implementation. telingo takes temporal logic programs as input whose rules contain only future and present operators in their heads and past and present operators in their bodies. Moreover, telingo extends the grammar of clingo’s input language with a variety of temporal operators that can even be used to represent nested temporal formulas. By using clingo’s interface for manipulating the abstract syntax tree of non-ground programs, temporal logic programs are transformed into regular ones before grounding. The resulting regular logic program is then solved incrementally by using clingo’s multi-shot interface. Notably, this involves the consecutive unfolding of future temporal operators that is accomplished via external atoms. Finally, we provide an empirical evaluation contrasting standard incremental ASP programs with their temporal counterparts in telingo’s input language.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
Recall that
in the logic of here-and-there and thus in \(\mathrm {\mathrm {TEL}}_{\!f}\), too.
- 3.
The extension to arbitrary occurrences is no hurdle and foreseen in future versions of telingo.
- 4.
As above, the extension to disjunctions is no principal hurdle and foreseen in future versions of telingo; currently they must be expressed by using
.
- 5.
- 6.
This is also why this extension to the past-future format is tolerated in telingo’s input language.
- 7.
is valid in \(\mathrm {TEL}\).
- 8.
Unlike in the example above, we do not obtain strongly equivalent rules because we do not introduce weak next operators. This is safe in this context because the literal \({\bullet }^i \ell \) does not apply for horizons smaller \(i\).
- 9.
This feature is introduced with clingo 5.4.
- 10.
- 11.
- 12.
Detailed results are obtainable at https://github.com/potassco/clingo-vs-telingo-planning/tree/v1.0.0/benchmark-results.
References
Aguado, F., Cabalar, P., Diéguez, M., Pérez, G., Vidal, C.: Temporal equilibrium logic: a survey. J. Appl. Non-Classical Log. 23(1–2), 2–24 (2013)
Bosser, A., Cabalar, P., Diéguez, M., Schaub, T.: Introducing temporal stable models for linear dynamic logic. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, pp. 12–21. AAAI Press (2018)
Cabalar, P., Diéguez, M.: STELP: a tool for temporal answer set programming. In: [7], pp. 370–375 (2011)
Cabalar, P., Kaminski, R., Schaub, T., Schuhmann, A.: Temporal answer set programming on finite traces. Theory Pract. Log. Program. 18(3–4), 406–420 (2018)
Cabalar, P., Pérez Vega, G.: Temporal equilibrium logic: a first approach. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 241–248. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75867-9_31
De Giacomo, G., Vardi, M.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 854–860. IJCAI/AAAI Press (2013)
Delgrande, J., Faber, W. (eds.): LPNMR 2011. LNCS, vol. 6645. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9
Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., Schaub, T.: plasp 3: Towards effective ASP planning. Theory Pract. Log. Program. (2018, to appear)
Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Technical Communications of the International Conference on Logic Programming, vol. 52, pp. 2:1–2:15. OASIcs (2016)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27–82 (2019)
Gebser, M., Kaminski, R., König, A., Schaub, T.: Advances in gringo series 3. In: [7], pp. 345–351 (2011)
Giordano, L., Martelli, A., Theseider Dupré, D.: Reasoning about actions with temporal answer sets. Theory Pract. Log. Program. 13(2), 201–225 (2013)
Kaminski, R., Schaub, T., Wanko, P.: A tutorial on hybrid answer set solving with clingo. In: Ianni, G., et al. (eds.) Reasoning Web 2017. LNCS, vol. 10370, pp. 167–203. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61033-7_6
Kamp, J.: Tense logic and the theory of linear order. Ph.D. thesis, UCLA (1968)
Lifschitz, V.: Answer set planning. In: Proceedings of the International Conference on Logic Programming, pp. 23–37. MIT Press (1999)
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of the European Conference on Artificial Intelligence, pp. 412–416. IOS Press (2006)
Pnueli, A.: The temporal logic of programs. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 46–57. IEEE Press (1977)
Acknowledgments
This work was partially supported by MINECO, Spain, grant TIC2017-84453-P, Xunta de Galicia, Spain (GPC ED431B 2016/035 and 2016-2019 ED431G/01, CITIC), and DFG grant SCHA 550/9.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Cabalar, P., Kaminski, R., Morkisch, P., Schaub, T. (2019). telingo = ASP + Time. In: Balduccini, M., Lierler, Y., Woltran, S. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science(), vol 11481. Springer, Cham. https://doi.org/10.1007/978-3-030-20528-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-20528-7_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20527-0
Online ISBN: 978-3-030-20528-7
eBook Packages: Computer ScienceComputer Science (R0)