Publisher
Springer Nature Switzerland
Reference26 articles.
1. Ahlgren, J., Yuen, S.Y.: Efficient program synthesis using constraint satisfaction in inductive logic programming. J. Mach. Learn. Res. 14(1), 3649–3682 (2013)
2. Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97–116 (2012)
3. Chang, W., Zhang, H., Luo, J.: Predicting propositional satisfiability based on graph attention networks. Int. J. Comput. Intell. Syst. 15(1), 84 (2022)
4. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM (1971)
5. Cropper, A., Dumancic, S., Evans, R., Muggleton, S.H.: Inductive logic programming at 30. Mach. Learn. 111(1), 147–172 (2022)