2020

  1. Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
    Sketches of Dynamic Complexity.
    SIGMOD Rec. 49(2):18–29, 2020.
    URL, DOI BibTeX

    @article{DBLP:journals/sigmod/SchwentickVZ20,
    	author = "Thomas Schwentick and Nils Vortmeier and Thomas Zeume",
    	title = "Sketches of Dynamic Complexity",
    	journal = "{SIGMOD} Rec.",
    	volume = 49,
    	number = 2,
    	pages = "18--29",
    	year = 2020,
    	url = "https://doi.org/10.1145/3442322.3442325",
    	doi = "10.1145/3442322.3442325",
    	timestamp = "Thu, 17 Dec 2020 16:21:19 +0100",
    	biburl = "https://dblp.org/rec/journals/sigmod/SchwentickVZ20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Claudio Moraga, Milena Stankovic, Suzana Stojkovic and Radomir S Stankovic.
    Methods to Generate Multiple-valued Bent Functions of an odd Number of Variables.
    In 50th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2020, Miyazaki, Japan, November 9-11, 2020. 2020, 70–75.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/ismvl/MoragaSSS20,
    	author = "Claudio Moraga and Milena Stankovic and Suzana Stojkovic and Radomir S. Stankovic",
    	title = "Methods to Generate Multiple-valued Bent Functions of an odd Number of Variables",
    	booktitle = "50th {IEEE} International Symposium on Multiple-Valued Logic, {ISMVL} 2020, Miyazaki, Japan, November 9-11, 2020",
    	pages = "70--75",
    	publisher = "{IEEE}",
    	year = 2020,
    	url = "https://doi.org/10.1109/ISMVL49045.2020.00-27",
    	doi = "10.1109/ISMVL49045.2020.00-27",
    	timestamp = "Fri, 15 Jan 2021 12:53:19 +0100",
    	biburl = "https://dblp.org/rec/conf/ismvl/MoragaSSS20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Claudio Moraga, Milena Stankovic and Radomir S Stankovic.
    On ternary symmetric bent functions.
    In 50th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2020, Miyazaki, Japan, November 9-11, 2020. 2020, 76–81.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/ismvl/MoragaSS20,
    	author = "Claudio Moraga and Milena Stankovic and Radomir S. Stankovic",
    	title = "On ternary symmetric bent functions",
    	booktitle = "50th {IEEE} International Symposium on Multiple-Valued Logic, {ISMVL} 2020, Miyazaki, Japan, November 9-11, 2020",
    	pages = "76--81",
    	publisher = "{IEEE}",
    	year = 2020,
    	url = "https://doi.org/10.1109/ISMVL49045.2020.00-26",
    	doi = "10.1109/ISMVL49045.2020.00-26",
    	timestamp = "Fri, 15 Jan 2021 12:53:19 +0100",
    	biburl = "https://dblp.org/rec/conf/ismvl/MoragaSS20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Radomir S Stankovic, Milena Stankovic, Claudio Moraga and Jaakko T Astola.
    Construction of Ternary Bent Functions by FFT-like Permutation Algorithms.
    In 50th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2020, Miyazaki, Japan, November 9-11, 2020. 2020, 88–93.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/ismvl/StankovicSMA20,
    	author = "Radomir S. Stankovic and Milena Stankovic and Claudio Moraga and Jaakko T. Astola",
    	title = "Construction of Ternary Bent Functions by FFT-like Permutation Algorithms",
    	booktitle = "50th {IEEE} International Symposium on Multiple-Valued Logic, {ISMVL} 2020, Miyazaki, Japan, November 9-11, 2020",
    	pages = "88--93",
    	publisher = "{IEEE}",
    	year = 2020,
    	url = "https://doi.org/10.1109/ISMVL49045.2020.00-24",
    	doi = "10.1109/ISMVL49045.2020.00-24",
    	timestamp = "Fri, 15 Jan 2021 12:53:19 +0100",
    	biburl = "https://dblp.org/rec/conf/ismvl/StankovicSMA20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Suzana Stojkovic, Radomir S Stankovic, Claudio Moraga and Milena Stankovic.
    Reversible Circuits Synthesis from Functional Decision Diagrams by using Node Dependency Matrices.
    J. Circuits Syst. Comput. 29(5):2050079:1–2050079:32, 2020.
    URL, DOI BibTeX

    @article{DBLP:journals/jcsc/StojkovicSMS20,
    	author = "Suzana Stojkovic and Radomir S. Stankovic and Claudio Moraga and Milena Stankovic",
    	title = "Reversible Circuits Synthesis from Functional Decision Diagrams by using Node Dependency Matrices",
    	journal = "J. Circuits Syst. Comput.",
    	volume = 29,
    	number = 5,
    	pages = "2050079:1--2050079:32",
    	year = 2020,
    	url = "https://doi.org/10.1142/S0218126620500796",
    	doi = "10.1142/S0218126620500796",
    	timestamp = "Tue, 20 Oct 2020 14:58:50 +0200",
    	biburl = "https://dblp.org/rec/journals/jcsc/StojkovicSMS20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Jonas Philipp Haldimann, Gabriele Kern-Isberner and Christoph Beierle.
    Syntax Splitting for Iterated Contractions.
    In Diego Calvanese, Esra Erdem and Michael Thielscher (eds.). Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020. 2020, 465–475.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/kr/HaldimannKB20,
    	author = "Jonas Philipp Haldimann and Gabriele Kern{-}Isberner and Christoph Beierle",
    	editor = "Diego Calvanese and Esra Erdem and Michael Thielscher",
    	title = "Syntax Splitting for Iterated Contractions",
    	booktitle = "Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, {KR} 2020, Rhodes, Greece, September 12-18, 2020",
    	pages = "465--475",
    	year = 2020,
    	url = "https://doi.org/10.24963/kr.2020/47",
    	doi = "10.24963/kr.2020/47",
    	timestamp = "Fri, 29 Jan 2021 19:06:02 +0100",
    	biburl = "https://dblp.org/rec/conf/kr/HaldimannKB20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. 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"
    }
    

  1. Gabriele Kern-Isberner, Christoph Beierle and Gerhard Brewka.
    Syntax Splitting = Relevance + Independence: New Postulates for Nonmonotonic Reasoning From Conditional Belief Bases.
    In Diego Calvanese, Esra Erdem and Michael Thielscher (eds.). Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020. 2020, 560–571.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/kr/Kern-IsbernerBB20,
    	author = "Gabriele Kern{-}Isberner and Christoph Beierle and Gerhard Brewka",
    	editor = "Diego Calvanese and Esra Erdem and Michael Thielscher",
    	title = "Syntax Splitting = Relevance + Independence: New Postulates for Nonmonotonic Reasoning From Conditional Belief Bases",
    	booktitle = "Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, {KR} 2020, Rhodes, Greece, September 12-18, 2020",
    	pages = "560--571",
    	year = 2020,
    	url = "https://doi.org/10.24963/kr.2020/56",
    	doi = "10.24963/kr.2020/56",
    	timestamp = "Fri, 29 Jan 2021 19:06:03 +0100",
    	biburl = "https://dblp.org/rec/conf/kr/Kern-IsbernerBB20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. 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"
    }
    

  1. Marco Ragni, Gabriele Kern-Isberner, Christoph Beierle and Kai Sauerwald.
    Cognitive Logics - Features, Formalisms, and Challenges.
    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, 2931–2932.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/ecai/RagniKBS20,
    	author = "Marco Ragni and Gabriele Kern{-}Isberner and Christoph Beierle and Kai Sauerwald",
    	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 = "Cognitive Logics - Features, Formalisms, and Challenges",
    	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 = "2931--2932",
    	publisher = "{IOS} Press",
    	year = 2020,
    	url = "https://doi.org/10.3233/FAIA200459",
    	doi = "10.3233/FAIA200459",
    	timestamp = "Fri, 29 Jan 2021 22:09:02 +0100",
    	biburl = "https://dblp.org/rec/conf/ecai/RagniKBS20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Kai Sauerwald, Gabriele Kern-Isberner and Christoph Beierle.
    A Conditional Perspective for Iterated Belief Contraction.
    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, 889–896.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/ecai/SauerwaldKB20,
    	author = "Kai Sauerwald and Gabriele Kern{-}Isberner and Christoph Beierle",
    	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 = "A Conditional Perspective for Iterated Belief Contraction",
    	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 = "889--896",
    	publisher = "{IOS} Press",
    	year = 2020,
    	url = "https://doi.org/10.3233/FAIA200180",
    	doi = "10.3233/FAIA200180",
    	timestamp = "Fri, 29 Jan 2021 22:09:06 +0100",
    	biburl = "https://dblp.org/rec/conf/ecai/SauerwaldKB20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier and Thomas Zeume.
    Dynamic Complexity of Reachability: How Many Changes Can We Handle?.
    In Artur Czumaj, Anuj Dawar and Emanuela Merelli (eds.). 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) 168. 2020, 122:1–122:19.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/icalp/DattaK0TVZ20,
    	author = "Samir Datta and Pankaj Kumar and Anish Mukherjee and Anuj Tawari and Nils Vortmeier and Thomas Zeume",
    	editor = "Artur Czumaj and Anuj Dawar and Emanuela Merelli",
    	title = "Dynamic Complexity of Reachability: How Many Changes Can We Handle?",
    	booktitle = {47th International Colloquium on Automata, Languages, and Programming, {ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
    	series = "LIPIcs",
    	volume = 168,
    	pages = "122:1--122:19",
    	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
    	year = 2020,
    	url = "https://doi.org/10.4230/LIPIcs.ICALP.2020.122",
    	doi = "10.4230/LIPIcs.ICALP.2020.122",
    	timestamp = "Mon, 21 Dec 2020 13:23:22 +0100",
    	biburl = "https://dblp.org/rec/conf/icalp/DattaK0TVZ20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. 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"
    }
    

  1. Marco Wilhelm and Gabriele Kern-Isberner.
    Context-Based Inferences from Probabilistic Conditionals with Default Negation at Maximum Entropy.
    In Roman Barták and Eric Bell (eds.). Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020. 2020, 593–598.
    URL BibTeX

    @inproceedings{DBLP:conf/flairs/WilhelmK20,
    	author = "Marco Wilhelm and Gabriele Kern{-}Isberner",
    	editor = "Roman Bart{\'{a}}k and Eric Bell",
    	title = "Context-Based Inferences from Probabilistic Conditionals with Default Negation at Maximum Entropy",
    	booktitle = "Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020",
    	pages = "593--598",
    	publisher = "{AAAI} Press",
    	year = 2020,
    	url = "https://aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18505",
    	timestamp = "Thu, 04 Jun 2020 14:36:27 +0200",
    	biburl = "https://dblp.org/rec/conf/flairs/WilhelmK20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. Meliha Sezgin and Gabriele Kern-Isberner.
    Generalized Ranking Kinematics for Iterated Belief Revision.
    In Roman Barták and Eric Bell (eds.). Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020. 2020, 587–592.
    URL BibTeX

    @inproceedings{DBLP:conf/flairs/SezginK20,
    	author = "Meliha Sezgin and Gabriele Kern{-}Isberner",
    	editor = "Roman Bart{\'{a}}k and Eric Bell",
    	title = "Generalized Ranking Kinematics for Iterated Belief Revision",
    	booktitle = "Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020",
    	pages = "587--592",
    	publisher = "{AAAI} Press",
    	year = 2020,
    	url = "https://aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18504",
    	timestamp = "Thu, 04 Jun 2020 14:36:27 +0200",
    	biburl = "https://dblp.org/rec/conf/flairs/SezginK20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }
    

  1. 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"
    }
    

  1. 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"
    }
    

  1. 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."
    }
    

  1. Nils Vortmeier and Thomas Zeume.
    Dynamic Complexity of Parity Exists Queries.
    In Maribel Fernández and Anca Muscholl (eds.). 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain 152. 2020, 37:1–37:16.
    URL, DOI BibTeX

    @inproceedings{DBLP:conf/csl/VortmeierZ20,
    	author = "Nils Vortmeier and Thomas Zeume",
    	editor = "Maribel Fern{\'{a}}ndez and Anca Muscholl",
    	title = "Dynamic Complexity of Parity Exists Queries",
    	booktitle = "28th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2020, January 13-16, 2020, Barcelona, Spain",
    	series = "LIPIcs",
    	volume = 152,
    	pages = "37:1--37:16",
    	publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
    	year = 2020,
    	url = "https://doi.org/10.4230/LIPIcs.CSL.2020.37",
    	doi = "10.4230/LIPIcs.CSL.2020.37",
    	timestamp = "Mon, 06 Jan 2020 17:16:01 +0100",
    	biburl = "https://dblp.org/rec/conf/csl/VortmeierZ20.bib",
    	bibsource = "dblp computer science bibliography, https://dblp.org"
    }