2020
Jesse Heyninck and Ofer Arieli.
Argumentative Reflections of Approximation Fixpoint Theory.
In Henry Prakken, Stefano Bistarelli, Francesco Santini and Carlo Taticchi (eds.). Computational Models of Argument - Proceedings of COMMA 2020, Perugia, Italy, September 4-11, 2020 326. 2020, 215–226.
URL, DOI BibTeX@inproceedings{DBLP:conf/comma/HeyninckA20, author = "Jesse Heyninck and Ofer Arieli", editor = "Henry Prakken and Stefano Bistarelli and Francesco Santini and Carlo Taticchi", title = "Argumentative Reflections of Approximation Fixpoint Theory", booktitle = "Computational Models of Argument - Proceedings of {COMMA} 2020, Perugia, Italy, September 4-11, 2020", series = "Frontiers in Artificial Intelligence and Applications", volume = 326, pages = "215--226", publisher = "{IOS} Press", year = 2020, url = "https://doi.org/10.3233/FAIA200506", doi = "10.3233/FAIA200506", timestamp = "Fri, 29 Jan 2021 21:15:48 +0100", biburl = "https://dblp.org/rec/conf/comma/HeyninckA20.bib", bibsource = "dblp computer science bibliography, https://dblp.org" }
Ofer Arieli and Jesse Heyninck.
Prioritized Simple Contrapositive Assumption-Based Frameworks.
In Giuseppe De Giacomo, Alejandro Catalá, Bistra Dilkina, Michela Milano, Senén Barro, Alberto Bugar{\'ı}n and Jérôme Lang (eds.). ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) 325. 2020, 608–615.
URL, DOI BibTeX@inproceedings{DBLP:conf/ecai/ArieliH20, author = "Ofer Arieli and Jesse Heyninck", editor = "Giuseppe De Giacomo and Alejandro Catal{\'{a}} and Bistra Dilkina and Michela Milano and Sen{\'{e}}n Barro and Alberto Bugar{\'{\i}}n and J{\'{e}}r{\^{o}}me Lang", title = "Prioritized Simple Contrapositive Assumption-Based Frameworks", booktitle = "{ECAI} 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence {(PAIS} 2020)", series = "Frontiers in Artificial Intelligence and Applications", volume = 325, pages = "608--615", publisher = "{IOS} Press", year = 2020, url = "https://doi.org/10.3233/FAIA200145", doi = "10.3233/FAIA200145", timestamp = "Fri, 29 Jan 2021 22:09:09 +0100", biburl = "https://dblp.org/rec/conf/ecai/ArieliH20.bib", bibsource = "dblp computer science bibliography, https://dblp.org" }
Jesse Heyninck and Gabriele Kern-Isberner.
An Epistemic Interpretation of Abstract Dialectical Argumentation.
In Henry Prakken, Stefano Bistarelli, Francesco Santini and Carlo Taticchi (eds.). Computational Models of Argument - Proceedings of COMMA 2020, Perugia, Italy, September 4-11, 2020 326. 2020, 227–238.
URL, DOI BibTeX@inproceedings{DBLP:conf/comma/HeyninckK20, author = "Jesse Heyninck and Gabriele Kern{-}Isberner", editor = "Henry Prakken and Stefano Bistarelli and Francesco Santini and Carlo Taticchi", title = "An Epistemic Interpretation of Abstract Dialectical Argumentation", booktitle = "Computational Models of Argument - Proceedings of {COMMA} 2020, Perugia, Italy, September 4-11, 2020", series = "Frontiers in Artificial Intelligence and Applications", volume = 326, pages = "227--238", publisher = "{IOS} Press", year = 2020, url = "https://doi.org/10.3233/FAIA200507", doi = "10.3233/FAIA200507", timestamp = "Fri, 29 Jan 2021 21:15:48 +0100", biburl = "https://dblp.org/rec/conf/comma/HeyninckK20.bib", bibsource = "dblp computer science bibliography, https://dblp.org" }
Jesse Heyninck, Gabriele Kern-Isberner and Matthias Thimm.
On the Correspondence Between Abstract Dialectical Frameworks and Nonmonotonic Conditional Logics.
In The Thirty-Third International Flairs Conference. 2020.
URL BibTeX@inproceedings{heyninck2020correspondence, title = "On the Correspondence Between Abstract Dialectical Frameworks and Nonmonotonic Conditional Logics", author = "Heyninck, Jesse and Kern-Isberner, Gabriele and Thimm, Matthias", booktitle = "The Thirty-Third International Flairs Conference", year = 2020, url = "https://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/viewPaper/18502" }
Jesse Heyninck and Christian Straßer.
Rationality and maximal consistent sets for a fragment of ASPIC+ without undercut.
Argument & Computation (Preprint):1–45.
URL BibTeX@article{heyninckrationality, title = "Rationality and maximal consistent sets for a fragment of ASPIC+ without undercut", author = "Heyninck, Jesse and Stra{\ss}er, Christian", journal = "Argument \& Computation", number = "Preprint", pages = "1--45", publisher = "IOS Press", url = "https://content.iospress.com/articles/argument-and-computation/aac200903" }
Jesse Heyninck and Ofer Arieli.
Simple contrapositive assumption-based argumentation frameworks.
International Journal of Approximate Reasoning, 2020.
Abstract Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation, with tight links to different forms of defeasible reasoning. In this paper we study the Dung semantics for extended forms of assumption-based argumentation frameworks (ABFs), based on any contrapositive propositional logic, and whose defeasible assumptions are expressed by arbitrary formulas in that logic. We show that unless the falsity propositional constant is part of the defeasible assumptions, the grounded and the well-founded semantics for ABFs lack most of the desirable properties they have in abstract argumentation frameworks (AAFs), and that for simple definitions of the contrariness operator and the attacks relations, preferred and stable semantics are reduced to naive semantics. We also show the redundancy of the closure condition in the standard definition of Dung's semantics for ABFs, and investigate the use of disjunctive attacks in this setting. Finally, we show some close relations of reasoning with ABFs to reasoning with maximally consistent sets of premises, and consider some properties of the induced entailments, such as being cumulative, preferential, or rational relations that satisfy non-interference.
URL, DOI BibTeX@article{HEYNINCK2020, title = "Simple contrapositive assumption-based argumentation frameworks", journal = "International Journal of Approximate Reasoning", year = 2020, issn = "0888-613X", doi = "https://doi.org/10.1016/j.ijar.2020.02.011", url = "http://www.sciencedirect.com/science/article/pii/S0888613X19303639", author = "Jesse Heyninck and Ofer Arieli", keywords = "Structured argumentation, Dung's semantics, Assumption-based argumentation, Deductive argumentation, Defeasible reasoning, Inconsistency management", abstract = "Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation, with tight links to different forms of defeasible reasoning. In this paper we study the Dung semantics for extended forms of assumption-based argumentation frameworks (ABFs), based on any contrapositive propositional logic, and whose defeasible assumptions are expressed by arbitrary formulas in that logic. We show that unless the falsity propositional constant is part of the defeasible assumptions, the grounded and the well-founded semantics for ABFs lack most of the desirable properties they have in abstract argumentation frameworks (AAFs), and that for simple definitions of the contrariness operator and the attacks relations, preferred and stable semantics are reduced to naive semantics. We also show the redundancy of the closure condition in the standard definition of Dung's semantics for ABFs, and investigate the use of disjunctive attacks in this setting. Finally, we show some close relations of reasoning with ABFs to reasoning with maximally consistent sets of premises, and consider some properties of the induced entailments, such as being cumulative, preferential, or rational relations that satisfy non-interference." }