Publications
Published
- [conference] Plaud R., Labeau M., Saillenfest A., Bonald T. (2024). Revisiting Hierarchical Text Classification: Inference and Metrics, In Proceedings of CoNLL 2024 - 28th Conference on Computational Natural Language Learning.
- [conference] Lemberger, P., & Saillenfest, A. (2024). Explaining Text Classifiers with Counterfactual Representations. In Proceedings of ECAI 2024 - 27th European Conference on Artificial Intelligence.
- [preprint] Lemberger, P., & Saillenfest, A. (2023). How Graph Structure and Label Dependencies Contribute to Node Classification in a Large Network of Documents.
- [conference] Sileno, G., Saillenfest, A., & Dessalles, J. L. (2017, December). A Computational Model of Moral and Legal Responsibility via Simplicity Theory. In Proceedings of JURIX 2017 - 30th international conference on Legal Knowledge and Information Systems.
- [conference] Saillenfest, A., Dessalles, J. L., & Auber, O. (2016, June). Role of Simplicity in Creative Behaviour: The Case of the Poietic Generator. In Proceedings of ICCC 2016 - 7th International Conference on Computational Creativity.
- [conference] Saillenfest, A., & Dessalles, J. L. (2015, July). Some Probability Judgments may rely on Complexity Assessments. In Proceedings of CogSci 2015.
- [journal] Saillenfest, A., & Dessalles, J. L. (2014). Can Believable Characters act Unexpectedly?. Literary and Linguistic Computing, 29(4), 606-620.
- [workshop] Saillenfest, A., & Dessalles, J. L. (2014, August). A Cognitive Approach to Narrative Planning with Believable Characters. In Proceeding of CMN 2014 - 5th Workshop on Computational Models of Narrative.
- [workshop] Saillenfest, A., & Dessalles, J. L. (2013). Using Unexpected Simplicity to control Moral Judgments and Interest in Narratives. In Proceedings of CMN 2013 - 4th Workshop on Computational Models of Narrative.
- [conference] Saillenfest, A., & Dessalles, J. L. (2012, August). Role of Kolmogorov Complexity on Interest in Moral Dilemma Stories. In Proceedings of CogSci 2012.
PhD thesis