Stephen Muggleton and Luc De Raedt. Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19:629-679, 1994.
Ivan Bratko and Stephen Muggleton. Applications of inductive logic programming. Communications of the ACM, 38(11):65-70, 1995.
Fan Yang, Zhilin Yang, and William W Cohen. Differentiable learning of logical rules for knowledge base reasoning. Advances in neural information processing systems, 30, 2017.
Richard Evans and Edward Grefenstette. Learning explanatory rules from noisy data. Journal of Artificial Intelligence Research, 61:1-64, 2018.
Andrew Cropper and Sebastijan Dumančić. Inductive logic programming at 30: a new introduction. Journal of Artificial Intelligence Research, 74:765-850, 2022.
Jean-Luc Marichal and Pierre Mathonet. Symmetric approximations of pseudo-boolean functions. arXiv preprint arXiv:1004.2593, 2010.
Carla P Gomes, Willem-Jan Van Hoeve, and Lucian Leahu. The power of semidefinite programming relaxations for max-sat. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Third International Conference, CPAIOR 2006, Cork, Ireland, May 31-June 2, 2006. Proceedings 3, pages 104-118. Springer, 2006.
Peter L Hammer and Abraham A Rubin. Some remarks on quadratic programming with 0-1 variables. Revue francaise d'informatique et de recherche opérationnelle. Série verte, 4(V3):67-79, 1970.
Christoph Buchheim, Alberto Caprara, and Andrea Lodi. An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical programming, 135:369-395, 2012.
James E Kelley, Jr. The cutting-plane method for solving convex programs. Journal of the society for Industrial and Applied Mathematics, 8(4):703-712, 1960.
Alexandre d'Aspremont and Stephen Boyd. Relaxations and randomized methods for nonconvex qcqps. EE392o Class Notes, Stanford University, 1:1-16, 2003.
Po-Wei Wang and J Zico Kolter. Low-rank semidefinite programming for the max2sat problem. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 1641-1649, 2019.
Samuel Burer and Yinyu Ye. Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Mathematical Programming, 181(1):1-17, 2020.
Alex L Wang and Fatma Kılınc-Karzan. On the tightness of sdp relaxations of qcqps. Mathematical Programming, 193(1):33-73, 2022.
Inês Lynce and João Ouaknine. Sodomu as a sat problem. In AI&M, 2006.
Shu-Cherng Fang and Sarat Puthenpura. Linear optimization and extensions: theory and algorithms. Prentice-Hall, Inc., 1993.
Mislav Balunovic, Pavol Bielik, and Martin Vechev. Learning to solve smt formulas. Advances in Neural Information Processing Systems, 31, 2018.
Cristina Cornelio, Jan Stuehmer, Shell Xu Hu, and Timothy Hospedales. Learning where and when to reason in neuro-symbolic inference. In *The Eleventh International Conference on Learning Representations*, 2023.
Léon Bottou, Frank E Curtis, and Jorge Nocedal. Optimization methods for large-scale machine learning. SIAM review, 60(2):223-311, 2018.
Shai Shalev-Shwartz, Ohad Shamir, and Shaked Shammah. Failures of gradient-based deep learning. In International Conference on Machine Learning, pages 3067-3075. PMLR, 2017.