1. Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic 51(1–2), 1–77 (1991)
2. Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). www.SMT-LIB.org
3. Barto, L., DeMeo, W.J., Mottet, A.: The complexity of the homomorphism problem for boolean structures (2020). CoRR abs/2010.04958, https://arxiv.org/abs/2010.04958
4. Baumgartner, P., Fuchs, A., Nivelle, H.D., Tinelli, C.: Computing finite models by reduction to function-free clause logic. J. Appl. Logic 7(1), 58–74 (2009)
5. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);M Bezem,2005