Answering the “why” in answer set programming–A survey of explanation approaches J Fandinno, C Schulz Theory and Practice of Logic Programming 19 (2), 114-203, 2019 | 66 | 2019 |
Causal graph justifications of logic programs P Cabalar, J Fandinno, M Fink Theory and Practice of Logic Programming 14 (4-5), 603-618, 2014 | 38 | 2014 |
A system for explainable answer set programming P Cabalar, J Fandinno, B Muñiz arXiv preprint arXiv:2009.10242, 2020 | 32 | 2020 |
On the expressive power of collective attacks W Dvořák, J Fandinno, S Woltran Argument & Computation 10 (2), 191-230, 2019 | 31 | 2019 |
Valid attacks in argumentation frameworks with recursive attacks C Cayrol, J Fandinno, L Fariñas del Cerro, MC Lagasquie-Schiex Annals of Mathematics and Artificial Intelligence 89, 53-101, 2021 | 30 | 2021 |
Splitting epistemic logic programs P Cabalar, J Fandinno, LF Del Cerro Theory and Practice of Logic Programming 21 (3), 296-316, 2021 | 26 | 2021 |
Verifying tight logic programs with Anthem and Vampire J Fandinno, V Lifschitz, P Lühne, T Schaub Theory and Practice of Logic Programming 20 (5), 735-750, 2020 | 26 | 2020 |
Forgetting auxiliary atoms in forks F Aguado, P Cabalar, J Fandinno, D Pearce, G Pérez, C Vidal Artificial Intelligence 275, 575-601, 2019 | 24 | 2019 |
Argumentation frameworks with recursive attacks and evidence-based supports C Cayrol, J Fandinno, L Fariñas del Cerro, MC Lagasquie-Schiex Foundations of Information and Knowledge Systems: 10th International …, 2018 | 22 | 2018 |
Structure-based semantics of argumentation frameworks with higher-order attacks and supports C Cayrol, J Fandinno, L Farinas Del Cerro, M Lagasquie-Schiex Computational Models of Argument, 29-36, 2018 | 21 | 2018 |
Autoepistemic answer set programming P Cabalar, J Fandinno, LF del Cerro Artificial Intelligence 289, 103382, 2020 | 17 | 2020 |
Treewidth-aware complexity in ASP: not all positive cycles are equally hard J Fandinno, M Hecher Proceedings of the AAAI Conference on Artificial Intelligence 35 (7), 6312-6320, 2021 | 14 | 2021 |
Founded world views with autoepistemic equilibrium logic P Cabalar, J Fandinno, FC Luis International Conference on Logic Programming and Nonmonotonic Reasoning …, 2019 | 14 | 2019 |
Gelfond–Zhang aggregates as propositional formulas P Cabalar, J Fandinno, T Schaub, S Schellhorn Artificial Intelligence 274, 26-43, 2019 | 13 | 2019 |
Functional ASP with intensional sets: Application to Gelfond-Zhang aggregates P Cabalar, J Fandinno, LF Del Cerro, D Pearce Theory and Practice of Logic Programming 18 (3-4), 390-405, 2018 | 13 | 2018 |
Thirty years of epistemic specifications J Fandinno, W Faber, M Gelfond Theory and Practice of Logic Programming 22 (6), 1043-1083, 2022 | 12 | 2022 |
eclingo: A solver for epistemic logic programs P Cabalar, J Fandinno, J Garea, J Romero, T Schaub Theory and Practice of Logic Programming 20 (6), 834-847, 2020 | 12 | 2020 |
Axiomatization of aggregates in answer set programming J Fandinno, Z Hansen, Y Lierler Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5634-5641, 2022 | 11 | 2022 |
Modular answer set programming as a formal specification language P Cabalar, J Fandinno, Y Lierler Theory and Practice of Logic Programming 20 (5), 767-782, 2020 | 11 | 2020 |
Planning with incomplete information in quantified answer set programming J Fandinno, F Laferrière, J Romero, T Schaub, TC Son Theory and Practice of Logic Programming 21 (5), 663-679, 2021 | 10 | 2021 |