References

1. Explainable Artificial Intelligence (XAI), doi:10.23919/MIPRO.2018.8400040. Available at https://www.darpa.mil/program/explainable-artificial-intelligence.
2. Chitta Baral (2003): Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge, New York, Melbourne, doi:10.1017/CBO9780511543357.
3. Tianqi Chen & Carlos Guestrin (2016): XGBoost: A Scalable Tree Boosting System. In: Proceedings of the 22Nd ACM SIGKDD, KDD '16, pp. 785–794, doi:10.1145/2939672.2939785.
4. Wensheng Gan, Jerry Chun-Wei Lin, Philippe Fournier-Viger, Han-Chieh Chao, Tzung-Pei Hong & Hamido Fujita (2018): A survey of incremental high-utility itemset mining. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 8(2), doi:10.1609/aaai.v33i01.33013052.
5. Michael Gelfond & Yulia Kahl (2014): Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press, New York, NY, USA, doi:10.1017/CBO9781139342124.
6. M. Lichman (2013): UCI,ML Repository, http://archive.ics.uci.edu/ml.
7. Scott M Lundberg & Su-In Lee (2017): A unified approach to interpreting model predictions. https://github.com/slundberg/shap.
8. K. L. McMillan (2005): An Interpolating Theorem Prover. Theor. Comput. Sci. 345(1), pp. 101–121, doi:10.1016/j.tcs.2005.07.003.
9. Stephen Muggleton (1991): Inductive Logic Programming. New Gen. Comput. 8(4), pp. 295–318, doi:10.1007/BF03037089.
10. Stephen Muggleton, Luc Raedt, David Poole, Ivan Bratko, Peter Flach, Katsumi Inoue & Ashwin Srinivasan (2012): ILP Turns 20. Mach. Learn. 86(1), pp. 3–23, doi:10.1007/s10994-011-5259-2.
11. G. D. Plotkin (1971): A further note on inductive generalization, In machine Intelligence, volume 6, pages 101-124.
12. J. Ross Quinlan (1990): Learning Logical Definitions from Relations. Machine Learning 5, pp. 239–266, doi:10.1007/BF00117105.
13. Marco Tulio Ribeiro, Sameer Singh & Carlos Guestrin (2016): "Why Should I Trust You?": Explaining the Predictions of Any Classifier. In: Proceedings of the 22nd ACM SIGKDD 2016, pp. 1135–1144, doi:10.1145/2939672.2939778.
14. F. Riguzzi (2016): ALEPH in SWI-Prolog. Available at https://github.com/friguzzi/aleph.
15. Chiaki Sakama (2005): Induction from answer sets in nonmonotonic logic programs. ACM Trans. Comput. Log. 6(2), pp. 203–231, doi:10.1145/1055686.1055687.
16. F. Shakerin (2019): FOLD package. https://github.com/fxs130430/SHAP_FOLD.
17. Farhad Shakerin & Gopal Gupta (2019): Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME. In: AAAI. AAAI Press, pp. 3052–3059, doi:10.1609/aaai.v33i01.33013052.
18. Farhad Shakerin, Elmer Salazar & Gopal Gupta (2017): A new algorithm to automate inductive learning of default theories. TPLP 17(5-6), pp. 1010–1026, doi:10.1017/S1471068417000333.
19. A. Srinivasan (2001): The Aleph Manual. Available at http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/.
20. Paul Voigt & Axel von dem Bussche (2017): The EU General Data Protection Regulation (GDPR): A Practical Guide, 1st edition. Springer Publishing Company, Incorporated, doi:10.1007/978-3-319-57959-7.
21. Sandra Wachter, Brent Mittelstadt & Chris Russell (2017): Counterfactual explanations without opening the black box: Automated decisions and the GDPR.(2017). Harvard Journal of Law & Technology 31, pp. 841, doi:10.2139/ssrn.3063289.
22. Qiang Zeng, Jignesh M. Patel & David Page (2014): QuickFOIL: Scalable Inductive Logic Programming. Proc. VLDB Endow. 8(3), pp. 197–208, doi:10.14778/2735508.2735510.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org