1. Aguado, F., Cabalar, P., Diéguez, M., Pérez, G., Vidal, C.: Temporal equilibrium logic: a survey. J. Appl. Non-Classical Logics 23(1–2), 2–24 (2013). https://doi.org/10.1080/11663081.2013.798985
2. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 399–404. AAAI/MIT Press (2009)
3. Cabalar, P., Diéguez, M., Hahn, S., Schaub, T.: Automata for dynamic answer set solving: preliminary report. In: Proceedings of the Fourteenth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2021) (2021). http://ceur-ws.org/Vol-2970/aspocpinvited1.pdf
4. Comploi-Taupe, R., Weinzierl, A., Friedrich, G.: Conflict generalisation in asp: learning correct and effective non-ground constraints. Theory Pract. Logic Program. 20, 799–814 (2020). https://doi.org/10.1017/S1471068420000368
5. Cuteri, B., Dodaro, C., Ricca, F., Schüller, P.: Overcoming the grounding bottleneck due to constraints in ASP solving: constraints become propagators. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI 2020), pp. 1688–1694. ijcai.org (2020)