M. Abadi & Z. Manna (1989):
Temporal Logic Programming.
Journal of Symbolic Computation 8,
pp. 277–295,
doi:10.1016/s0747-7171(89)80070-7.
D. Abels, J. Jordi, M. Ostrowski, T. Schaub, A. Toletti & P. Wanko (2009):
Train scheduling with hybrid ASP.
In: C. Boutilier: Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI'09).
AAAI/MIT Press,
pp. 3–17,
doi:10.1007/978-3-030-20528-7_1.
J. Allen (1983):
Maintaining knowledge about temporal intervals.
Communications of the ACM 26(11),
pp. 832–843,
doi:10.1016/b978-1-4832-1447-4.50033-x.
A. Andreychuk, K. Yakovlev, D. Atzmon & R. Stern (2019):
Multi-Agent Pathfinding with Continuous Time.
In: S. Kraus: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI'19).
ijcai.org,
pp. 39–45,
doi:10.24963/ijcai.2019/6.
M. Balduccini, D. Magazzeni & M. Maratea (2016):
PDDL+ Planning via Constraint Answer Set Programming.
In: B. Bogaerts & A. Harrison: Proceedings of the Ninth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'16),
pp. 1–12.
Available at https://sites.google.com/site/aspocp2016/.
P. Cabalar, R. Kaminski, P. Morkisch & T. Schaub (2009):
telingo = ASP + Time.
In: C. Boutilier: Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI'09).
AAAI/MIT Press,
pp. 256–269,
doi:10.1007/978-3-030-20528-7_19.
S. Demri, V. Goranko & M. Lange (2016):
Temporal Logics in Computer Science: Finite-State Systems.
Cambridge Tracts in Theoretical Computer Science.
Cambridge University Press.
S. Dworschak, S. Grell, V. Nikiforova, T. Schaub & J. Selbig (2008):
Modeling biological networks by action languages via answer set programming.
Constraints 13(1-2),
pp. 21–65,
doi:10.1007/s10601-007-9031-y.
D. Gabbay (1987):
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems.
In: B. Banieqbal, H. Barringer & A. Pnueli: Proceedings of the Conference on Temporal Logic in Specification,
Lecture Notes in Computer Science 398.
Springer-Verlag,
pp. 409–448,
doi:10.1007/3-540-51803-7_36.
M. Gebser, T. Grote & T. Schaub (2010):
Coala: A Compiler from Action Languages to ASP.
In: T. Janhunen & I. Niemelä: Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10),
Lecture Notes in Artificial Intelligence 6341.
Springer-Verlag,
pp. 360–364,
doi:10.1007/978-3-642-15675-5_32.
M. Gebser, R. Kaminski, B. Kaufmann & T. Schaub (2012):
Answer Set Solving in Practice.
Synthesis Lectures on Artificial Intelligence and Machine Learning.
Morgan and Claypool Publishers.
M. Gebser, B. Kaufmann, A. Neumann & T. Schaub (2007):
clasp: A Conflict-Driven Answer Set Solver.
In: C. Baral, G. Brewka & J. Schlipf: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07),
Lecture Notes in Artificial Intelligence 4483.
Springer-Verlag,
pp. 260–265,
doi:10.1007/978-3-540-72200-7_23.
M. Gebser, T. Schaub & S. Thiele (2007):
Gringo: A New Grounder for Answer Set Programming.
In: C. Baral, G. Brewka & J. Schlipf: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07),
Lecture Notes in Artificial Intelligence 4483.
Springer-Verlag,
pp. 266–271,
doi:10.1007/978-3-540-72200-7_24.
M. Gelfond & V. Lifschitz (1988):
The Stable Model Semantics for Logic Programming.
In: R. Kowalski & K. Bowen: Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP'88).
MIT Press,
pp. 1070–1080.
M. Gelfond & V. Lifschitz (1998):
Action languages.
Electronic Transactions on Artificial Intelligence 3(6),
pp. 193–210.
Available at http://www.ep.liu.se/ej/etai/1998/007/.
E. Giunchiglia & V. Lifschitz (1998):
An Action Language Based on Causal Explanation: Preliminary Report.
In: Proceedings of the AAAI Conference on Artificial Intelligence,
pp. 623–630.
Available at citeseer.nj.nec.com/article/giunchiglia98action.html.
R. Gómez, C. Hernández & J. Baier (2021):
A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding.
IEEE Access 9,
pp. 26886–26901,
doi:10.1109/access.2021.3053547.
Márton Karsai, Nicola Perra & Alessandro Vespignani (2014):
Time varying networks and the weakness of strong ties.
Scientific Reports 4(1),
doi:10.1038/srep04001.