References

  1. A. Bondarenko, P.M. Dung, R.A. Kowalski & F. Toni (1997): An Abstract, Argumentation-Theoretic Approach to Default Reasoning. Artif. Intell. 93, pp. 63–101, doi:10.1016/S0004-3702(97)00015-5.
  2. K. Cyras, X. Fan, C. Schulz & F. Toni (2017): Assumption-based Argumentation: Disputes, Explanations, Preferences. FLAP 4(8).
  3. Y. Dimopoulos & A. C. Kakas (1995): Learning Non-Monotonic Logic Programs: Learning Exceptions. In: ECML 1995, pp. 122–137, doi:10.1007/3-540-59286-5_53.
  4. P.M. Dung, R.A. Kowalski & F. Toni (2009): Assumption-Based Argumentation. In: Argumentation in Artificial Intelligence. Springer, pp. 199–218, doi:10.1007/978-0-387-98197-0_10.
  5. M. Gelfond & V. Lifschitz (1991): Classical negation in logic programs and disjunctive databases. New Generation Computing 9, pp. 365–385, doi:10.1007/BF03037169.
  6. K. Inoue & H. Haneda (2000): Learning Abductive and Nonmonotonic Logic Programs. In: Abduction and Induction: Essays on their Relation and Integration. Kluwer Academic, pp. 213–231, doi:10.1007/978-94-017-0606-3_14.
  7. K.Inoue & Y.Kudoh (1997): Learning\,Extended\,Logic\,Programs. In: \!IJCAI. Morgan\,Kaufmann, pp. \!176–181.
  8. M. Law, A. Russo & K. Broda (2014): Inductive Learning of Answer Set Programs. In: JELIA 2014, LNCS 8761, pp. 311–325, doi:10.1007/978-3-319-11558-0_22.
  9. S. Muggleton (1995): Inverse entailment and Progol. New generation computing 13(3-4), pp. 245–286, doi:10.1007/BF03037227.
  10. A. Pettorossi & M. Proietti (1994): Transformation of Logic Programs: Foundations and Techniques. J. Log. Program. 19/20, pp. 261–320, doi:10.1016/0743-1066(94)90028-0.
  11. N. Prentzas, A. Gavrielidou, M. Neofytou & A. C. Kakas (2022): Argumentation-based Explainable Machine Learning (ArgEML): A Real-life Use Case on Gynecological Cancer. In: ArgML 2022, CEUR Workshop Proceedings, 3208, pp. 1–13.
  12. M. Proietti & F. Toni (2023): Learning Assumption-based Argumentation Frameworks. CoRR, doi:10.48550/arXiv.2305.15921. To appear in Proc. ILP `22, LNCS, Springer..
  13. O. Ray (2009): Nonmonotonic abductive inductive learning. J. Appl. Log. 7(3), pp. 329–340, doi:10.1016/j.jal.2008.10.007.
  14. C. Sakama (2000): Inverse Entailment in Nonmonotonic Logic Programs. In: Proc. ILP 2000, doi:10.1007/3-540-44960-4_13.
  15. C. Sakama (2005): Induction from answer sets in nonmonotonic logic programs. ACM TOCL 6(2), pp. 203–231, doi:10.1145/1055686.1055687.
  16. C. Sakama & K. Inoue (2009): Brave induction: A logical framework for learning from incomplete information. Mach. Learn. 76(1), pp. 3–35, doi:10.1007/s10994-009-5113-y.
  17. F. Shakerin, E. Salazar & G. Gupta (2017): A new algorithm to automate inductive learning of default theories. TPLP 17(5-6), pp. 1010–1026, doi:10.1017/S1471068417000333.
  18. F. Toni (2014): A tutorial on Assumption-based Argumentation. Argument & Computation 5(1), pp. 89–117, doi:10.1080/19462166.2013.869878.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org