References

  1. M. Aschinger, C. Drescher, G. Friedrich, G. Gottlob, P. Jeavons, A. Ryabokon & E. Thorstensen (2011): Optimization Methods for the Partner Units Problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science 6697. Springer, pp. 4–19, doi:10.1007/978-3-642-21311-3_4.
  2. G. Brewka, T. Eiter & M. Truszczyński (2011): Answer Set Programming at a Glance. Communications of the ACM 54(12), pp. 92–103, doi:10.1145/2043174.2043195.
  3. P. Codenotti, H. Katebi, K. Sakallah & I. Markov (2013): Conflict Analysis and Branching Heuristics in the Search for Graph Automorphisms. In: IEEE 25th International Conference on Tools with Artificial Intelligence. IEEE Computer Society, pp. 907–914, doi:10.1109/ICTAI.2013.139.
  4. D. Cohen, P. Jeavons, C. Jefferson, K. Petrie & B. Smith (2006): Symmetry Definitions for Constraint Satisfaction Problems. Constraints 11(2-3), pp. 115–137, doi:10.1007/s10601-006-8059-8.
  5. J. Crawford & A. Baker (1994): Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems. In: Proceedings of the twelfth national conference on Artificial Intelligence, pp. 1092–1097.
  6. A. Cropper, S. Dumanči\'c & S. Muggleton (2020): Turning 30: New Ideas in Inductive Logic Programming. In: C. Bessiere: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI'20). ijcai.org, pp. 4833–4839, doi:10.24963/ijcai.2020/673.
  7. A. Cropper & S. Dumančić (2020): Inductive Logic Programming at 30: A New Introduction. https://arxiv.org/abs/2008.07912. ArXiv:2008.07912.
  8. P. Darga, H. Katebi, M. Liffiton, I. Markov & K. Sakallah (2004): Saucy. http://vlsicad.eecs.umich.edu/BK/SAUCY/.
  9. J. Devriendt, B. Bogaerts, M. Bruynooghe & M. Denecker (2016): On Local Domain Symmetry for Model Expansion. Theory and Practice of Logic Programming 16(5-6), pp. 636–652, doi:10.1017/S1471068416000508.
  10. C. Dodaro, P. Gasteiger, N. Leone, B. Musitsch, F. Ricca & K. Schekotihin (2016): Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems. Theory and Practice of Logic Programming 16(5-6), pp. 653–669, doi:10.1017/S1471068416000284.
  11. C. Drescher, O. Tifrea & T. Walsh (2011): Symmetry-breaking Answer Set Solving. AI Communications 24(2), pp. 177–194, doi:10.3233/AIC-2011-0495.
  12. E. Erdem, M. Gelfond & N. Leone (2016): Applications of ASP. AI Magazine 37(3), pp. 53–68, doi:10.1609/aimag.v37i3.2678.
  13. G. Friedrich, A. Ryabokon, A. Falkner, A. Haselböck, G. Schenner & H. Schreiner (2011): (Re)configuration using Answer Set Programming. In: IJCAI 2011 Workshop on Configuration. CEUR-WS.org, pp. 17–24.
  14. M. Gebser, R. Kaminski, B. Kaufmann & T. Schaub (2012): Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, doi:10.2200/S00457ED1V01Y201211AIM019.
  15. M. Gelfond & V. Lifschitz (1988): The Stable Model Semantics for Logic Programming. In: R. Kowalski & K. Bowen: Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP'88). MIT Press, pp. 1070–1080.
  16. M. Gelfond & V. Lifschitz (1991): Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, pp. 365–385, doi:10.1007/BF03037169.
  17. M. Law (2022): Conflict-driven Inductive Logic Programming. Theory and Practice of Logic Programming, pp. 1–28, doi:10.1017/S1471068422000011.
  18. M. Law, A. Russo & K. Broda (2014): Inductive Learning of Answer Set Programs. In: E. Fermé & J. Leite: Proceedings of the Fourteenth European Conference on Logics in Artificial Intelligence (JELIA'14), Lecture Notes in Artificial Intelligence 8761. Springer-Verlag, pp. 311–325, doi:10.1007/978-3-319-11558-0_22.
  19. M. Law, A. Russo & K. Broda (2018): Inductive Learning of Answer Set Programs from Noisy Examples. Advances in Cognitive Systems 7, pp. 57–76.
  20. M. Law, A. Russo & K. Broda (2020): The ILASP System for Inductive Learning of Answer Set Programs. The Association for Logic Programming Newsletter. Available at https://www.cs.nmsu.edu/ALP/2020/04/the-ilasp-system-for-inductive-learning-of-answer-set-programs/.
  21. M. Law, A. Russo & K. Broda (2021): ILASP. www.ilasp.com.
  22. C. Mears, M. García de la Banda, M. Wallace & B. Demoen (2008): A Novel Approach for Detecting Symmetries in CSP Models. In: L. Perron & M. Trick: Proceedings of the Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08), Lecture Notes in Computer Science 5015. Springer-Verlag, pp. 158–172, doi:10.1007/978-3-540-68155-7_14.
  23. J. Puget (2005): Automatic Detection of Variable and Value Symmetries. In: P. van Beek: Proceedings of the Eleventh International Conference on Principles and Practice of Constraint Programming (CP'05), Lecture Notes in Computer Science 3709. Springer-Verlag, pp. 475–489, doi:10.1007/11564751_36.
  24. K. Sakallah (2009): Symmetry and Satisfiability. In: A. Biere, M. Heule, H. van Maaren & T. Walsh: Handbook of Satisfiability, chapter 10, Frontiers in Artificial Intelligence and Applications 185. IOS Press, pp. 289–338, doi:10.3233/978-1-58603-929-5-289.
  25. T. Syrjänen (2001): Lparse 1.0 User's Manual. Available at http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz.
  26. A. Tarzariol, M. Gebser, M. Law & K. Schekotihin (2022): Efficient lifting of symmetry breaking constraints for complex combinatorial problems, doi:10.48550/ARXIV.2205.07129. Available at https://arxiv.org/abs/2205.07129.
  27. A. Tarzariol, M. Gebser & K. Schekotihin (2021): Lifting Symmetry Breaking Constraints with Inductive Logic Programming. In: Z. Zhi-Hua: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI'21). ijcai.org, pp. 2062–2068, doi:10.24963/ijcai.2021/284.
  28. A. Tarzariol, M. Gebser & K. Schekotihin (2022): Lifting Symmetry Breaking Constraints with Inductive Logic Programming. Machine Learning 111(4), pp. 1303 – 1326, doi:10.1007/s10994-022-06146-3.
  29. Erich Christian Teppan, Gerhard Friedrich & Georg Gottlob (2016): Tractability frontiers of the partner units configuration problem. J. Comput. Syst. Sci. 82(5), pp. 739–755, doi:10.1016/j.jcss.2015.12.004.
  30. T. Walsh (2012): Symmetry Breaking Constraints: Recent Results. In: J. Hoffmann & B. Selman: Proceedings of the Twenty-Sixth National Conference on Artificial Intelligence (AAAI'12). AAAI Press, pp. 2192–2198.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org