1. Shankar, N.: Metamathematics, machines and gödel’s proof. In: Cambridge Tracts in Theoretical Computer Science, No. 38. Cambridge University Press (1997)
2. Jansana, R.: Propositional Consequence Relations and Algebraic Logic. In: Zalta, E.N. (ed.) (2006)
3. Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: a comparative survey. ACM Comput. Surv. 38, 1–54 (2006)
4. Gallier, J.: SLD-resolution and logic programming (PROLOG). In: Logic for Computer Science, Foundations of Automatic Theorem Proving, pp. 410–447. University of Pennsylvania, Department of Computer and Information Science (2003)
5. De Ita, G., Marcial-Romero, R., Bellor, P., Contreras, M.: Belief revision between conjunctive normal forms. J. Intell. Fuzzy Syst. 34(5), 3155–3164 (2018)